./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 01:16:22,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 01:16:22,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-23 01:16:22,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 01:16:22,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 01:16:22,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 01:16:22,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 01:16:22,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 01:16:22,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 01:16:22,420 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 01:16:22,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 01:16:22,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 01:16:22,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 01:16:22,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 01:16:22,423 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 01:16:22,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 01:16:22,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 01:16:22,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 01:16:22,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 01:16:22,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 01:16:22,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 01:16:22,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 01:16:22,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 01:16:22,430 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-23 01:16:22,430 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 01:16:22,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 01:16:22,430 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 01:16:22,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 01:16:22,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 01:16:22,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 01:16:22,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 01:16:22,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 01:16:22,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 01:16:22,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 01:16:22,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 01:16:22,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 01:16:22,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 01:16:22,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 01:16:22,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 01:16:22,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 01:16:22,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 01:16:22,435 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2024-11-23 01:16:22,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 01:16:22,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 01:16:22,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 01:16:22,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 01:16:22,737 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 01:16:22,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-23 01:16:24,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 01:16:24,518 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 01:16:24,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-23 01:16:24,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cdc3fcf6/19791f22e0364ea7b63dbd1758df384a/FLAG7ddea146a [2024-11-23 01:16:24,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cdc3fcf6/19791f22e0364ea7b63dbd1758df384a [2024-11-23 01:16:24,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 01:16:24,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 01:16:24,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 01:16:24,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 01:16:24,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 01:16:24,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:24" (1/1) ... [2024-11-23 01:16:24,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6242151f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:24, skipping insertion in model container [2024-11-23 01:16:24,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:24" (1/1) ... [2024-11-23 01:16:24,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 01:16:25,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 01:16:25,266 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 01:16:25,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 01:16:25,474 INFO L204 MainTranslator]: Completed translation [2024-11-23 01:16:25,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:25 WrapperNode [2024-11-23 01:16:25,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 01:16:25,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 01:16:25,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 01:16:25,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 01:16:25,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:25" (1/1) ... [2024-11-23 01:16:25,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:25" (1/1) ... [2024-11-23 01:16:25,572 INFO L138 Inliner]: procedures = 346, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 742 [2024-11-23 01:16:25,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 01:16:25,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 01:16:25,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 01:16:25,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 01:16:25,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:25" (1/1) ... [2024-11-23 01:16:25,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:25" (1/1) ... [2024-11-23 01:16:25,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:25" (1/1) ... [2024-11-23 01:16:25,652 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 3, 355, 12, 12, 2, 2]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 1, 355, 0, 0, 0, 0]. The 11 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 5, 2, 1, 2]. [2024-11-23 01:16:25,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:25" (1/1) ... [2024-11-23 01:16:25,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:25" (1/1) ... [2024-11-23 01:16:25,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:25" (1/1) ... [2024-11-23 01:16:25,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:25" (1/1) ... [2024-11-23 01:16:25,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:25" (1/1) ... [2024-11-23 01:16:25,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:25" (1/1) ... [2024-11-23 01:16:25,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 01:16:25,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 01:16:25,795 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 01:16:25,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 01:16:25,796 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:25" (1/1) ... [2024-11-23 01:16:25,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 01:16:25,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:25,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 01:16:25,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 01:16:25,885 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-23 01:16:25,885 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-23 01:16:25,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 01:16:25,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 01:16:25,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-23 01:16:25,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-23 01:16:25,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-23 01:16:25,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-23 01:16:25,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-23 01:16:25,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-23 01:16:25,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-23 01:16:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-23 01:16:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-23 01:16:25,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-23 01:16:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-23 01:16:25,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-23 01:16:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 01:16:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-23 01:16:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-23 01:16:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-23 01:16:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-23 01:16:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-23 01:16:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-23 01:16:25,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-23 01:16:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-23 01:16:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-23 01:16:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-23 01:16:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-23 01:16:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-23 01:16:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-23 01:16:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-23 01:16:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-23 01:16:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-23 01:16:25,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-23 01:16:25,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-23 01:16:25,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-23 01:16:25,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-23 01:16:25,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-23 01:16:25,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-23 01:16:25,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-23 01:16:25,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-23 01:16:25,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-23 01:16:25,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-23 01:16:25,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-23 01:16:25,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-23 01:16:25,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 01:16:25,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 01:16:25,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 01:16:25,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 01:16:25,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-23 01:16:25,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-23 01:16:25,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-23 01:16:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-23 01:16:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-23 01:16:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-23 01:16:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-23 01:16:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-23 01:16:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-23 01:16:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-23 01:16:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-23 01:16:25,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-23 01:16:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 01:16:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 01:16:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-23 01:16:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-23 01:16:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-23 01:16:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-23 01:16:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-23 01:16:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-23 01:16:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-23 01:16:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-23 01:16:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-23 01:16:25,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-23 01:16:25,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-23 01:16:25,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-23 01:16:25,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 01:16:25,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 01:16:26,301 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 01:16:26,303 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 01:16:26,924 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2024-11-23 01:16:26,925 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 01:16:26,968 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 01:16:26,968 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-23 01:16:26,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:26 BoogieIcfgContainer [2024-11-23 01:16:26,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 01:16:26,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 01:16:26,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 01:16:26,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 01:16:26,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:16:24" (1/3) ... [2024-11-23 01:16:26,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cd69bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:26, skipping insertion in model container [2024-11-23 01:16:26,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:25" (2/3) ... [2024-11-23 01:16:26,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cd69bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:26, skipping insertion in model container [2024-11-23 01:16:26,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:26" (3/3) ... [2024-11-23 01:16:26,977 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-2.i [2024-11-23 01:16:26,993 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 01:16:26,993 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-23 01:16:27,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 01:16:27,062 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1942ba14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 01:16:27,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-23 01:16:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 94 states have (on average 1.7127659574468086) internal successors, (161), 118 states have internal predecessors, (161), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-23 01:16:27,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:27,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-23 01:16:27,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:27,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-23 01:16:27,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:27,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503185663] [2024-11-23 01:16:27,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:27,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:16:27,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:27,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503185663] [2024-11-23 01:16:27,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503185663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:27,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:16:27,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 01:16:27,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862073589] [2024-11-23 01:16:27,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:27,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:16:27,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:27,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:16:27,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:27,695 INFO L87 Difference]: Start difference. First operand has 122 states, 94 states have (on average 1.7127659574468086) internal successors, (161), 118 states have internal predecessors, (161), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 01:16:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:27,764 INFO L93 Difference]: Finished difference Result 241 states and 329 transitions. [2024-11-23 01:16:27,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:16:27,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-23 01:16:27,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:27,777 INFO L225 Difference]: With dead ends: 241 [2024-11-23 01:16:27,777 INFO L226 Difference]: Without dead ends: 119 [2024-11-23 01:16:27,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:27,787 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:27,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 292 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:27,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-23 01:16:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-23 01:16:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.5869565217391304) internal successors, (146), 115 states have internal predecessors, (146), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2024-11-23 01:16:27,836 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 4 [2024-11-23 01:16:27,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:27,837 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2024-11-23 01:16:27,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 01:16:27,837 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2024-11-23 01:16:27,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-23 01:16:27,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:27,838 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-23 01:16:27,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 01:16:27,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:27,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:27,840 INFO L85 PathProgramCache]: Analyzing trace with hash 556468371, now seen corresponding path program 1 times [2024-11-23 01:16:27,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:27,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138706966] [2024-11-23 01:16:27,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:16:28,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:28,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138706966] [2024-11-23 01:16:28,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138706966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:28,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226394129] [2024-11-23 01:16:28,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:28,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:28,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:28,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:28,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 01:16:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:28,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 01:16:28,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:16:28,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:16:28,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226394129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:28,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 01:16:28,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-23 01:16:28,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973286062] [2024-11-23 01:16:28,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 01:16:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:28,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 01:16:28,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:16:28,505 INFO L87 Difference]: Start difference. First operand 119 states and 150 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 01:16:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:28,540 INFO L93 Difference]: Finished difference Result 119 states and 150 transitions. [2024-11-23 01:16:28,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 01:16:28,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-23 01:16:28,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:28,542 INFO L225 Difference]: With dead ends: 119 [2024-11-23 01:16:28,542 INFO L226 Difference]: Without dead ends: 118 [2024-11-23 01:16:28,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:16:28,543 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:28,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 280 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:28,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-23 01:16:28,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-23 01:16:28,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.576086956521739) internal successors, (145), 114 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2024-11-23 01:16:28,556 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 7 [2024-11-23 01:16:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:28,557 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2024-11-23 01:16:28,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 01:16:28,557 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2024-11-23 01:16:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-23 01:16:28,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:28,558 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-23 01:16:28,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 01:16:28,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:28,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:28,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:28,761 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-23 01:16:28,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:28,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942622311] [2024-11-23 01:16:28,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:28,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 01:16:28,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:28,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942622311] [2024-11-23 01:16:28,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942622311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:28,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:16:28,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 01:16:28,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878343377] [2024-11-23 01:16:28,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:28,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:16:28,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:28,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:16:28,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:28,906 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 01:16:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:28,935 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2024-11-23 01:16:28,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:16:28,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-23 01:16:28,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:28,936 INFO L225 Difference]: With dead ends: 118 [2024-11-23 01:16:28,937 INFO L226 Difference]: Without dead ends: 117 [2024-11-23 01:16:28,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:28,938 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:28,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:28,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-23 01:16:28,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2024-11-23 01:16:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 90 states have (on average 1.5777777777777777) internal successors, (142), 111 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 146 transitions. [2024-11-23 01:16:28,958 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 146 transitions. Word has length 8 [2024-11-23 01:16:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:28,959 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 146 transitions. [2024-11-23 01:16:28,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 01:16:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2024-11-23 01:16:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-23 01:16:28,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:28,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:28,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 01:16:28,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:28,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash -757917108, now seen corresponding path program 1 times [2024-11-23 01:16:28,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171930339] [2024-11-23 01:16:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:16:29,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:29,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171930339] [2024-11-23 01:16:29,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171930339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:29,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958951831] [2024-11-23 01:16:29,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:29,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:29,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:29,189 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:29,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 01:16:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:29,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 01:16:29,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-23 01:16:29,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:16:29,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958951831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:29,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 01:16:29,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-23 01:16:29,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426188176] [2024-11-23 01:16:29,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:29,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:16:29,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:29,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:16:29,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:16:29,503 INFO L87 Difference]: Start difference. First operand 115 states and 146 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:29,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:29,543 INFO L93 Difference]: Finished difference Result 115 states and 146 transitions. [2024-11-23 01:16:29,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:16:29,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-23 01:16:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:29,545 INFO L225 Difference]: With dead ends: 115 [2024-11-23 01:16:29,548 INFO L226 Difference]: Without dead ends: 113 [2024-11-23 01:16:29,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:16:29,550 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 127 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:29,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 143 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-23 01:16:29,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-23 01:16:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 109 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 144 transitions. [2024-11-23 01:16:29,566 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 144 transitions. Word has length 13 [2024-11-23 01:16:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:29,567 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 144 transitions. [2024-11-23 01:16:29,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2024-11-23 01:16:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-23 01:16:29,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:29,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:29,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 01:16:29,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-23 01:16:29,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:29,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:29,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2020593806, now seen corresponding path program 1 times [2024-11-23 01:16:29,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:29,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950614221] [2024-11-23 01:16:29,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:29,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:29,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:16:29,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:29,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950614221] [2024-11-23 01:16:29,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950614221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:29,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925304426] [2024-11-23 01:16:29,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:29,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:29,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:29,932 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:29,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 01:16:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:30,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 01:16:30,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:16:30,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:16:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:16:30,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925304426] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:16:30,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 01:16:30,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-23 01:16:30,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313950980] [2024-11-23 01:16:30,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 01:16:30,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 01:16:30,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:30,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 01:16:30,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:16:30,265 INFO L87 Difference]: Start difference. First operand 113 states and 144 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 01:16:30,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:30,288 INFO L93 Difference]: Finished difference Result 229 states and 293 transitions. [2024-11-23 01:16:30,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 01:16:30,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-11-23 01:16:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:30,289 INFO L225 Difference]: With dead ends: 229 [2024-11-23 01:16:30,289 INFO L226 Difference]: Without dead ends: 122 [2024-11-23 01:16:30,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:16:30,291 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:30,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 277 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:30,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-23 01:16:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-23 01:16:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.505050505050505) internal successors, (149), 118 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2024-11-23 01:16:30,320 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 14 [2024-11-23 01:16:30,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:30,320 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2024-11-23 01:16:30,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 01:16:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2024-11-23 01:16:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-23 01:16:30,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:30,321 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:30,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-23 01:16:30,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:30,522 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:30,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1267261696, now seen corresponding path program 2 times [2024-11-23 01:16:30,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:30,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233039594] [2024-11-23 01:16:30,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 01:16:30,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:30,574 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 01:16:30,575 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 01:16:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-23 01:16:30,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:30,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233039594] [2024-11-23 01:16:30,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233039594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:30,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:16:30,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 01:16:30,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252211265] [2024-11-23 01:16:30,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:30,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 01:16:30,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:30,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 01:16:30,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:16:30,777 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:30,834 INFO L93 Difference]: Finished difference Result 122 states and 153 transitions. [2024-11-23 01:16:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 01:16:30,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-23 01:16:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:30,836 INFO L225 Difference]: With dead ends: 122 [2024-11-23 01:16:30,837 INFO L226 Difference]: Without dead ends: 120 [2024-11-23 01:16:30,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:16:30,838 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 126 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:30,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 392 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-23 01:16:30,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-23 01:16:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.4848484848484849) internal successors, (147), 116 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2024-11-23 01:16:30,853 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 23 [2024-11-23 01:16:30,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:30,853 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2024-11-23 01:16:30,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2024-11-23 01:16:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-23 01:16:30,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:30,854 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:30,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 01:16:30,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:30,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:30,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1741242827, now seen corresponding path program 1 times [2024-11-23 01:16:30,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:30,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694910882] [2024-11-23 01:16:30,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:30,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:31,082 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-23 01:16:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:31,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694910882] [2024-11-23 01:16:31,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694910882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:31,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:16:31,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 01:16:31,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271004952] [2024-11-23 01:16:31,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:31,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:16:31,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:31,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:16:31,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:31,087 INFO L87 Difference]: Start difference. First operand 120 states and 151 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:31,113 INFO L93 Difference]: Finished difference Result 222 states and 285 transitions. [2024-11-23 01:16:31,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:16:31,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-23 01:16:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:31,115 INFO L225 Difference]: With dead ends: 222 [2024-11-23 01:16:31,115 INFO L226 Difference]: Without dead ends: 123 [2024-11-23 01:16:31,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:31,116 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:31,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 270 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-23 01:16:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-23 01:16:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 119 states have internal predecessors, (150), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2024-11-23 01:16:31,133 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 154 transitions. Word has length 28 [2024-11-23 01:16:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:31,134 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 154 transitions. [2024-11-23 01:16:31,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 154 transitions. [2024-11-23 01:16:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-23 01:16:31,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:31,135 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:31,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 01:16:31,135 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:31,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1249855697, now seen corresponding path program 1 times [2024-11-23 01:16:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:31,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724321473] [2024-11-23 01:16:31,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:31,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-23 01:16:31,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:31,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724321473] [2024-11-23 01:16:31,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724321473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:31,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211885066] [2024-11-23 01:16:31,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:31,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:31,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:31,366 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:31,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 01:16:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:31,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 01:16:31,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-23 01:16:31,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:16:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-23 01:16:31,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211885066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:16:31,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 01:16:31,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2024-11-23 01:16:31,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742737623] [2024-11-23 01:16:31,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 01:16:31,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-23 01:16:31,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:31,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-23 01:16:31,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-23 01:16:31,891 INFO L87 Difference]: Start difference. First operand 123 states and 154 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-23 01:16:31,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:31,993 INFO L93 Difference]: Finished difference Result 248 states and 316 transitions. [2024-11-23 01:16:31,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 01:16:31,994 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-23 01:16:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:31,994 INFO L225 Difference]: With dead ends: 248 [2024-11-23 01:16:31,994 INFO L226 Difference]: Without dead ends: 140 [2024-11-23 01:16:31,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-23 01:16:31,998 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 5 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:31,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 648 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:16:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-23 01:16:32,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-23 01:16:32,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 136 states have internal predecessors, (167), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 171 transitions. [2024-11-23 01:16:32,011 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 171 transitions. Word has length 31 [2024-11-23 01:16:32,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:32,011 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 171 transitions. [2024-11-23 01:16:32,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-23 01:16:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 171 transitions. [2024-11-23 01:16:32,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-23 01:16:32,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:32,013 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:32,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-23 01:16:32,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:32,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:32,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2012171647, now seen corresponding path program 1 times [2024-11-23 01:16:32,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:32,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907261481] [2024-11-23 01:16:32,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:32,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:16:32,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:32,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907261481] [2024-11-23 01:16:32,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907261481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:32,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:16:32,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 01:16:32,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101441364] [2024-11-23 01:16:32,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:32,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:16:32,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:32,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:16:32,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:32,416 INFO L87 Difference]: Start difference. First operand 140 states and 171 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:32,436 INFO L93 Difference]: Finished difference Result 145 states and 176 transitions. [2024-11-23 01:16:32,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:16:32,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2024-11-23 01:16:32,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:32,439 INFO L225 Difference]: With dead ends: 145 [2024-11-23 01:16:32,440 INFO L226 Difference]: Without dead ends: 143 [2024-11-23 01:16:32,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:32,441 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:32,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 270 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:32,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-23 01:16:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-23 01:16:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 139 states have internal predecessors, (170), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2024-11-23 01:16:32,451 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 50 [2024-11-23 01:16:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:32,452 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2024-11-23 01:16:32,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:32,452 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2024-11-23 01:16:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-23 01:16:32,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:32,453 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:32,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 01:16:32,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:32,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:32,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2099130704, now seen corresponding path program 1 times [2024-11-23 01:16:32,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:32,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798901532] [2024-11-23 01:16:32,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:32,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:16:32,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:32,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798901532] [2024-11-23 01:16:32,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798901532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:32,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:16:32,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 01:16:32,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862363964] [2024-11-23 01:16:32,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:32,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:16:32,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:32,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:16:32,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:32,719 INFO L87 Difference]: Start difference. First operand 143 states and 174 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:32,728 INFO L93 Difference]: Finished difference Result 206 states and 257 transitions. [2024-11-23 01:16:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:16:32,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2024-11-23 01:16:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:32,730 INFO L225 Difference]: With dead ends: 206 [2024-11-23 01:16:32,730 INFO L226 Difference]: Without dead ends: 120 [2024-11-23 01:16:32,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:32,731 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:32,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-23 01:16:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-23 01:16:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 116 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2024-11-23 01:16:32,738 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 50 [2024-11-23 01:16:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:32,739 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 145 transitions. [2024-11-23 01:16:32,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 145 transitions. [2024-11-23 01:16:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-23 01:16:32,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:32,741 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:32,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-23 01:16:32,741 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:32,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:32,743 INFO L85 PathProgramCache]: Analyzing trace with hash -856729593, now seen corresponding path program 1 times [2024-11-23 01:16:32,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:32,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688030611] [2024-11-23 01:16:32,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:32,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-23 01:16:32,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:32,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688030611] [2024-11-23 01:16:32,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688030611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:32,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:16:32,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 01:16:32,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448898589] [2024-11-23 01:16:32,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:32,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:16:32,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:32,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:16:32,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:32,970 INFO L87 Difference]: Start difference. First operand 120 states and 145 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:32,998 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2024-11-23 01:16:32,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:16:32,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2024-11-23 01:16:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:32,999 INFO L225 Difference]: With dead ends: 133 [2024-11-23 01:16:32,999 INFO L226 Difference]: Without dead ends: 131 [2024-11-23 01:16:32,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:33,000 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:33,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 207 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-23 01:16:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-23 01:16:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.305084745762712) internal successors, (154), 126 states have internal predecessors, (154), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2024-11-23 01:16:33,005 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 50 [2024-11-23 01:16:33,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:33,005 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2024-11-23 01:16:33,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2024-11-23 01:16:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-23 01:16:33,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:33,006 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:33,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 01:16:33,006 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:33,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:33,007 INFO L85 PathProgramCache]: Analyzing trace with hash -856727864, now seen corresponding path program 1 times [2024-11-23 01:16:33,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:33,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237943537] [2024-11-23 01:16:33,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:33,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-23 01:16:33,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:33,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237943537] [2024-11-23 01:16:33,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237943537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:33,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:16:33,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 01:16:33,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629717932] [2024-11-23 01:16:33,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:33,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:16:33,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:33,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:16:33,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:33,182 INFO L87 Difference]: Start difference. First operand 130 states and 158 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:33,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:33,200 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2024-11-23 01:16:33,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:16:33,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2024-11-23 01:16:33,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:33,201 INFO L225 Difference]: With dead ends: 130 [2024-11-23 01:16:33,201 INFO L226 Difference]: Without dead ends: 129 [2024-11-23 01:16:33,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:33,203 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:33,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-23 01:16:33,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2024-11-23 01:16:33,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 121 states have internal predecessors, (148), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2024-11-23 01:16:33,209 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 50 [2024-11-23 01:16:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:33,210 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2024-11-23 01:16:33,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2024-11-23 01:16:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-23 01:16:33,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:33,211 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:33,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-23 01:16:33,211 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:33,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:33,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1371935090, now seen corresponding path program 1 times [2024-11-23 01:16:33,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:33,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906279891] [2024-11-23 01:16:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:33,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:16:33,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:33,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906279891] [2024-11-23 01:16:33,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906279891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:33,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:16:33,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 01:16:33,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458401986] [2024-11-23 01:16:33,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:33,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 01:16:33,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:33,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 01:16:33,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 01:16:33,603 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:33,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:33,674 INFO L93 Difference]: Finished difference Result 193 states and 241 transitions. [2024-11-23 01:16:33,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 01:16:33,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2024-11-23 01:16:33,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:33,675 INFO L225 Difference]: With dead ends: 193 [2024-11-23 01:16:33,675 INFO L226 Difference]: Without dead ends: 125 [2024-11-23 01:16:33,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 01:16:33,676 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 107 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:33,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 373 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:16:33,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-23 01:16:33,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-23 01:16:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 121 states have internal predecessors, (147), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2024-11-23 01:16:33,681 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 52 [2024-11-23 01:16:33,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:33,682 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2024-11-23 01:16:33,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:33,682 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2024-11-23 01:16:33,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-23 01:16:33,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:33,682 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:33,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-23 01:16:33,683 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:33,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:33,683 INFO L85 PathProgramCache]: Analyzing trace with hash -776451536, now seen corresponding path program 1 times [2024-11-23 01:16:33,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:33,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215702083] [2024-11-23 01:16:33,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:33,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-23 01:16:33,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:33,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215702083] [2024-11-23 01:16:33,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215702083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:33,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563261945] [2024-11-23 01:16:33,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:33,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:33,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:33,880 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:33,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 01:16:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:34,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 01:16:34,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-23 01:16:34,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:16:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-23 01:16:34,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563261945] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:16:34,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 01:16:34,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-23 01:16:34,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654338796] [2024-11-23 01:16:34,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 01:16:34,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 01:16:34,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:34,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 01:16:34,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:16:34,326 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:34,367 INFO L93 Difference]: Finished difference Result 224 states and 279 transitions. [2024-11-23 01:16:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 01:16:34,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2024-11-23 01:16:34,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:34,368 INFO L225 Difference]: With dead ends: 224 [2024-11-23 01:16:34,368 INFO L226 Difference]: Without dead ends: 143 [2024-11-23 01:16:34,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:16:34,369 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:34,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 313 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-23 01:16:34,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-23 01:16:34,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 132 states have (on average 1.25) internal successors, (165), 139 states have internal predecessors, (165), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 169 transitions. [2024-11-23 01:16:34,377 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 169 transitions. Word has length 58 [2024-11-23 01:16:34,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:34,378 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 169 transitions. [2024-11-23 01:16:34,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 169 transitions. [2024-11-23 01:16:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-23 01:16:34,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:34,379 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:34,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-23 01:16:34,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-23 01:16:34,581 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:34,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:34,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2094163647, now seen corresponding path program 1 times [2024-11-23 01:16:34,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:34,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998612827] [2024-11-23 01:16:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:34,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:16:34,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:34,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998612827] [2024-11-23 01:16:34,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998612827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:34,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878581540] [2024-11-23 01:16:34,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:34,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:34,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:34,888 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:34,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 01:16:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:35,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 1296 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 01:16:35,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:16:35,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:16:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:16:35,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878581540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:16:35,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 01:16:35,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-23 01:16:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855265790] [2024-11-23 01:16:35,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 01:16:35,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-23 01:16:35,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:35,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 01:16:35,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-23 01:16:35,457 INFO L87 Difference]: Start difference. First operand 143 states and 169 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:35,529 INFO L93 Difference]: Finished difference Result 269 states and 330 transitions. [2024-11-23 01:16:35,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 01:16:35,529 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2024-11-23 01:16:35,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:35,530 INFO L225 Difference]: With dead ends: 269 [2024-11-23 01:16:35,531 INFO L226 Difference]: Without dead ends: 179 [2024-11-23 01:16:35,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-23 01:16:35,531 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:35,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 622 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:16:35,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-23 01:16:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-23 01:16:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 168 states have (on average 1.1964285714285714) internal successors, (201), 175 states have internal predecessors, (201), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 205 transitions. [2024-11-23 01:16:35,539 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 205 transitions. Word has length 69 [2024-11-23 01:16:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:35,540 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 205 transitions. [2024-11-23 01:16:35,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 205 transitions. [2024-11-23 01:16:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-23 01:16:35,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:35,541 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:35,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-23 01:16:35,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-23 01:16:35,743 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:35,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash 89302591, now seen corresponding path program 2 times [2024-11-23 01:16:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:35,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493061491] [2024-11-23 01:16:35,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 01:16:35,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:35,827 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 01:16:35,827 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 01:16:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-23 01:16:36,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:36,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493061491] [2024-11-23 01:16:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493061491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:36,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:16:36,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 01:16:36,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234320410] [2024-11-23 01:16:36,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:36,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 01:16:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 01:16:36,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 01:16:36,030 INFO L87 Difference]: Start difference. First operand 179 states and 205 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:36,110 INFO L93 Difference]: Finished difference Result 181 states and 208 transitions. [2024-11-23 01:16:36,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 01:16:36,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2024-11-23 01:16:36,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:36,112 INFO L225 Difference]: With dead ends: 181 [2024-11-23 01:16:36,112 INFO L226 Difference]: Without dead ends: 180 [2024-11-23 01:16:36,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:16:36,113 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 89 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:36,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 365 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:16:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-23 01:16:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2024-11-23 01:16:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 174 states have internal predecessors, (200), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 204 transitions. [2024-11-23 01:16:36,121 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 204 transitions. Word has length 87 [2024-11-23 01:16:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:36,122 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 204 transitions. [2024-11-23 01:16:36,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 204 transitions. [2024-11-23 01:16:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-23 01:16:36,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:36,123 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:36,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-23 01:16:36,124 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:36,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:36,124 INFO L85 PathProgramCache]: Analyzing trace with hash -853525022, now seen corresponding path program 1 times [2024-11-23 01:16:36,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:36,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496364027] [2024-11-23 01:16:36,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:36,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-23 01:16:36,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:36,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496364027] [2024-11-23 01:16:36,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496364027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:36,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565727190] [2024-11-23 01:16:36,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:36,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:36,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:36,398 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:36,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 01:16:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:36,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 01:16:36,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-23 01:16:36,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:16:36,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565727190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:36,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 01:16:36,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-23 01:16:36,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793358278] [2024-11-23 01:16:36,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:36,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 01:16:36,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:36,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 01:16:36,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:16:36,890 INFO L87 Difference]: Start difference. First operand 178 states and 204 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:36,914 INFO L93 Difference]: Finished difference Result 178 states and 204 transitions. [2024-11-23 01:16:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 01:16:36,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-23 01:16:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:36,918 INFO L225 Difference]: With dead ends: 178 [2024-11-23 01:16:36,919 INFO L226 Difference]: Without dead ends: 177 [2024-11-23 01:16:36,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:16:36,920 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:36,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 308 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-23 01:16:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-23 01:16:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 168 states have (on average 1.1845238095238095) internal successors, (199), 173 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2024-11-23 01:16:36,929 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 88 [2024-11-23 01:16:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:36,929 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2024-11-23 01:16:36,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2024-11-23 01:16:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-23 01:16:36,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:36,930 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:36,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-23 01:16:37,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:37,131 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:37,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1526586787, now seen corresponding path program 1 times [2024-11-23 01:16:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:37,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221792359] [2024-11-23 01:16:37,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-23 01:16:37,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221792359] [2024-11-23 01:16:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221792359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039868291] [2024-11-23 01:16:37,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:37,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:37,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:37,507 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:37,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 01:16:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:37,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 01:16:37,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-23 01:16:38,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:16:38,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039868291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:38,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 01:16:38,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-23 01:16:38,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145238277] [2024-11-23 01:16:38,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:38,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 01:16:38,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:38,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 01:16:38,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-23 01:16:38,039 INFO L87 Difference]: Start difference. First operand 177 states and 203 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:38,080 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2024-11-23 01:16:38,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 01:16:38,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-23 01:16:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:38,082 INFO L225 Difference]: With dead ends: 177 [2024-11-23 01:16:38,082 INFO L226 Difference]: Without dead ends: 176 [2024-11-23 01:16:38,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-23 01:16:38,083 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 83 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:38,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 195 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:38,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-23 01:16:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-23 01:16:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 168 states have (on average 1.1785714285714286) internal successors, (198), 172 states have internal predecessors, (198), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 202 transitions. [2024-11-23 01:16:38,090 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 202 transitions. Word has length 88 [2024-11-23 01:16:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:38,091 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 202 transitions. [2024-11-23 01:16:38,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 202 transitions. [2024-11-23 01:16:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-23 01:16:38,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:38,092 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:38,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-23 01:16:38,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-23 01:16:38,292 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:38,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:38,293 INFO L85 PathProgramCache]: Analyzing trace with hash -689471541, now seen corresponding path program 1 times [2024-11-23 01:16:38,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:38,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501627792] [2024-11-23 01:16:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:38,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-23 01:16:38,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:38,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501627792] [2024-11-23 01:16:38,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501627792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:38,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634680104] [2024-11-23 01:16:38,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:38,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:38,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:38,555 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:38,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-23 01:16:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:39,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 01:16:39,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-23 01:16:39,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:16:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-23 01:16:39,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634680104] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:16:39,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 01:16:39,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-23 01:16:39,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318438606] [2024-11-23 01:16:39,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 01:16:39,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 01:16:39,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:39,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 01:16:39,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:16:39,149 INFO L87 Difference]: Start difference. First operand 176 states and 202 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:39,182 INFO L93 Difference]: Finished difference Result 186 states and 214 transitions. [2024-11-23 01:16:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 01:16:39,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-23 01:16:39,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:39,184 INFO L225 Difference]: With dead ends: 186 [2024-11-23 01:16:39,185 INFO L226 Difference]: Without dead ends: 185 [2024-11-23 01:16:39,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:16:39,185 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:39,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-23 01:16:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-23 01:16:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 177 states have (on average 1.1694915254237288) internal successors, (207), 181 states have internal predecessors, (207), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 211 transitions. [2024-11-23 01:16:39,196 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 211 transitions. Word has length 89 [2024-11-23 01:16:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:39,196 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 211 transitions. [2024-11-23 01:16:39,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 211 transitions. [2024-11-23 01:16:39,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-23 01:16:39,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:39,198 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:39,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-23 01:16:39,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:39,402 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:39,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:39,402 INFO L85 PathProgramCache]: Analyzing trace with hash -703292001, now seen corresponding path program 2 times [2024-11-23 01:16:39,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:39,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375096334] [2024-11-23 01:16:39,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 01:16:39,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:39,464 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 01:16:39,464 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 01:16:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-11-23 01:16:39,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:39,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375096334] [2024-11-23 01:16:39,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375096334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:39,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116158901] [2024-11-23 01:16:39,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 01:16:39,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:39,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:39,564 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:39,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-23 01:16:39,958 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 01:16:39,959 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 01:16:39,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 01:16:39,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-11-23 01:16:40,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:16:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-11-23 01:16:40,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116158901] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:16:40,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 01:16:40,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-23 01:16:40,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638575246] [2024-11-23 01:16:40,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 01:16:40,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 01:16:40,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:40,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 01:16:40,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-23 01:16:40,125 INFO L87 Difference]: Start difference. First operand 185 states and 211 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:40,175 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2024-11-23 01:16:40,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 01:16:40,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2024-11-23 01:16:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:40,178 INFO L225 Difference]: With dead ends: 185 [2024-11-23 01:16:40,178 INFO L226 Difference]: Without dead ends: 165 [2024-11-23 01:16:40,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-23 01:16:40,179 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 144 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:40,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 294 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-23 01:16:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-23 01:16:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 158 states have (on average 1.1582278481012658) internal successors, (183), 161 states have internal predecessors, (183), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2024-11-23 01:16:40,185 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 98 [2024-11-23 01:16:40,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:40,186 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2024-11-23 01:16:40,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2024-11-23 01:16:40,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-23 01:16:40,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:40,187 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:40,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-23 01:16:40,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:40,387 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:40,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:40,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1799807557, now seen corresponding path program 1 times [2024-11-23 01:16:40,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:40,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995864924] [2024-11-23 01:16:40,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:40,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-11-23 01:16:40,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:40,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995864924] [2024-11-23 01:16:40,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995864924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:40,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:16:40,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 01:16:40,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307092165] [2024-11-23 01:16:40,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:40,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 01:16:40,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:40,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 01:16:40,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-23 01:16:40,677 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:40,695 INFO L93 Difference]: Finished difference Result 178 states and 204 transitions. [2024-11-23 01:16:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 01:16:40,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2024-11-23 01:16:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:40,697 INFO L225 Difference]: With dead ends: 178 [2024-11-23 01:16:40,697 INFO L226 Difference]: Without dead ends: 177 [2024-11-23 01:16:40,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-23 01:16:40,698 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 4 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:40,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 191 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-23 01:16:40,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2024-11-23 01:16:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 168 states have (on average 1.1607142857142858) internal successors, (195), 171 states have internal predecessors, (195), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:16:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2024-11-23 01:16:40,705 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 201 transitions. Word has length 110 [2024-11-23 01:16:40,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:40,705 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 201 transitions. [2024-11-23 01:16:40,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 201 transitions. [2024-11-23 01:16:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-23 01:16:40,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:40,707 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:40,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-23 01:16:40,707 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:40,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:40,708 INFO L85 PathProgramCache]: Analyzing trace with hash 40540923, now seen corresponding path program 1 times [2024-11-23 01:16:40,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:40,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987923316] [2024-11-23 01:16:40,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:40,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-11-23 01:16:41,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:41,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987923316] [2024-11-23 01:16:41,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987923316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:41,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:16:41,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 01:16:41,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826727117] [2024-11-23 01:16:41,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:41,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 01:16:41,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:41,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 01:16:41,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:16:41,030 INFO L87 Difference]: Start difference. First operand 176 states and 201 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 01:16:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:41,059 INFO L93 Difference]: Finished difference Result 212 states and 243 transitions. [2024-11-23 01:16:41,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 01:16:41,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2024-11-23 01:16:41,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:41,061 INFO L225 Difference]: With dead ends: 212 [2024-11-23 01:16:41,061 INFO L226 Difference]: Without dead ends: 186 [2024-11-23 01:16:41,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:16:41,063 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:41,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 376 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-23 01:16:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2024-11-23 01:16:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 170 states have (on average 1.1588235294117648) internal successors, (197), 173 states have internal predecessors, (197), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:16:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2024-11-23 01:16:41,071 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 111 [2024-11-23 01:16:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:41,071 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2024-11-23 01:16:41,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 01:16:41,072 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2024-11-23 01:16:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-23 01:16:41,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:41,073 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:41,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-23 01:16:41,073 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:41,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:41,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1815548285, now seen corresponding path program 1 times [2024-11-23 01:16:41,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:41,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178631470] [2024-11-23 01:16:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-11-23 01:16:41,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:41,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178631470] [2024-11-23 01:16:41,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178631470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:41,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:16:41,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 01:16:41,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974854376] [2024-11-23 01:16:41,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:41,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 01:16:41,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:41,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 01:16:41,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-23 01:16:41,519 INFO L87 Difference]: Start difference. First operand 178 states and 203 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:41,604 INFO L93 Difference]: Finished difference Result 184 states and 210 transitions. [2024-11-23 01:16:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 01:16:41,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 111 [2024-11-23 01:16:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:41,606 INFO L225 Difference]: With dead ends: 184 [2024-11-23 01:16:41,606 INFO L226 Difference]: Without dead ends: 183 [2024-11-23 01:16:41,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-23 01:16:41,607 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 6 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:41,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 433 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:16:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-23 01:16:41,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2024-11-23 01:16:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 174 states have internal predecessors, (198), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:16:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2024-11-23 01:16:41,614 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 111 [2024-11-23 01:16:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:41,614 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2024-11-23 01:16:41,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2024-11-23 01:16:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-23 01:16:41,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:41,615 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:41,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-23 01:16:41,616 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:41,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:41,616 INFO L85 PathProgramCache]: Analyzing trace with hash 955738558, now seen corresponding path program 2 times [2024-11-23 01:16:41,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:41,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758465186] [2024-11-23 01:16:41,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 01:16:41,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:41,739 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 01:16:41,739 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 01:16:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-23 01:16:42,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:42,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758465186] [2024-11-23 01:16:42,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758465186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:42,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700079493] [2024-11-23 01:16:42,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 01:16:42,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:42,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:42,097 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:42,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-23 01:16:42,749 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 01:16:42,749 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 01:16:42,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 1680 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 01:16:42,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-23 01:16:42,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:16:42,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700079493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:42,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 01:16:42,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-23 01:16:42,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861422167] [2024-11-23 01:16:42,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:42,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 01:16:42,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:42,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 01:16:42,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:16:42,853 INFO L87 Difference]: Start difference. First operand 179 states and 204 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:42,889 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2024-11-23 01:16:42,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 01:16:42,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2024-11-23 01:16:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:42,891 INFO L225 Difference]: With dead ends: 179 [2024-11-23 01:16:42,892 INFO L226 Difference]: Without dead ends: 178 [2024-11-23 01:16:42,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:16:42,892 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:42,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 258 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-23 01:16:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-23 01:16:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 171 states have (on average 1.152046783625731) internal successors, (197), 173 states have internal predecessors, (197), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:16:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2024-11-23 01:16:42,901 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 112 [2024-11-23 01:16:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:42,902 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2024-11-23 01:16:42,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2024-11-23 01:16:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-23 01:16:42,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:42,903 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:42,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-23 01:16:43,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-23 01:16:43,104 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:43,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash -436875678, now seen corresponding path program 1 times [2024-11-23 01:16:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:43,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829822442] [2024-11-23 01:16:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:43,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-23 01:16:43,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:43,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829822442] [2024-11-23 01:16:43,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829822442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:43,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686140779] [2024-11-23 01:16:43,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:43,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:43,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:43,487 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:43,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-23 01:16:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:44,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 01:16:44,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:44,299 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-23 01:16:44,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:16:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-23 01:16:44,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686140779] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:16:44,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 01:16:44,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-23 01:16:44,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336346184] [2024-11-23 01:16:44,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 01:16:44,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 01:16:44,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:44,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 01:16:44,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:16:44,408 INFO L87 Difference]: Start difference. First operand 178 states and 203 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:44,466 INFO L93 Difference]: Finished difference Result 284 states and 317 transitions. [2024-11-23 01:16:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 01:16:44,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2024-11-23 01:16:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:44,468 INFO L225 Difference]: With dead ends: 284 [2024-11-23 01:16:44,468 INFO L226 Difference]: Without dead ends: 283 [2024-11-23 01:16:44,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:16:44,472 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:44,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-23 01:16:44,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-23 01:16:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 276 states have (on average 1.1159420289855073) internal successors, (308), 278 states have internal predecessors, (308), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:16:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 314 transitions. [2024-11-23 01:16:44,488 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 314 transitions. Word has length 113 [2024-11-23 01:16:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:44,489 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 314 transitions. [2024-11-23 01:16:44,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:16:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 314 transitions. [2024-11-23 01:16:44,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-23 01:16:44,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:44,491 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:44,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-23 01:16:44,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-23 01:16:44,692 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:44,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:44,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1482164134, now seen corresponding path program 1 times [2024-11-23 01:16:44,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:44,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787378162] [2024-11-23 01:16:44,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:44,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-11-23 01:16:45,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:45,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787378162] [2024-11-23 01:16:45,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787378162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:45,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986596864] [2024-11-23 01:16:45,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:45,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:45,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:45,012 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:45,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-23 01:16:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:45,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 1687 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 01:16:45,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-23 01:16:45,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:16:45,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986596864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:45,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 01:16:45,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-23 01:16:45,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132316085] [2024-11-23 01:16:45,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:45,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 01:16:45,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:45,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 01:16:45,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:16:45,797 INFO L87 Difference]: Start difference. First operand 283 states and 314 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:45,821 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2024-11-23 01:16:45,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 01:16:45,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 127 [2024-11-23 01:16:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:45,824 INFO L225 Difference]: With dead ends: 283 [2024-11-23 01:16:45,824 INFO L226 Difference]: Without dead ends: 282 [2024-11-23 01:16:45,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:16:45,825 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 2 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:45,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 250 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-23 01:16:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-23 01:16:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 276 states have (on average 1.1123188405797102) internal successors, (307), 277 states have internal predecessors, (307), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:16:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 313 transitions. [2024-11-23 01:16:45,840 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 313 transitions. Word has length 127 [2024-11-23 01:16:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:45,841 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 313 transitions. [2024-11-23 01:16:45,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 313 transitions. [2024-11-23 01:16:45,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-23 01:16:45,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:45,842 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:45,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-23 01:16:46,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-23 01:16:46,043 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:46,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:46,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1297552444, now seen corresponding path program 1 times [2024-11-23 01:16:46,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:46,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191452936] [2024-11-23 01:16:46,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:46,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-11-23 01:16:46,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:46,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191452936] [2024-11-23 01:16:46,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191452936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:16:46,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:16:46,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 01:16:46,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538235516] [2024-11-23 01:16:46,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:16:46,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:16:46,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:46,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:16:46,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:46,308 INFO L87 Difference]: Start difference. First operand 282 states and 313 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:46,324 INFO L93 Difference]: Finished difference Result 322 states and 362 transitions. [2024-11-23 01:16:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:16:46,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 128 [2024-11-23 01:16:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:46,326 INFO L225 Difference]: With dead ends: 322 [2024-11-23 01:16:46,327 INFO L226 Difference]: Without dead ends: 283 [2024-11-23 01:16:46,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:16:46,327 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:46,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:16:46,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-23 01:16:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-23 01:16:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 277 states have (on average 1.111913357400722) internal successors, (308), 278 states have internal predecessors, (308), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:16:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 314 transitions. [2024-11-23 01:16:46,339 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 314 transitions. Word has length 128 [2024-11-23 01:16:46,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:46,339 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 314 transitions. [2024-11-23 01:16:46,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:16:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 314 transitions. [2024-11-23 01:16:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-23 01:16:46,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:46,341 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:46,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-23 01:16:46,341 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:46,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:46,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1968055554, now seen corresponding path program 1 times [2024-11-23 01:16:46,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:46,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548859446] [2024-11-23 01:16:46,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:46,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-23 01:16:46,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:46,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548859446] [2024-11-23 01:16:46,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548859446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:46,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991775435] [2024-11-23 01:16:46,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:46,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:46,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:46,874 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:46,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-23 01:16:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:47,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 1687 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-23 01:16:47,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-11-23 01:16:47,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:16:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-23 01:16:47,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991775435] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:16:47,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 01:16:47,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-23 01:16:47,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156377101] [2024-11-23 01:16:47,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 01:16:47,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-23 01:16:47,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:47,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-23 01:16:47,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-23 01:16:47,940 INFO L87 Difference]: Start difference. First operand 283 states and 314 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-23 01:16:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:48,083 INFO L93 Difference]: Finished difference Result 353 states and 404 transitions. [2024-11-23 01:16:48,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 01:16:48,084 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 128 [2024-11-23 01:16:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:48,086 INFO L225 Difference]: With dead ends: 353 [2024-11-23 01:16:48,086 INFO L226 Difference]: Without dead ends: 283 [2024-11-23 01:16:48,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-23 01:16:48,087 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 36 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:48,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 732 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:16:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-23 01:16:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-23 01:16:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 277 states have (on average 1.108303249097473) internal successors, (307), 278 states have internal predecessors, (307), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:16:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 313 transitions. [2024-11-23 01:16:48,102 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 313 transitions. Word has length 128 [2024-11-23 01:16:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:48,102 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 313 transitions. [2024-11-23 01:16:48,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-23 01:16:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 313 transitions. [2024-11-23 01:16:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-23 01:16:48,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:48,104 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:48,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-23 01:16:48,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:48,305 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:48,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:48,305 INFO L85 PathProgramCache]: Analyzing trace with hash -222577589, now seen corresponding path program 2 times [2024-11-23 01:16:48,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:48,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901731913] [2024-11-23 01:16:48,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 01:16:48,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:48,837 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 01:16:48,838 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 01:16:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-23 01:16:50,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:50,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901731913] [2024-11-23 01:16:50,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901731913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:50,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656639547] [2024-11-23 01:16:50,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 01:16:50,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:50,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:50,498 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:50,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-23 01:16:51,244 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 01:16:51,244 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 01:16:51,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-23 01:16:51,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:51,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-23 01:16:51,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-23 01:16:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 8 proven. 327 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-23 01:16:51,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:16:51,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-23 01:16:51,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-23 01:16:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-23 01:16:51,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656639547] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:16:51,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 01:16:51,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2024-11-23 01:16:51,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493180107] [2024-11-23 01:16:51,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 01:16:51,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-23 01:16:51,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:51,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 01:16:51,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-23 01:16:51,572 INFO L87 Difference]: Start difference. First operand 283 states and 313 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-23 01:16:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:51,733 INFO L93 Difference]: Finished difference Result 348 states and 399 transitions. [2024-11-23 01:16:51,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 01:16:51,734 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 163 [2024-11-23 01:16:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:51,735 INFO L225 Difference]: With dead ends: 348 [2024-11-23 01:16:51,735 INFO L226 Difference]: Without dead ends: 290 [2024-11-23 01:16:51,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-23 01:16:51,736 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 29 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:51,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 639 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:16:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-23 01:16:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 286. [2024-11-23 01:16:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 280 states have (on average 1.1035714285714286) internal successors, (309), 281 states have internal predecessors, (309), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:16:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2024-11-23 01:16:51,758 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 163 [2024-11-23 01:16:51,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:51,758 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2024-11-23 01:16:51,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-23 01:16:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2024-11-23 01:16:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-23 01:16:51,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:51,760 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:51,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-23 01:16:51,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-23 01:16:51,961 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:51,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:51,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1166437475, now seen corresponding path program 1 times [2024-11-23 01:16:51,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:51,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39934181] [2024-11-23 01:16:51,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:51,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-23 01:16:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 01:16:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39934181] [2024-11-23 01:16:53,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39934181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 01:16:53,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563773837] [2024-11-23 01:16:53,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:53,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:53,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:16:53,917 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 01:16:53,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-23 01:16:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:16:54,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 1994 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-23 01:16:54,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:16:54,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-23 01:16:55,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-23 01:16:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 8 proven. 355 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2024-11-23 01:16:55,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:16:55,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-23 01:16:55,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-23 01:16:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-23 01:16:55,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563773837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:16:55,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 01:16:55,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 17 [2024-11-23 01:16:55,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75208443] [2024-11-23 01:16:55,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 01:16:55,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-23 01:16:55,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 01:16:55,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-23 01:16:55,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-23 01:16:55,250 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 17 states have internal predecessors, (105), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-23 01:16:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:16:55,551 INFO L93 Difference]: Finished difference Result 355 states and 405 transitions. [2024-11-23 01:16:55,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 01:16:55,553 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 17 states have internal predecessors, (105), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 170 [2024-11-23 01:16:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:16:55,555 INFO L225 Difference]: With dead ends: 355 [2024-11-23 01:16:55,555 INFO L226 Difference]: Without dead ends: 308 [2024-11-23 01:16:55,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-23 01:16:55,557 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 36 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 01:16:55,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1139 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 01:16:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-23 01:16:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 290. [2024-11-23 01:16:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 284 states have (on average 1.1091549295774648) internal successors, (315), 285 states have internal predecessors, (315), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:16:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 321 transitions. [2024-11-23 01:16:55,587 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 321 transitions. Word has length 170 [2024-11-23 01:16:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:16:55,588 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 321 transitions. [2024-11-23 01:16:55,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.176470588235294) internal successors, (105), 17 states have internal predecessors, (105), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-23 01:16:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 321 transitions. [2024-11-23 01:16:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-23 01:16:55,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:16:55,590 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:55,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-23 01:16:55,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 01:16:55,795 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:16:55,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:16:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1013270911, now seen corresponding path program 1 times [2024-11-23 01:16:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 01:16:55,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662289157] [2024-11-23 01:16:55,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:16:55,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 01:16:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 01:16:56,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 01:16:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 01:16:57,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 01:16:57,056 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-23 01:16:57,057 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2024-11-23 01:16:57,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2024-11-23 01:16:57,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2024-11-23 01:16:57,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2024-11-23 01:16:57,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2024-11-23 01:16:57,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2024-11-23 01:16:57,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2024-11-23 01:16:57,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2024-11-23 01:16:57,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2024-11-23 01:16:57,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2024-11-23 01:16:57,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2024-11-23 01:16:57,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2024-11-23 01:16:57,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2024-11-23 01:16:57,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2024-11-23 01:16:57,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2024-11-23 01:16:57,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2024-11-23 01:16:57,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2024-11-23 01:16:57,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2024-11-23 01:16:57,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2024-11-23 01:16:57,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2024-11-23 01:16:57,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2024-11-23 01:16:57,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2024-11-23 01:16:57,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2024-11-23 01:16:57,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2024-11-23 01:16:57,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-23 01:16:57,066 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:16:57,200 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 01:16:57,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:16:57 BoogieIcfgContainer [2024-11-23 01:16:57,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 01:16:57,204 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 01:16:57,204 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 01:16:57,204 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 01:16:57,205 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:26" (3/4) ... [2024-11-23 01:16:57,207 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-23 01:16:57,209 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 01:16:57,209 INFO L158 Benchmark]: Toolchain (without parser) took 32652.51ms. Allocated memory was 167.8MB in the beginning and 901.8MB in the end (delta: 734.0MB). Free memory was 108.0MB in the beginning and 336.5MB in the end (delta: -228.5MB). Peak memory consumption was 506.9MB. Max. memory is 16.1GB. [2024-11-23 01:16:57,209 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 167.8MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 01:16:57,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 916.85ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 56.9MB in the end (delta: 50.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-23 01:16:57,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.12ms. Allocated memory is still 167.8MB. Free memory was 56.5MB in the beginning and 49.7MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-23 01:16:57,210 INFO L158 Benchmark]: Boogie Preprocessor took 220.33ms. Allocated memory is still 167.8MB. Free memory was 49.7MB in the beginning and 127.3MB in the end (delta: -77.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-23 01:16:57,210 INFO L158 Benchmark]: RCFGBuilder took 1174.79ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 127.3MB in the beginning and 213.3MB in the end (delta: -86.0MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. [2024-11-23 01:16:57,210 INFO L158 Benchmark]: TraceAbstraction took 30232.62ms. Allocated memory was 253.8MB in the beginning and 901.8MB in the end (delta: 648.0MB). Free memory was 212.4MB in the beginning and 337.5MB in the end (delta: -125.1MB). Peak memory consumption was 522.9MB. Max. memory is 16.1GB. [2024-11-23 01:16:57,211 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 901.8MB. Free memory was 337.5MB in the beginning and 336.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-23 01:16:57,212 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 167.8MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 916.85ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 56.9MB in the end (delta: 50.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.12ms. Allocated memory is still 167.8MB. Free memory was 56.5MB in the beginning and 49.7MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 220.33ms. Allocated memory is still 167.8MB. Free memory was 49.7MB in the beginning and 127.3MB in the end (delta: -77.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1174.79ms. Allocated memory was 167.8MB in the beginning and 253.8MB in the end (delta: 86.0MB). Free memory was 127.3MB in the beginning and 213.3MB in the end (delta: -86.0MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30232.62ms. Allocated memory was 253.8MB in the beginning and 901.8MB in the end (delta: 648.0MB). Free memory was 212.4MB in the beginning and 337.5MB in the end (delta: -125.1MB). Peak memory consumption was 522.9MB. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 901.8MB. Free memory was 337.5MB in the beginning and 336.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1475]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of strcmp at line 1383, overapproximation of strlen at line 1397, overapproximation of strrchr at line 1424. Possible FailurePath: [L1318] static const char *applet_name; [L1319] static signed int bb_errno_location; [L1319] static signed int bb_errno_location; [L1320] static signed int * const bb_errno = &bb_errno_location; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1575] char *a = malloc(11); [L1576] a[10] = 0 [L1577] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=0] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=1] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=2] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=3] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=4] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=5] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=6] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=7] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=8] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=9] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=10] [L1577] COND FALSE !(i<10) VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1579] applet_name = a [L1580] bb_errno_location = __VERIFIER_nondet_int() [L1581] optind = 1 [L1582] int argc = __VERIFIER_nondet_int(); [L1583] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1583] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=2, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1584] EXPR argc+1 [L1584] char **argv=malloc((argc+1)*sizeof(char*)); [L1585] EXPR argc+1 [L1585] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1586] argv[argc]=0 [L1587] int i=0; VAL [applet_name={-1:0}, argc=2, argv={-13:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=0, mem_track={-14:0}, optind=1] [L1587] COND TRUE i= 2u) [L1395] argv = argv + 1l [L1396] EXPR \read(**argv) [L1396] CALL, EXPR bb_get_last_path_component_strip(*argv) [L1443] char *slash; [L1444] CALL, EXPR last_char_is(path, 47) [L1482] COND TRUE !(s == ((const char *)((void *)0))) [L1484] EXPR \read(*s) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1484] COND FALSE !(!((signed int)*s == 0)) [L1495] return (char *)((void *)0); VAL [\result={0:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, c=47, dummy_utmp={11:0}, optind=1, s={-26:0}] [L1444] RET, EXPR last_char_is(path, 47) [L1444] slash=last_char_is(path, 47) [L1445] char *tmp_post$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-26:0}, slash={0:0}] [L1446] COND FALSE !(!(slash == ((char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1454] char *return_value_bb_get_last_path_component_nostrip$2; [L1455] CALL, EXPR bb_get_last_path_component_nostrip(path) [L1423] char *slash; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-26:0}] [L1424] slash=strrchr(path, 47) [L1425] _Bool tmp_if_expr$2; [L1426] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-26:0}, slash={0:0}] [L1427] COND TRUE slash == ((char *)((void *)0)) [L1428] tmp_if_expr$2 = 1 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-26:0}, slash={0:0}, tmp_if_expr$2=1] [L1437] COND TRUE !(tmp_if_expr$2 == (_Bool)0) [L1438] return (char *)path; VAL [\result={-26:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, slash={0:0}] [L1455] RET, EXPR bb_get_last_path_component_nostrip(path) [L1455] return_value_bb_get_last_path_component_nostrip$2=bb_get_last_path_component_nostrip(path) [L1456] return return_value_bb_get_last_path_component_nostrip$2; VAL [\result={-26:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1396] RET, EXPR bb_get_last_path_component_strip(*argv) [L1396] s=bb_get_last_path_component_strip(*argv) [L1397] m=strlen(s) [L1398] argv = argv + 1l [L1399] signed int tmp_statement_expression$6; [L1400] EXPR \read(**argv) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1400] COND FALSE !(!(*argv == ((char *)((void *)0)))) [L1414] unsigned long int tmp_post$8 = m; [L1415] m = m + 1ul [L1416] s[(signed long int)tmp_post$8] = (char)10 [L1417] signed long int return_value_full_write$9; [L1418] CALL full_write(1, (const void *)s, m) [L1464] signed long int cc; [L1465] signed long int total = (signed long int)0; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, dummy_utmp={11:0}, fd=1, len=9223372036854776138U, optind=1, total=0] [L1466] COND TRUE !(len == 0ul) [L1468] CALL, EXPR safe_write(fd, buf, len) [L1499] signed long int n; [L1500] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, count=9223372036854776138U, dummy_utmp={11:0}, fd=1, optind=1] [L1503] CALL, EXPR write(fd, buf, count) [L1569] long ret=__VERIFIER_nondet_long(); [L1570] CALL assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1570] RET assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=9223372036854776138U, optind=1, ret=2] [L1571] return ret; VAL [\result=2, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=9223372036854776138U, optind=1] [L1503] RET, EXPR write(fd, buf, count) [L1503] n=write(fd, buf, count) [L1504] COND FALSE !(n < 0l) [L1507] tmp_if_expr$1 = 0 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, count=9223372036854776138U, dummy_utmp={11:0}, fd=1, n=2, optind=1, tmp_if_expr$1=0] [L1509] COND FALSE !(tmp_if_expr$1 != (_Bool)0) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, count=9223372036854776138U, dummy_utmp={11:0}, fd=1, n=2, optind=1] [L1510] return n; VAL [\result=2, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, count=9223372036854776138U, dummy_utmp={11:0}, fd=1, optind=1] [L1468] RET, EXPR safe_write(fd, buf, len) [L1468] cc=safe_write(fd, buf, len) [L1469] COND FALSE !(cc < 0l) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, cc=2, dummy_utmp={11:0}, fd=1, len=9223372036854776138U, optind=1, total=0] [L1475] EXPR total + cc [L1475] total = total + cc [L1476] buf = (const void *)((const char *)buf + cc) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:2}, cc=2, dummy_utmp={11:0}, fd=1, len=9223372036854776138U, optind=1, total=2] [L1466] len = len - (unsigned long int)cc VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:2}, dummy_utmp={11:0}, fd=1, len=9223372036854776136U, optind=1, total=2] [L1466] COND TRUE !(len == 0ul) [L1468] CALL, EXPR safe_write(fd, buf, len) [L1499] signed long int n; [L1500] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:2}, count=9223372036854776136U, dummy_utmp={11:0}, fd=1, optind=1] [L1503] CALL, EXPR write(fd, buf, count) [L1569] long ret=__VERIFIER_nondet_long(); [L1570] CALL assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1570] RET assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=9223372036854776136U, optind=1, ret=9223372036854775806] [L1571] return ret; VAL [\result=9223372036854775806, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=9223372036854776136U, optind=1] [L1503] RET, EXPR write(fd, buf, count) [L1503] n=write(fd, buf, count) [L1504] COND FALSE !(n < 0l) [L1507] tmp_if_expr$1 = 0 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:2}, count=9223372036854776136U, dummy_utmp={11:0}, fd=1, n=9223372036854775806, optind=1, tmp_if_expr$1=0] [L1509] COND FALSE !(tmp_if_expr$1 != (_Bool)0) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:2}, count=9223372036854776136U, dummy_utmp={11:0}, fd=1, n=9223372036854775806, optind=1] [L1510] return n; VAL [\result=9223372036854775806, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:2}, count=9223372036854776136U, dummy_utmp={11:0}, fd=1, optind=1] [L1468] RET, EXPR safe_write(fd, buf, len) [L1468] cc=safe_write(fd, buf, len) [L1469] COND FALSE !(cc < 0l) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:2}, cc=9223372036854775806, dummy_utmp={11:0}, fd=1, len=9223372036854776136U, optind=1, total=2] [L1475] total + cc VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:2}, dummy_utmp={11:0}, fd=1, len=9223372036854776136U, optind=1] - UnprovableResult [Line: 1577]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1577]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1585]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1585]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1592]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1592]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1587]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1587]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1356]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1356]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1361]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1361]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1366]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1366]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1390]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1390]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1475]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1596]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1596]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 30.0s, OverallIterations: 31, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 824 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 817 mSDsluCounter, 10629 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7356 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1212 IncrementalHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 3273 mSDtfsCounter, 1212 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2415 GetRequests, 2264 SyntacticMatches, 2 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=30, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 44 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 3768 NumberOfCodeBlocks, 3537 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 4475 ConstructedInterpolants, 0 QuantifiedInterpolants, 10860 SizeOfPredicates, 23 NumberOfNonLiveVariables, 22338 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 56 InterpolantComputations, 20 PerfectInterpolantSequences, 12960/16420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-23 01:16:57,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-23 01:16:59,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 01:16:59,630 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-23 01:16:59,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 01:16:59,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 01:16:59,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-23 01:16:59,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 01:16:59,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 01:16:59,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 01:16:59,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 01:16:59,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 01:16:59,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 01:16:59,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 01:16:59,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 01:16:59,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 01:16:59,676 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 01:16:59,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 01:16:59,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 01:16:59,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 01:16:59,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 01:16:59,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 01:16:59,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 01:16:59,682 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 01:16:59,683 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-23 01:16:59,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-23 01:16:59,684 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-23 01:16:59,684 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-23 01:16:59,684 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 01:16:59,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 01:16:59,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 01:16:59,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 01:16:59,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 01:16:59,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 01:16:59,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 01:16:59,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 01:16:59,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 01:16:59,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 01:16:59,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 01:16:59,688 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-23 01:16:59,689 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-23 01:16:59,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 01:16:59,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 01:16:59,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 01:16:59,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 01:16:59,690 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2024-11-23 01:17:00,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 01:17:00,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 01:17:00,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 01:17:00,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 01:17:00,063 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 01:17:00,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-23 01:17:01,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-23 01:17:01,890 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 01:17:01,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-23 01:17:01,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe41b4be2/d542bd4a94b049aabf9a61ae95483dfb/FLAG2a26cd8df [2024-11-23 01:17:01,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe41b4be2/d542bd4a94b049aabf9a61ae95483dfb [2024-11-23 01:17:01,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 01:17:01,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 01:17:01,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 01:17:01,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 01:17:01,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 01:17:01,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:17:01" (1/1) ... [2024-11-23 01:17:01,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4453286c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:01, skipping insertion in model container [2024-11-23 01:17:01,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:17:01" (1/1) ... [2024-11-23 01:17:02,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 01:17:02,659 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 01:17:02,682 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 01:17:02,687 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 01:17:02,691 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 01:17:02,700 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 01:17:02,710 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 01:17:02,711 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 01:17:02,712 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 01:17:02,714 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 01:17:02,716 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 01:17:02,735 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-23 01:17:02,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 01:17:02,775 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 01:17:02,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 01:17:03,040 INFO L204 MainTranslator]: Completed translation [2024-11-23 01:17:03,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:03 WrapperNode [2024-11-23 01:17:03,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 01:17:03,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 01:17:03,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 01:17:03,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 01:17:03,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:03" (1/1) ... [2024-11-23 01:17:03,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:03" (1/1) ... [2024-11-23 01:17:03,157 INFO L138 Inliner]: procedures = 353, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 734 [2024-11-23 01:17:03,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 01:17:03,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 01:17:03,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 01:17:03,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 01:17:03,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:03" (1/1) ... [2024-11-23 01:17:03,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:03" (1/1) ... [2024-11-23 01:17:03,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:03" (1/1) ... [2024-11-23 01:17:03,239 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 3, 355, 12, 2, 2, 12]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 1, 355, 0, 0, 0, 0]. The 11 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 1, 2, 5]. [2024-11-23 01:17:03,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:03" (1/1) ... [2024-11-23 01:17:03,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:03" (1/1) ... [2024-11-23 01:17:03,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:03" (1/1) ... [2024-11-23 01:17:03,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:03" (1/1) ... [2024-11-23 01:17:03,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:03" (1/1) ... [2024-11-23 01:17:03,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:03" (1/1) ... [2024-11-23 01:17:03,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 01:17:03,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 01:17:03,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 01:17:03,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 01:17:03,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:03" (1/1) ... [2024-11-23 01:17:03,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 01:17:03,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-23 01:17:03,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 01:17:03,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 01:17:03,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-23 01:17:03,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-23 01:17:03,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-23 01:17:03,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-23 01:17:03,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-23 01:17:03,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-23 01:17:03,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-23 01:17:03,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-23 01:17:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-23 01:17:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-23 01:17:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-23 01:17:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-23 01:17:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-23 01:17:03,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-23 01:17:03,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-23 01:17:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-23 01:17:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-23 01:17:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-23 01:17:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-23 01:17:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-23 01:17:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-23 01:17:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-23 01:17:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-23 01:17:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-23 01:17:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-23 01:17:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-23 01:17:03,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-23 01:17:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-23 01:17:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-23 01:17:03,455 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-23 01:17:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 01:17:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 01:17:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-23 01:17:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-23 01:17:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-23 01:17:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-23 01:17:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-23 01:17:03,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-23 01:17:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-23 01:17:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-23 01:17:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-23 01:17:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-23 01:17:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-23 01:17:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-23 01:17:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-23 01:17:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-23 01:17:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-23 01:17:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-23 01:17:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-23 01:17:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-23 01:17:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-23 01:17:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-23 01:17:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-23 01:17:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-23 01:17:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-23 01:17:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-23 01:17:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-23 01:17:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-23 01:17:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 01:17:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-23 01:17:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-23 01:17:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-23 01:17:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-23 01:17:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-23 01:17:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-23 01:17:03,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-23 01:17:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-23 01:17:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-23 01:17:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-23 01:17:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-23 01:17:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-23 01:17:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-23 01:17:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-23 01:17:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-23 01:17:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-23 01:17:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-23 01:17:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-23 01:17:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-23 01:17:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-23 01:17:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-23 01:17:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-23 01:17:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-23 01:17:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-23 01:17:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-23 01:17:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-23 01:17:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-23 01:17:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-23 01:17:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-23 01:17:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-23 01:17:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-23 01:17:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-23 01:17:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-23 01:17:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-23 01:17:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-23 01:17:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-23 01:17:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-23 01:17:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-23 01:17:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-23 01:17:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-23 01:17:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-23 01:17:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-23 01:17:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-23 01:17:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-23 01:17:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-23 01:17:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-23 01:17:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-23 01:17:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-23 01:17:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-23 01:17:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-23 01:17:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-23 01:17:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-23 01:17:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-23 01:17:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-23 01:17:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-23 01:17:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-23 01:17:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 01:17:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 01:17:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 01:17:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 01:17:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-23 01:17:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-23 01:17:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-23 01:17:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-23 01:17:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-23 01:17:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-23 01:17:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-23 01:17:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-23 01:17:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-23 01:17:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-23 01:17:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-23 01:17:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-23 01:17:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 01:17:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 01:17:03,889 INFO L238 CfgBuilder]: Building ICFG [2024-11-23 01:17:03,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 01:17:04,732 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-23 01:17:04,732 INFO L287 CfgBuilder]: Performing block encoding [2024-11-23 01:17:04,749 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 01:17:04,751 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-23 01:17:04,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:17:04 BoogieIcfgContainer [2024-11-23 01:17:04,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 01:17:04,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 01:17:04,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 01:17:04,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 01:17:04,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:17:01" (1/3) ... [2024-11-23 01:17:04,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5d1c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:17:04, skipping insertion in model container [2024-11-23 01:17:04,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:17:03" (2/3) ... [2024-11-23 01:17:04,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5d1c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:17:04, skipping insertion in model container [2024-11-23 01:17:04,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:17:04" (3/3) ... [2024-11-23 01:17:04,764 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-2.i [2024-11-23 01:17:04,782 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 01:17:04,782 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-23 01:17:04,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 01:17:04,861 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@27e79af0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 01:17:04,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-23 01:17:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 94 states have (on average 1.7127659574468086) internal successors, (161), 118 states have internal predecessors, (161), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-23 01:17:04,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:04,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-23 01:17:04,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:04,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-23 01:17:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:04,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197726058] [2024-11-23 01:17:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:04,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:04,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:04,902 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:04,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-23 01:17:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:05,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-23 01:17:05,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:05,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:17:05,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:17:05,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:05,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197726058] [2024-11-23 01:17:05,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197726058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:17:05,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:17:05,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-23 01:17:05,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588209373] [2024-11-23 01:17:05,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:05,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 01:17:05,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:05,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 01:17:05,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 01:17:05,404 INFO L87 Difference]: Start difference. First operand has 122 states, 94 states have (on average 1.7127659574468086) internal successors, (161), 118 states have internal predecessors, (161), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 01:17:05,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:05,434 INFO L93 Difference]: Finished difference Result 223 states and 322 transitions. [2024-11-23 01:17:05,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 01:17:05,436 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-23 01:17:05,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:05,444 INFO L225 Difference]: With dead ends: 223 [2024-11-23 01:17:05,445 INFO L226 Difference]: Without dead ends: 102 [2024-11-23 01:17:05,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 01:17:05,454 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:05,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:17:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-23 01:17:05,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-23 01:17:05,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 89 states have (on average 1.449438202247191) internal successors, (129), 98 states have internal predecessors, (129), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:05,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2024-11-23 01:17:05,525 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 4 [2024-11-23 01:17:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:05,525 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2024-11-23 01:17:05,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 01:17:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2024-11-23 01:17:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-23 01:17:05,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:05,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-23 01:17:05,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-23 01:17:05,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:05,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:05,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:05,729 INFO L85 PathProgramCache]: Analyzing trace with hash 36333200, now seen corresponding path program 1 times [2024-11-23 01:17:05,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:05,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503234625] [2024-11-23 01:17:05,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:05,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:05,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:05,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:05,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-23 01:17:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:06,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 01:17:06,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:06,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:17:06,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:17:06,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:06,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503234625] [2024-11-23 01:17:06,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503234625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:17:06,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:17:06,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 01:17:06,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230560875] [2024-11-23 01:17:06,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:06,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:17:06,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:06,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:17:06,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:17:06,098 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 01:17:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:06,138 INFO L93 Difference]: Finished difference Result 202 states and 264 transitions. [2024-11-23 01:17:06,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:17:06,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-23 01:17:06,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:06,140 INFO L225 Difference]: With dead ends: 202 [2024-11-23 01:17:06,140 INFO L226 Difference]: Without dead ends: 105 [2024-11-23 01:17:06,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:17:06,142 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:06,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:17:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-23 01:17:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-23 01:17:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.434782608695652) internal successors, (132), 101 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2024-11-23 01:17:06,153 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 5 [2024-11-23 01:17:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:06,153 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2024-11-23 01:17:06,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 01:17:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2024-11-23 01:17:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-23 01:17:06,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:06,154 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-23 01:17:06,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-23 01:17:06,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:06,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:06,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:06,356 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-23 01:17:06,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:06,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421870241] [2024-11-23 01:17:06,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:06,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:06,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:06,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:06,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-23 01:17:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:06,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 01:17:06,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:17:06,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:17:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:17:06,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:06,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421870241] [2024-11-23 01:17:06,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421870241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:17:06,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 01:17:06,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-23 01:17:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144339199] [2024-11-23 01:17:06,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 01:17:06,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 01:17:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:06,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 01:17:06,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-23 01:17:06,790 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 01:17:06,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:06,889 INFO L93 Difference]: Finished difference Result 205 states and 269 transitions. [2024-11-23 01:17:06,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 01:17:06,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-23 01:17:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:06,892 INFO L225 Difference]: With dead ends: 205 [2024-11-23 01:17:06,892 INFO L226 Difference]: Without dead ends: 108 [2024-11-23 01:17:06,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:17:06,893 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:06,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 506 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:17:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-23 01:17:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-11-23 01:17:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 101 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:06,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2024-11-23 01:17:06,907 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 8 [2024-11-23 01:17:06,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:06,908 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2024-11-23 01:17:06,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 01:17:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2024-11-23 01:17:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-23 01:17:06,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:06,910 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:06,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-23 01:17:07,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:07,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:07,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:07,111 INFO L85 PathProgramCache]: Analyzing trace with hash 765480000, now seen corresponding path program 1 times [2024-11-23 01:17:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:07,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72419588] [2024-11-23 01:17:07,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:07,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:07,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:07,116 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:07,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-23 01:17:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:07,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 01:17:07,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:17:07,506 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:17:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:17:07,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:07,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72419588] [2024-11-23 01:17:07,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72419588] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:17:07,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 01:17:07,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-23 01:17:07,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214485158] [2024-11-23 01:17:07,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 01:17:07,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 01:17:07,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:07,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 01:17:07,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-23 01:17:07,589 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 01:17:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:07,780 INFO L93 Difference]: Finished difference Result 213 states and 278 transitions. [2024-11-23 01:17:07,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 01:17:07,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-23 01:17:07,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:07,784 INFO L225 Difference]: With dead ends: 213 [2024-11-23 01:17:07,784 INFO L226 Difference]: Without dead ends: 117 [2024-11-23 01:17:07,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-23 01:17:07,785 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 10 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:07,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 507 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:17:07,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-23 01:17:07,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-23 01:17:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 113 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2024-11-23 01:17:07,796 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 17 [2024-11-23 01:17:07,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:07,796 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2024-11-23 01:17:07,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 01:17:07,797 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2024-11-23 01:17:07,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-23 01:17:07,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:07,798 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:07,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-23 01:17:08,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:08,002 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:08,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:08,002 INFO L85 PathProgramCache]: Analyzing trace with hash -871046720, now seen corresponding path program 2 times [2024-11-23 01:17:08,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:08,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868004694] [2024-11-23 01:17:08,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 01:17:08,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:08,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:08,007 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:08,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-23 01:17:08,277 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 01:17:08,277 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 01:17:08,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 01:17:08,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-23 01:17:08,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:17:08,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:08,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868004694] [2024-11-23 01:17:08,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868004694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:17:08,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:17:08,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 01:17:08,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173978351] [2024-11-23 01:17:08,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:08,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 01:17:08,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:08,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 01:17:08,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:17:08,345 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:08,640 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2024-11-23 01:17:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 01:17:08,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-23 01:17:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:08,643 INFO L225 Difference]: With dead ends: 117 [2024-11-23 01:17:08,643 INFO L226 Difference]: Without dead ends: 115 [2024-11-23 01:17:08,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:17:08,644 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 115 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:08,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 359 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 01:17:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-23 01:17:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-23 01:17:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 111 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 146 transitions. [2024-11-23 01:17:08,661 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 146 transitions. Word has length 29 [2024-11-23 01:17:08,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:08,664 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 146 transitions. [2024-11-23 01:17:08,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:08,665 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2024-11-23 01:17:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-23 01:17:08,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:08,668 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:08,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-23 01:17:08,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:08,869 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:08,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:08,869 INFO L85 PathProgramCache]: Analyzing trace with hash -456152404, now seen corresponding path program 1 times [2024-11-23 01:17:08,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:08,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520299606] [2024-11-23 01:17:08,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:08,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:08,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:08,871 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:08,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-23 01:17:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:09,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 01:17:09,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:17:09,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:17:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 01:17:09,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:09,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520299606] [2024-11-23 01:17:09,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520299606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:17:09,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 01:17:09,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-23 01:17:09,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004965800] [2024-11-23 01:17:09,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 01:17:09,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-23 01:17:09,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:09,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-23 01:17:09,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-23 01:17:09,619 INFO L87 Difference]: Start difference. First operand 115 states and 146 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 01:17:09,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:09,989 INFO L93 Difference]: Finished difference Result 221 states and 286 transitions. [2024-11-23 01:17:09,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 01:17:09,991 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-11-23 01:17:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:09,991 INFO L225 Difference]: With dead ends: 221 [2024-11-23 01:17:09,992 INFO L226 Difference]: Without dead ends: 127 [2024-11-23 01:17:09,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2024-11-23 01:17:09,995 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 8 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:09,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1119 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 01:17:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-23 01:17:10,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-23 01:17:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 123 states have internal predecessors, (154), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2024-11-23 01:17:10,015 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 35 [2024-11-23 01:17:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:10,015 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2024-11-23 01:17:10,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 01:17:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2024-11-23 01:17:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-23 01:17:10,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:10,017 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:10,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-23 01:17:10,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:10,218 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:10,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:10,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1314512940, now seen corresponding path program 2 times [2024-11-23 01:17:10,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:10,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575201535] [2024-11-23 01:17:10,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 01:17:10,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:10,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:10,220 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:10,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-23 01:17:10,531 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 01:17:10,531 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 01:17:10,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 01:17:10,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:17:10,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:17:10,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:10,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575201535] [2024-11-23 01:17:10,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575201535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:17:10,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:17:10,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 01:17:10,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359188215] [2024-11-23 01:17:10,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:10,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:17:10,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:10,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:17:10,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:17:10,559 INFO L87 Difference]: Start difference. First operand 127 states and 158 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:10,601 INFO L93 Difference]: Finished difference Result 218 states and 280 transitions. [2024-11-23 01:17:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:17:10,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2024-11-23 01:17:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:10,603 INFO L225 Difference]: With dead ends: 218 [2024-11-23 01:17:10,603 INFO L226 Difference]: Without dead ends: 130 [2024-11-23 01:17:10,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:17:10,604 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:10,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:17:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-23 01:17:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-23 01:17:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 120 states have (on average 1.3083333333333333) internal successors, (157), 126 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2024-11-23 01:17:10,618 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 47 [2024-11-23 01:17:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:10,619 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2024-11-23 01:17:10,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2024-11-23 01:17:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-23 01:17:10,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:10,620 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:10,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-23 01:17:10,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:10,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:10,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:10,822 INFO L85 PathProgramCache]: Analyzing trace with hash -856727864, now seen corresponding path program 1 times [2024-11-23 01:17:10,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:10,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005303445] [2024-11-23 01:17:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:10,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:10,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:10,826 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:10,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-23 01:17:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:11,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 01:17:11,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:17:11,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:17:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:17:11,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:11,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005303445] [2024-11-23 01:17:11,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005303445] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:17:11,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 01:17:11,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-23 01:17:11,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91015019] [2024-11-23 01:17:11,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 01:17:11,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 01:17:11,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:11,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 01:17:11,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-23 01:17:11,307 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:11,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:11,501 INFO L93 Difference]: Finished difference Result 224 states and 288 transitions. [2024-11-23 01:17:11,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 01:17:11,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2024-11-23 01:17:11,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:11,503 INFO L225 Difference]: With dead ends: 224 [2024-11-23 01:17:11,503 INFO L226 Difference]: Without dead ends: 133 [2024-11-23 01:17:11,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:17:11,504 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:11,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 01:17:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-23 01:17:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-11-23 01:17:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 126 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2024-11-23 01:17:11,512 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 50 [2024-11-23 01:17:11,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:11,512 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2024-11-23 01:17:11,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:11,513 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2024-11-23 01:17:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-23 01:17:11,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:11,514 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:11,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-23 01:17:11,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:11,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:11,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:11,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2047188748, now seen corresponding path program 1 times [2024-11-23 01:17:11,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:11,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841789220] [2024-11-23 01:17:11,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:11,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:11,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:11,717 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:11,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-23 01:17:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:12,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 01:17:12,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:17:12,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:17:12,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:12,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841789220] [2024-11-23 01:17:12,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841789220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:17:12,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:17:12,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 01:17:12,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174507042] [2024-11-23 01:17:12,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:12,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:17:12,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:12,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:17:12,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:17:12,093 INFO L87 Difference]: Start difference. First operand 130 states and 161 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:12,128 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2024-11-23 01:17:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:17:12,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2024-11-23 01:17:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:12,130 INFO L225 Difference]: With dead ends: 134 [2024-11-23 01:17:12,130 INFO L226 Difference]: Without dead ends: 133 [2024-11-23 01:17:12,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:17:12,131 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:12,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:17:12,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-23 01:17:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-23 01:17:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 124 states have (on average 1.2903225806451613) internal successors, (160), 129 states have internal predecessors, (160), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2024-11-23 01:17:12,138 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 51 [2024-11-23 01:17:12,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:12,138 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2024-11-23 01:17:12,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:12,139 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2024-11-23 01:17:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-23 01:17:12,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:12,140 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:12,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-23 01:17:12,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:12,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:12,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:12,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1371935090, now seen corresponding path program 1 times [2024-11-23 01:17:12,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:12,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083509542] [2024-11-23 01:17:12,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:12,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:12,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:12,345 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:12,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-23 01:17:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:12,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 01:17:12,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:17:12,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:17:12,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083509542] [2024-11-23 01:17:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083509542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:17:12,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:17:12,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 01:17:12,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563741902] [2024-11-23 01:17:12,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:12,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 01:17:12,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:12,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 01:17:12,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 01:17:12,780 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:13,189 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2024-11-23 01:17:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 01:17:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2024-11-23 01:17:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:13,191 INFO L225 Difference]: With dead ends: 135 [2024-11-23 01:17:13,191 INFO L226 Difference]: Without dead ends: 134 [2024-11-23 01:17:13,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:17:13,192 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 138 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:13,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 423 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 01:17:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-23 01:17:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2024-11-23 01:17:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 124 states have (on average 1.282258064516129) internal successors, (159), 128 states have internal predecessors, (159), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2024-11-23 01:17:13,201 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 52 [2024-11-23 01:17:13,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:13,203 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2024-11-23 01:17:13,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2024-11-23 01:17:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-23 01:17:13,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:13,209 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:13,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-23 01:17:13,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:13,410 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:13,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:13,410 INFO L85 PathProgramCache]: Analyzing trace with hash -735253954, now seen corresponding path program 1 times [2024-11-23 01:17:13,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:13,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091711766] [2024-11-23 01:17:13,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:13,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:13,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:13,413 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:13,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-23 01:17:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:13,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 01:17:13,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:17:13,823 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:17:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:17:13,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:13,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091711766] [2024-11-23 01:17:13,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091711766] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:17:13,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 01:17:13,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-23 01:17:13,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242410429] [2024-11-23 01:17:13,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 01:17:13,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 01:17:13,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:13,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 01:17:13,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-23 01:17:13,871 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:13,937 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2024-11-23 01:17:13,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 01:17:13,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2024-11-23 01:17:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:13,939 INFO L225 Difference]: With dead ends: 139 [2024-11-23 01:17:13,939 INFO L226 Difference]: Without dead ends: 121 [2024-11-23 01:17:13,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:17:13,940 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:13,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 368 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:17:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-23 01:17:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-23 01:17:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 114 states have (on average 1.263157894736842) internal successors, (144), 117 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2024-11-23 01:17:13,946 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 54 [2024-11-23 01:17:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:13,946 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2024-11-23 01:17:13,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2024-11-23 01:17:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-23 01:17:13,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:13,947 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:13,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-23 01:17:14,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:14,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:14,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash -180848171, now seen corresponding path program 1 times [2024-11-23 01:17:14,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:14,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986711953] [2024-11-23 01:17:14,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:14,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:14,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:14,151 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:14,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-23 01:17:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:14,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 01:17:14,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:17:14,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:17:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:17:14,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:14,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986711953] [2024-11-23 01:17:14,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986711953] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:17:14,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 01:17:14,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-23 01:17:14,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673318068] [2024-11-23 01:17:14,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 01:17:14,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 01:17:14,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:14,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 01:17:14,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-23 01:17:14,659 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:14,880 INFO L93 Difference]: Finished difference Result 215 states and 271 transitions. [2024-11-23 01:17:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 01:17:14,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2024-11-23 01:17:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:14,882 INFO L225 Difference]: With dead ends: 215 [2024-11-23 01:17:14,882 INFO L226 Difference]: Without dead ends: 133 [2024-11-23 01:17:14,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-23 01:17:14,883 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 8 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:14,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 440 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 01:17:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-23 01:17:14,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-23 01:17:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 126 states have (on average 1.2380952380952381) internal successors, (156), 129 states have internal predecessors, (156), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 160 transitions. [2024-11-23 01:17:14,890 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 160 transitions. Word has length 54 [2024-11-23 01:17:14,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:14,891 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 160 transitions. [2024-11-23 01:17:14,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 160 transitions. [2024-11-23 01:17:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-23 01:17:14,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:14,892 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:14,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-23 01:17:15,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:15,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:15,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:15,094 INFO L85 PathProgramCache]: Analyzing trace with hash -614640115, now seen corresponding path program 1 times [2024-11-23 01:17:15,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:15,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480757098] [2024-11-23 01:17:15,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:15,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:15,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:15,098 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:15,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-23 01:17:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:15,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 01:17:15,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:17:15,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:17:15,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:15,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480757098] [2024-11-23 01:17:15,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480757098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:17:15,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:17:15,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 01:17:15,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539339389] [2024-11-23 01:17:15,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:15,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:17:15,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:15,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:17:15,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:17:15,480 INFO L87 Difference]: Start difference. First operand 133 states and 160 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:15,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:15,506 INFO L93 Difference]: Finished difference Result 182 states and 225 transitions. [2024-11-23 01:17:15,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:17:15,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-23 01:17:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:15,507 INFO L225 Difference]: With dead ends: 182 [2024-11-23 01:17:15,508 INFO L226 Difference]: Without dead ends: 117 [2024-11-23 01:17:15,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:17:15,508 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:15,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:17:15,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-23 01:17:15,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-23 01:17:15,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 113 states have internal predecessors, (134), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2024-11-23 01:17:15,516 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 55 [2024-11-23 01:17:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:15,516 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2024-11-23 01:17:15,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2024-11-23 01:17:15,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-23 01:17:15,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:15,517 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:15,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-23 01:17:15,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:15,718 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:15,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash 692610261, now seen corresponding path program 2 times [2024-11-23 01:17:15,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:15,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866682025] [2024-11-23 01:17:15,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 01:17:15,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:15,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:15,721 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:15,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-23 01:17:16,072 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 01:17:16,073 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 01:17:16,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 01:17:16,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-23 01:17:16,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:17:16,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:16,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866682025] [2024-11-23 01:17:16,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866682025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:17:16,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:17:16,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 01:17:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667814334] [2024-11-23 01:17:16,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:16,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:17:16,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:16,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:17:16,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:17:16,133 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:16,277 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2024-11-23 01:17:16,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:17:16,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2024-11-23 01:17:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:16,278 INFO L225 Difference]: With dead ends: 141 [2024-11-23 01:17:16,279 INFO L226 Difference]: Without dead ends: 140 [2024-11-23 01:17:16,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:17:16,279 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:16,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:17:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-23 01:17:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-23 01:17:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 134 states have (on average 1.1865671641791045) internal successors, (159), 136 states have internal predecessors, (159), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2024-11-23 01:17:16,290 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 66 [2024-11-23 01:17:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:16,290 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2024-11-23 01:17:16,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2024-11-23 01:17:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-23 01:17:16,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:16,292 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:16,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-23 01:17:16,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:16,493 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:16,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:16,493 INFO L85 PathProgramCache]: Analyzing trace with hash -773011160, now seen corresponding path program 1 times [2024-11-23 01:17:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:16,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905020435] [2024-11-23 01:17:16,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:16,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:16,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:16,497 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:16,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-23 01:17:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:16,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 01:17:16,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:17,076 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-23 01:17:17,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:17:17,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:17,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905020435] [2024-11-23 01:17:17,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905020435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:17:17,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:17:17,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 01:17:17,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503394807] [2024-11-23 01:17:17,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:17,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 01:17:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:17,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 01:17:17,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 01:17:17,077 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:17,352 INFO L93 Difference]: Finished difference Result 194 states and 234 transitions. [2024-11-23 01:17:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 01:17:17,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 75 [2024-11-23 01:17:17,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:17,354 INFO L225 Difference]: With dead ends: 194 [2024-11-23 01:17:17,354 INFO L226 Difference]: Without dead ends: 140 [2024-11-23 01:17:17,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-23 01:17:17,355 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 91 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:17,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 314 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 01:17:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-23 01:17:17,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-23 01:17:17,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 134 states have (on average 1.1791044776119404) internal successors, (158), 136 states have internal predecessors, (158), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2024-11-23 01:17:17,367 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 75 [2024-11-23 01:17:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:17,367 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2024-11-23 01:17:17,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2024-11-23 01:17:17,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-23 01:17:17,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:17,368 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:17,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-23 01:17:17,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:17,573 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:17,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:17,573 INFO L85 PathProgramCache]: Analyzing trace with hash -475670046, now seen corresponding path program 1 times [2024-11-23 01:17:17,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:17,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581351414] [2024-11-23 01:17:17,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:17,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:17,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:17,575 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:17,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-23 01:17:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:18,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 01:17:18,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 122 proven. 51 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-23 01:17:18,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:17:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 122 proven. 51 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-23 01:17:18,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:18,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581351414] [2024-11-23 01:17:18,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581351414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:17:18,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 01:17:18,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-23 01:17:18,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561819881] [2024-11-23 01:17:18,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 01:17:18,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-23 01:17:18,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:18,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-23 01:17:18,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-23 01:17:18,373 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:19,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:19,094 INFO L93 Difference]: Finished difference Result 245 states and 294 transitions. [2024-11-23 01:17:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 01:17:19,095 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-23 01:17:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:19,096 INFO L225 Difference]: With dead ends: 245 [2024-11-23 01:17:19,096 INFO L226 Difference]: Without dead ends: 164 [2024-11-23 01:17:19,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2024-11-23 01:17:19,099 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 8 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:19,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1048 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-23 01:17:19,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-23 01:17:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-23 01:17:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 158 states have (on average 1.1518987341772151) internal successors, (182), 160 states have internal predecessors, (182), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:19,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2024-11-23 01:17:19,112 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 186 transitions. Word has length 89 [2024-11-23 01:17:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:19,112 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 186 transitions. [2024-11-23 01:17:19,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 186 transitions. [2024-11-23 01:17:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-23 01:17:19,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:19,114 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:19,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-23 01:17:19,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:19,315 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:19,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:19,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1799807557, now seen corresponding path program 1 times [2024-11-23 01:17:19,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:19,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659017859] [2024-11-23 01:17:19,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:19,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:19,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:19,319 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:19,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-23 01:17:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:19,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-23 01:17:19,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-23 01:17:20,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:17:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2024-11-23 01:17:20,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:20,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659017859] [2024-11-23 01:17:20,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659017859] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:17:20,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 01:17:20,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2024-11-23 01:17:20,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91731756] [2024-11-23 01:17:20,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 01:17:20,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-23 01:17:20,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:20,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 01:17:20,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-23 01:17:20,662 INFO L87 Difference]: Start difference. First operand 164 states and 186 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-23 01:17:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:21,757 INFO L93 Difference]: Finished difference Result 256 states and 297 transitions. [2024-11-23 01:17:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-23 01:17:21,758 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 110 [2024-11-23 01:17:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:21,759 INFO L225 Difference]: With dead ends: 256 [2024-11-23 01:17:21,760 INFO L226 Difference]: Without dead ends: 199 [2024-11-23 01:17:21,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-23 01:17:21,761 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 162 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:21,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 524 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-23 01:17:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-23 01:17:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-23 01:17:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 193 states have (on average 1.1295336787564767) internal successors, (218), 195 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2024-11-23 01:17:21,772 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 110 [2024-11-23 01:17:21,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:21,772 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2024-11-23 01:17:21,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-23 01:17:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2024-11-23 01:17:21,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-23 01:17:21,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:21,774 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:21,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-23 01:17:21,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:21,975 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:21,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:21,975 INFO L85 PathProgramCache]: Analyzing trace with hash -46553016, now seen corresponding path program 2 times [2024-11-23 01:17:21,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:21,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928013899] [2024-11-23 01:17:21,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 01:17:21,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:21,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:21,978 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:21,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-23 01:17:22,410 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 01:17:22,410 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 01:17:22,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 01:17:22,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-23 01:17:22,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:17:22,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:22,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928013899] [2024-11-23 01:17:22,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928013899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:17:22,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:17:22,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 01:17:22,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129926088] [2024-11-23 01:17:22,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:22,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 01:17:22,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:22,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 01:17:22,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:17:22,456 INFO L87 Difference]: Start difference. First operand 199 states and 222 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 01:17:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:22,524 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2024-11-23 01:17:22,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 01:17:22,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 145 [2024-11-23 01:17:22,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:22,526 INFO L225 Difference]: With dead ends: 226 [2024-11-23 01:17:22,526 INFO L226 Difference]: Without dead ends: 204 [2024-11-23 01:17:22,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:17:22,527 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:22,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 372 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:17:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-23 01:17:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2024-11-23 01:17:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 194 states have (on average 1.1288659793814433) internal successors, (219), 196 states have internal predecessors, (219), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2024-11-23 01:17:22,539 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 145 [2024-11-23 01:17:22,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:22,540 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2024-11-23 01:17:22,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 01:17:22,540 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2024-11-23 01:17:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-23 01:17:22,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:22,541 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:22,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-23 01:17:22,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:22,746 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:22,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:22,746 INFO L85 PathProgramCache]: Analyzing trace with hash 10705286, now seen corresponding path program 1 times [2024-11-23 01:17:22,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:22,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68793909] [2024-11-23 01:17:22,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:22,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:22,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:22,748 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:22,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-23 01:17:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:23,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 01:17:23,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2024-11-23 01:17:23,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:17:23,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:23,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68793909] [2024-11-23 01:17:23,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68793909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:17:23,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:17:23,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 01:17:23,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017491166] [2024-11-23 01:17:23,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:23,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:17:23,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:23,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:17:23,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:17:23,743 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:23,764 INFO L93 Difference]: Finished difference Result 228 states and 257 transitions. [2024-11-23 01:17:23,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:17:23,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 145 [2024-11-23 01:17:23,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:23,766 INFO L225 Difference]: With dead ends: 228 [2024-11-23 01:17:23,766 INFO L226 Difference]: Without dead ends: 201 [2024-11-23 01:17:23,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 01:17:23,767 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:23,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 01:17:23,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-23 01:17:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-23 01:17:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 195 states have (on average 1.1282051282051282) internal successors, (220), 197 states have internal predecessors, (220), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 224 transitions. [2024-11-23 01:17:23,779 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 224 transitions. Word has length 145 [2024-11-23 01:17:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:23,779 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 224 transitions. [2024-11-23 01:17:23,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 224 transitions. [2024-11-23 01:17:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-23 01:17:23,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:23,781 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:23,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-23 01:17:23,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:23,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:23,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash 828353736, now seen corresponding path program 1 times [2024-11-23 01:17:23,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:23,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166513089] [2024-11-23 01:17:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:23,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:23,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:23,984 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:23,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-23 01:17:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:25,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 01:17:25,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-23 01:17:25,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:17:25,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:25,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166513089] [2024-11-23 01:17:25,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166513089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:17:25,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:17:25,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 01:17:25,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161404737] [2024-11-23 01:17:25,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:25,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 01:17:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:25,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 01:17:25,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-23 01:17:25,156 INFO L87 Difference]: Start difference. First operand 201 states and 224 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:25,249 INFO L93 Difference]: Finished difference Result 220 states and 247 transitions. [2024-11-23 01:17:25,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 01:17:25,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 145 [2024-11-23 01:17:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:25,252 INFO L225 Difference]: With dead ends: 220 [2024-11-23 01:17:25,252 INFO L226 Difference]: Without dead ends: 218 [2024-11-23 01:17:25,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-23 01:17:25,253 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 6 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:25,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 367 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:17:25,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-23 01:17:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2024-11-23 01:17:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 207 states have (on average 1.1304347826086956) internal successors, (234), 209 states have internal predecessors, (234), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:17:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 240 transitions. [2024-11-23 01:17:25,271 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 240 transitions. Word has length 145 [2024-11-23 01:17:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:25,272 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 240 transitions. [2024-11-23 01:17:25,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 240 transitions. [2024-11-23 01:17:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-23 01:17:25,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:25,274 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 10, 10, 10, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:25,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-23 01:17:25,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:25,475 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:25,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash -328131403, now seen corresponding path program 2 times [2024-11-23 01:17:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:25,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314352333] [2024-11-23 01:17:25,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 01:17:25,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:25,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:25,478 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:25,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-23 01:17:25,963 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 01:17:25,963 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 01:17:25,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 01:17:25,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1555 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 907 trivial. 0 not checked. [2024-11-23 01:17:26,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:17:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1555 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 907 trivial. 0 not checked. [2024-11-23 01:17:26,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:26,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314352333] [2024-11-23 01:17:26,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314352333] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-23 01:17:26,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 01:17:26,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-23 01:17:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297664303] [2024-11-23 01:17:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:26,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 01:17:26,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:26,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 01:17:26,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:17:26,453 INFO L87 Difference]: Start difference. First operand 214 states and 240 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:26,563 INFO L93 Difference]: Finished difference Result 214 states and 240 transitions. [2024-11-23 01:17:26,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 01:17:26,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 148 [2024-11-23 01:17:26,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:26,565 INFO L225 Difference]: With dead ends: 214 [2024-11-23 01:17:26,566 INFO L226 Difference]: Without dead ends: 213 [2024-11-23 01:17:26,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 01:17:26,567 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:26,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:17:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-23 01:17:26,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 179. [2024-11-23 01:17:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 173 states have (on average 1.1445086705202312) internal successors, (198), 174 states have internal predecessors, (198), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:17:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2024-11-23 01:17:26,576 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 148 [2024-11-23 01:17:26,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:26,577 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2024-11-23 01:17:26,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-23 01:17:26,577 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2024-11-23 01:17:26,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-23 01:17:26,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:26,578 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:26,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-23 01:17:26,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:26,779 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:26,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:26,779 INFO L85 PathProgramCache]: Analyzing trace with hash 269914731, now seen corresponding path program 1 times [2024-11-23 01:17:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:26,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277989121] [2024-11-23 01:17:26,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:26,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:26,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:26,781 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:26,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-23 01:17:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:28,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-23 01:17:28,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-11-23 01:17:28,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:17:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-23 01:17:28,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:28,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277989121] [2024-11-23 01:17:28,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277989121] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-23 01:17:28,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 01:17:28,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-11-23 01:17:28,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673044505] [2024-11-23 01:17:28,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:28,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 01:17:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:28,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 01:17:28,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-23 01:17:28,262 INFO L87 Difference]: Start difference. First operand 179 states and 204 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 01:17:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:28,485 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2024-11-23 01:17:28,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 01:17:28,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 162 [2024-11-23 01:17:28,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:28,488 INFO L225 Difference]: With dead ends: 187 [2024-11-23 01:17:28,488 INFO L226 Difference]: Without dead ends: 186 [2024-11-23 01:17:28,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2024-11-23 01:17:28,489 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 16 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:28,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 349 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 01:17:28,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-23 01:17:28,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2024-11-23 01:17:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.138728323699422) internal successors, (197), 173 states have internal predecessors, (197), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:17:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2024-11-23 01:17:28,500 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 162 [2024-11-23 01:17:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:28,501 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2024-11-23 01:17:28,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-23 01:17:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2024-11-23 01:17:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-23 01:17:28,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:28,503 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:28,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-23 01:17:28,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:28,703 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:28,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash -222577589, now seen corresponding path program 1 times [2024-11-23 01:17:28,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:28,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052967582] [2024-11-23 01:17:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:28,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:28,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:28,706 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:28,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-23 01:17:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:30,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-23 01:17:30,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:30,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-11-23 01:17:30,682 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 01:17:30,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 01:17:30,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-11-23 01:17:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 8 proven. 327 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-23 01:17:30,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 01:17:30,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-23 01:17:30,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-23 01:17:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-23 01:17:31,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:31,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052967582] [2024-11-23 01:17:31,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052967582] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 01:17:31,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 01:17:31,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2024-11-23 01:17:31,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554408008] [2024-11-23 01:17:31,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 01:17:31,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 01:17:31,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:31,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 01:17:31,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-23 01:17:31,070 INFO L87 Difference]: Start difference. First operand 178 states and 203 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-23 01:17:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:32,526 INFO L93 Difference]: Finished difference Result 270 states and 314 transitions. [2024-11-23 01:17:32,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 01:17:32,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 163 [2024-11-23 01:17:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:32,528 INFO L225 Difference]: With dead ends: 270 [2024-11-23 01:17:32,528 INFO L226 Difference]: Without dead ends: 212 [2024-11-23 01:17:32,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-23 01:17:32,529 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 7 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:32,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 744 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-23 01:17:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-23 01:17:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 178. [2024-11-23 01:17:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.1329479768786128) internal successors, (196), 173 states have internal predecessors, (196), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:17:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 202 transitions. [2024-11-23 01:17:32,540 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 202 transitions. Word has length 163 [2024-11-23 01:17:32,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:32,540 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 202 transitions. [2024-11-23 01:17:32,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-23 01:17:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 202 transitions. [2024-11-23 01:17:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-23 01:17:32,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:32,541 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:32,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-11-23 01:17:32,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:32,742 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-23 01:17:32,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 01:17:32,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1554467069, now seen corresponding path program 1 times [2024-11-23 01:17:32,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-23 01:17:32,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658222776] [2024-11-23 01:17:32,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 01:17:32,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 01:17:32,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-23 01:17:32,745 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 01:17:32,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-23 01:17:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 01:17:33,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-23 01:17:33,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 01:17:34,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-23 01:17:34,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-23 01:17:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-11-23 01:17:34,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 01:17:34,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-23 01:17:34,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658222776] [2024-11-23 01:17:34,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658222776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 01:17:34,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 01:17:34,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 01:17:34,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297179730] [2024-11-23 01:17:34,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 01:17:34,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 01:17:34,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-23 01:17:34,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 01:17:34,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:17:34,109 INFO L87 Difference]: Start difference. First operand 178 states and 202 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 01:17:34,493 INFO L93 Difference]: Finished difference Result 237 states and 277 transitions. [2024-11-23 01:17:34,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 01:17:34,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 169 [2024-11-23 01:17:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 01:17:34,496 INFO L225 Difference]: With dead ends: 237 [2024-11-23 01:17:34,496 INFO L226 Difference]: Without dead ends: 183 [2024-11-23 01:17:34,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 01:17:34,497 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 3 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 01:17:34,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 328 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 01:17:34,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-23 01:17:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2024-11-23 01:17:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.1306818181818181) internal successors, (199), 176 states have internal predecessors, (199), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-23 01:17:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2024-11-23 01:17:34,510 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 169 [2024-11-23 01:17:34,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 01:17:34,510 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2024-11-23 01:17:34,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-23 01:17:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2024-11-23 01:17:34,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-23 01:17:34,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-23 01:17:34,512 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 01:17:34,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0