./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-?-c7c6ca5-m [2024-11-09 14:30:09,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 14:30:09,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 14:30:09,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 14:30:09,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 14:30:09,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 14:30:09,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 14:30:09,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 14:30:09,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 14:30:09,743 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 14:30:09,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 14:30:09,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 14:30:09,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 14:30:09,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 14:30:09,748 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 14:30:09,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 14:30:09,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 14:30:09,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 14:30:09,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 14:30:09,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 14:30:09,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 14:30:09,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 14:30:09,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 14:30:09,751 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 14:30:09,752 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 14:30:09,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 14:30:09,752 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 14:30:09,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 14:30:09,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 14:30:09,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 14:30:09,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 14:30:09,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:30:09,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 14:30:09,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 14:30:09,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 14:30:09,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 14:30:09,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 14:30:09,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 14:30:09,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 14:30:09,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 14:30:09,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 14:30:09,757 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-09 14:30:10,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:30:10,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:30:10,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:30:10,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:30:10,054 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:30:10,055 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-09 14:30:11,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:30:11,922 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:30:11,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-09 14:30:11,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76766d074/6c3fc9f49cb44da5b0b3c048041261e8/FLAG2e62a0fa8 [2024-11-09 14:30:12,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76766d074/6c3fc9f49cb44da5b0b3c048041261e8 [2024-11-09 14:30:12,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:30:12,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:30:12,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:30:12,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:30:12,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:30:12,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:30:12" (1/1) ... [2024-11-09 14:30:12,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5073d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:12, skipping insertion in model container [2024-11-09 14:30:12,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:30:12" (1/1) ... [2024-11-09 14:30:12,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:30:12,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:30:12,941 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:30:13,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:30:13,175 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:30:13,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:13 WrapperNode [2024-11-09 14:30:13,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:30:13,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:30:13,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:30:13,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:30:13,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:13" (1/1) ... [2024-11-09 14:30:13,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:13" (1/1) ... [2024-11-09 14:30:13,291 INFO L138 Inliner]: procedures = 346, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 742 [2024-11-09 14:30:13,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:30:13,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:30:13,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:30:13,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:30:13,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:13" (1/1) ... [2024-11-09 14:30:13,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:13" (1/1) ... [2024-11-09 14:30:13,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:13" (1/1) ... [2024-11-09 14:30:13,360 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 12, 2, 3, 3, 3, 4, 12, 4, 4, 3, 3, 355, 2]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 0, 0, 3, 3, 3, 3, 0, 3, 3, 3, 1, 355, 0]. The 11 writes are split as follows [0, 2, 1, 0, 0, 0, 0, 5, 0, 0, 0, 1, 0, 2]. [2024-11-09 14:30:13,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:13" (1/1) ... [2024-11-09 14:30:13,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:13" (1/1) ... [2024-11-09 14:30:13,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:13" (1/1) ... [2024-11-09 14:30:13,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:13" (1/1) ... [2024-11-09 14:30:13,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:13" (1/1) ... [2024-11-09 14:30:13,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:13" (1/1) ... [2024-11-09 14:30:13,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:30:13,457 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:30:13,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:30:13,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:30:13,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:13" (1/1) ... [2024-11-09 14:30:13,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:30:13,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:13,492 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-09 14:30:13,498 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-09 14:30:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 14:30:13,544 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 14:30:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 14:30:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 14:30:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 14:30:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 14:30:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 14:30:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 14:30:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-09 14:30:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-09 14:30:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-09 14:30:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-09 14:30:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-09 14:30:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-09 14:30:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-09 14:30:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-09 14:30:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 14:30:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 14:30:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 14:30:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 14:30:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 14:30:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 14:30:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 14:30:13,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 14:30:13,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-09 14:30:13,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-09 14:30:13,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-09 14:30:13,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-09 14:30:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-09 14:30:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-09 14:30:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-09 14:30:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 14:30:13,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 14:30:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 14:30:13,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 14:30:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 14:30:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 14:30:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 14:30:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-09 14:30:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-09 14:30:13,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-09 14:30:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-09 14:30:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-09 14:30:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-09 14:30:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-09 14:30:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 14:30:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:30:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 14:30:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 14:30:13,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 14:30:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 14:30:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 14:30:13,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-09 14:30:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-09 14:30:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-09 14:30:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-09 14:30:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-09 14:30:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-09 14:30:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-09 14:30:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-09 14:30:13,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-09 14:30:13,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 14:30:13,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 14:30:13,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 14:30:13,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 14:30:13,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 14:30:13,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 14:30:13,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 14:30:13,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-09 14:30:13,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-09 14:30:13,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-09 14:30:13,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-09 14:30:13,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-09 14:30:13,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-09 14:30:13,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-09 14:30:13,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:30:13,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:30:13,930 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:30:13,932 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:30:14,579 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2024-11-09 14:30:14,579 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:30:14,597 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:30:14,599 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-09 14:30:14,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:30:14 BoogieIcfgContainer [2024-11-09 14:30:14,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:30:14,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:30:14,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:30:14,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:30:14,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:30:12" (1/3) ... [2024-11-09 14:30:14,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c13bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:30:14, skipping insertion in model container [2024-11-09 14:30:14,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:13" (2/3) ... [2024-11-09 14:30:14,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c13bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:30:14, skipping insertion in model container [2024-11-09 14:30:14,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:30:14" (3/3) ... [2024-11-09 14:30:14,610 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-2.i [2024-11-09 14:30:14,626 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:30:14,626 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-09 14:30:14,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:30:14,701 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;@1e1879f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:30:14,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-09 14:30:14,707 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-09 14:30:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 14:30:14,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:14,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 14:30:14,716 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-09 14:30:14,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:14,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-09 14:30:14,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:14,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105827289] [2024-11-09 14:30:14,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:14,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:15,311 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-09 14:30:15,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:15,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105827289] [2024-11-09 14:30:15,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105827289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:15,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:15,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:15,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859607729] [2024-11-09 14:30:15,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:15,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:15,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:15,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:15,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:15,346 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-09 14:30:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:15,403 INFO L93 Difference]: Finished difference Result 241 states and 329 transitions. [2024-11-09 14:30:15,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:15,407 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-09 14:30:15,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:15,417 INFO L225 Difference]: With dead ends: 241 [2024-11-09 14:30:15,417 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 14:30:15,422 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-09 14:30:15,426 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-09 14:30:15,429 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-09 14:30:15,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 14:30:15,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-09 14:30:15,475 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-09 14:30:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2024-11-09 14:30:15,479 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 4 [2024-11-09 14:30:15,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:15,480 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2024-11-09 14:30:15,481 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-09 14:30:15,481 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2024-11-09 14:30:15,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 14:30:15,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:15,481 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 14:30:15,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 14:30:15,482 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-09 14:30:15,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:15,484 INFO L85 PathProgramCache]: Analyzing trace with hash 556468371, now seen corresponding path program 1 times [2024-11-09 14:30:15,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:15,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818332522] [2024-11-09 14:30:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:15,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:15,703 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-09 14:30:15,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:15,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818332522] [2024-11-09 14:30:15,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818332522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:15,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526046816] [2024-11-09 14:30:15,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:15,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:15,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:15,708 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-09 14:30:15,710 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-09 14:30:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:16,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:16,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:16,125 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-09 14:30:16,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:16,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526046816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:16,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:30:16,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-09 14:30:16,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645665022] [2024-11-09 14:30:16,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:16,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:30:16,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:16,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:30:16,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:30:16,130 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-09 14:30:16,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:16,172 INFO L93 Difference]: Finished difference Result 119 states and 150 transitions. [2024-11-09 14:30:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:30:16,173 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-09 14:30:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:16,174 INFO L225 Difference]: With dead ends: 119 [2024-11-09 14:30:16,174 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 14:30:16,174 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-09 14:30:16,175 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-09 14:30:16,175 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-09 14:30:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 14:30:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 14:30:16,188 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-09 14:30:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2024-11-09 14:30:16,190 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 7 [2024-11-09 14:30:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:16,190 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2024-11-09 14:30:16,191 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-09 14:30:16,191 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2024-11-09 14:30:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 14:30:16,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:16,191 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-09 14:30:16,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:16,395 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-09 14:30:16,396 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-09 14:30:16,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:16,396 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-09 14:30:16,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:16,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750876892] [2024-11-09 14:30:16,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:16,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:16,555 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-09 14:30:16,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:16,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750876892] [2024-11-09 14:30:16,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750876892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:16,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:16,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:16,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210154457] [2024-11-09 14:30:16,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:16,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:16,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:16,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:16,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:16,558 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-09 14:30:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:16,574 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2024-11-09 14:30:16,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:16,575 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-09 14:30:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:16,576 INFO L225 Difference]: With dead ends: 118 [2024-11-09 14:30:16,576 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 14:30:16,576 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-09 14:30:16,577 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-09 14:30:16,577 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-09 14:30:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 14:30:16,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2024-11-09 14:30:16,584 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-09 14:30:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 146 transitions. [2024-11-09 14:30:16,586 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 146 transitions. Word has length 8 [2024-11-09 14:30:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:16,586 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 146 transitions. [2024-11-09 14:30:16,587 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-09 14:30:16,587 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2024-11-09 14:30:16,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 14:30:16,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:16,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:30:16,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 14:30:16,590 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-09 14:30:16,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:16,590 INFO L85 PathProgramCache]: Analyzing trace with hash -757917108, now seen corresponding path program 1 times [2024-11-09 14:30:16,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:16,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644310921] [2024-11-09 14:30:16,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:16,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:16,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 14:30:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:16,817 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-09 14:30:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:16,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644310921] [2024-11-09 14:30:16,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644310921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:16,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533435948] [2024-11-09 14:30:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:16,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:16,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:16,821 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-09 14:30:16,822 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-09 14:30:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:17,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 14:30:17,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:17,161 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-09 14:30:17,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:17,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533435948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:17,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:30:17,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 14:30:17,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622319622] [2024-11-09 14:30:17,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:17,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:17,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:17,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:17,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:30:17,171 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-09 14:30:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:17,203 INFO L93 Difference]: Finished difference Result 115 states and 146 transitions. [2024-11-09 14:30:17,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:17,205 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-09 14:30:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:17,206 INFO L225 Difference]: With dead ends: 115 [2024-11-09 14:30:17,206 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 14:30:17,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-09 14:30:17,207 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-09 14:30:17,208 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-09 14:30:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 14:30:17,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 14:30:17,219 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-09 14:30:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 144 transitions. [2024-11-09 14:30:17,221 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 144 transitions. Word has length 13 [2024-11-09 14:30:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:17,222 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 144 transitions. [2024-11-09 14:30:17,222 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-09 14:30:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2024-11-09 14:30:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 14:30:17,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:17,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:30:17,242 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-09 14:30:17,423 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-09 14:30:17,424 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-09 14:30:17,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:17,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2020593806, now seen corresponding path program 1 times [2024-11-09 14:30:17,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:17,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662595426] [2024-11-09 14:30:17,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:17,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:17,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 14:30:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:17,645 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-09 14:30:17,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:17,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662595426] [2024-11-09 14:30:17,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662595426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:17,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858196369] [2024-11-09 14:30:17,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:17,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:17,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:17,650 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-09 14:30:17,652 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-09 14:30:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:17,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:17,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:17,956 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-09 14:30:17,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:17,985 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-09 14:30:17,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858196369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:17,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:30:17,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 14:30:17,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31286530] [2024-11-09 14:30:17,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:17,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 14:30:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:17,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 14:30:17,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 14:30:17,987 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-09 14:30:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:18,030 INFO L93 Difference]: Finished difference Result 229 states and 293 transitions. [2024-11-09 14:30:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:18,031 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-09 14:30:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:18,032 INFO L225 Difference]: With dead ends: 229 [2024-11-09 14:30:18,035 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 14:30:18,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-09 14:30:18,037 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 4 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:18,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 688 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 14:30:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-09 14:30:18,044 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-09 14:30:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2024-11-09 14:30:18,045 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 14 [2024-11-09 14:30:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:18,045 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2024-11-09 14:30:18,045 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-09 14:30:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2024-11-09 14:30:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 14:30:18,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:18,048 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:30:18,068 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-09 14:30:18,248 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-09 14:30:18,249 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-09 14:30:18,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:18,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1267261696, now seen corresponding path program 2 times [2024-11-09 14:30:18,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:18,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893566378] [2024-11-09 14:30:18,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:18,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:18,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 14:30:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 14:30:18,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:18,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893566378] [2024-11-09 14:30:18,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893566378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:18,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303743494] [2024-11-09 14:30:18,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:30:18,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:18,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:18,518 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-09 14:30:18,521 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-09 14:30:18,792 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 14:30:18,792 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:30:18,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 14:30:18,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:18,882 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-09 14:30:18,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303743494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:18,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:30:18,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-09 14:30:18,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530737973] [2024-11-09 14:30:18,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:18,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 14:30:18,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:18,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 14:30:18,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 14:30:18,886 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-09 14:30:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:18,936 INFO L93 Difference]: Finished difference Result 122 states and 153 transitions. [2024-11-09 14:30:18,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:30:18,936 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-09 14:30:18,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:18,938 INFO L225 Difference]: With dead ends: 122 [2024-11-09 14:30:18,938 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 14:30:18,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 14:30:18,939 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-09 14:30:18,939 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-09 14:30:18,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 14:30:18,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 14:30:18,952 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-09 14:30:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2024-11-09 14:30:18,957 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 23 [2024-11-09 14:30:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:18,957 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2024-11-09 14:30:18,957 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-09 14:30:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2024-11-09 14:30:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 14:30:18,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:18,958 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-09 14:30:18,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:19,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:19,159 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-09 14:30:19,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:19,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1741242827, now seen corresponding path program 1 times [2024-11-09 14:30:19,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:19,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844698638] [2024-11-09 14:30:19,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:19,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:19,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 14:30:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:19,324 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-09 14:30:19,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:19,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844698638] [2024-11-09 14:30:19,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844698638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:19,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:19,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:19,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494792697] [2024-11-09 14:30:19,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:19,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:19,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:19,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:19,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:19,327 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-09 14:30:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:19,351 INFO L93 Difference]: Finished difference Result 222 states and 285 transitions. [2024-11-09 14:30:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:19,352 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-09 14:30:19,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:19,353 INFO L225 Difference]: With dead ends: 222 [2024-11-09 14:30:19,353 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 14:30:19,353 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-09 14:30:19,354 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-09 14:30:19,354 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-09 14:30:19,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 14:30:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-09 14:30:19,365 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-09 14:30:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 154 transitions. [2024-11-09 14:30:19,365 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 154 transitions. Word has length 28 [2024-11-09 14:30:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:19,366 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 154 transitions. [2024-11-09 14:30:19,366 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-09 14:30:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 154 transitions. [2024-11-09 14:30:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 14:30:19,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:19,366 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-09 14:30:19,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 14:30:19,367 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-09 14:30:19,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1249855697, now seen corresponding path program 1 times [2024-11-09 14:30:19,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:19,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682518061] [2024-11-09 14:30:19,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:19,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:19,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 14:30:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:19,560 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-09 14:30:19,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:19,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682518061] [2024-11-09 14:30:19,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682518061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:19,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214404765] [2024-11-09 14:30:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:19,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:19,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:19,563 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-09 14:30:19,564 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-09 14:30:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:19,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 14:30:19,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:19,937 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-09 14:30:19,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:20,020 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-09 14:30:20,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214404765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:20,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:30:20,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2024-11-09 14:30:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569108529] [2024-11-09 14:30:20,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:20,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 14:30:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:20,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 14:30:20,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-09 14:30:20,023 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-09 14:30:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:20,118 INFO L93 Difference]: Finished difference Result 248 states and 316 transitions. [2024-11-09 14:30:20,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 14:30:20,119 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-09 14:30:20,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:20,120 INFO L225 Difference]: With dead ends: 248 [2024-11-09 14:30:20,120 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 14:30:20,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 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-09 14:30:20,121 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 5 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:20,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 777 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:30:20,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 14:30:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-09 14:30:20,132 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-09 14:30:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 171 transitions. [2024-11-09 14:30:20,133 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 171 transitions. Word has length 31 [2024-11-09 14:30:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:20,133 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 171 transitions. [2024-11-09 14:30:20,134 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-09 14:30:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 171 transitions. [2024-11-09 14:30:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 14:30:20,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:20,135 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-09 14:30:20,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 14:30:20,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:20,340 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-09 14:30:20,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:20,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2012171647, now seen corresponding path program 1 times [2024-11-09 14:30:20,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:20,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404655333] [2024-11-09 14:30:20,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:20,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:20,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:20,561 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-09 14:30:20,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:20,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404655333] [2024-11-09 14:30:20,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404655333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:20,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:20,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:20,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445853113] [2024-11-09 14:30:20,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:20,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:20,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:20,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:20,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:20,565 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-09 14:30:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:20,585 INFO L93 Difference]: Finished difference Result 145 states and 176 transitions. [2024-11-09 14:30:20,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:20,587 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-09 14:30:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:20,588 INFO L225 Difference]: With dead ends: 145 [2024-11-09 14:30:20,588 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 14:30:20,588 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-09 14:30:20,589 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-09 14:30:20,589 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-09 14:30:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 14:30:20,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-09 14:30:20,595 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-09 14:30:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2024-11-09 14:30:20,596 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 50 [2024-11-09 14:30:20,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:20,596 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2024-11-09 14:30:20,596 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-09 14:30:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2024-11-09 14:30:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 14:30:20,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:20,598 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-09 14:30:20,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 14:30:20,598 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-09 14:30:20,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2099130704, now seen corresponding path program 1 times [2024-11-09 14:30:20,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:20,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801257248] [2024-11-09 14:30:20,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:20,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:20,860 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-09 14:30:20,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:20,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801257248] [2024-11-09 14:30:20,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801257248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:20,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:20,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:30:20,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003544298] [2024-11-09 14:30:20,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:20,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:20,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:20,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:20,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:20,862 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-09 14:30:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:20,870 INFO L93 Difference]: Finished difference Result 206 states and 257 transitions. [2024-11-09 14:30:20,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:20,871 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-09 14:30:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:20,872 INFO L225 Difference]: With dead ends: 206 [2024-11-09 14:30:20,872 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 14:30:20,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-09 14:30:20,873 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-09 14:30:20,873 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-09 14:30:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 14:30:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 14:30:20,877 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-09 14:30:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 145 transitions. [2024-11-09 14:30:20,878 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 145 transitions. Word has length 50 [2024-11-09 14:30:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:20,878 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 145 transitions. [2024-11-09 14:30:20,878 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-09 14:30:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 145 transitions. [2024-11-09 14:30:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 14:30:20,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:20,881 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-09 14:30:20,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 14:30:20,881 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-09 14:30:20,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash -856729593, now seen corresponding path program 1 times [2024-11-09 14:30:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057774483] [2024-11-09 14:30:20,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:21,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:21,068 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-09 14:30:21,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:21,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057774483] [2024-11-09 14:30:21,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057774483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:21,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:21,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:21,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276081674] [2024-11-09 14:30:21,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:21,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:21,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:21,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:21,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:21,070 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-09 14:30:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:21,096 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2024-11-09 14:30:21,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:21,097 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-09 14:30:21,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:21,098 INFO L225 Difference]: With dead ends: 133 [2024-11-09 14:30:21,098 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 14:30:21,098 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-09 14:30:21,099 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-09 14:30:21,099 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-09 14:30:21,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 14:30:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-09 14:30:21,103 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-09 14:30:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2024-11-09 14:30:21,104 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 50 [2024-11-09 14:30:21,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:21,104 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2024-11-09 14:30:21,105 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-09 14:30:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2024-11-09 14:30:21,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 14:30:21,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:21,106 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-09 14:30:21,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 14:30:21,106 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-09 14:30:21,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:21,106 INFO L85 PathProgramCache]: Analyzing trace with hash -856727864, now seen corresponding path program 1 times [2024-11-09 14:30:21,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:21,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911880896] [2024-11-09 14:30:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:21,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:21,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:21,273 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-09 14:30:21,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911880896] [2024-11-09 14:30:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911880896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:21,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:21,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:21,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377982096] [2024-11-09 14:30:21,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:21,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:21,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:21,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:21,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:21,275 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-09 14:30:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:21,293 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2024-11-09 14:30:21,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:21,297 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-09 14:30:21,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:21,298 INFO L225 Difference]: With dead ends: 130 [2024-11-09 14:30:21,298 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 14:30:21,298 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-09 14:30:21,298 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-09 14:30:21,299 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-09 14:30:21,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 14:30:21,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2024-11-09 14:30:21,304 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-09 14:30:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2024-11-09 14:30:21,305 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 50 [2024-11-09 14:30:21,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:21,307 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2024-11-09 14:30:21,307 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-09 14:30:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2024-11-09 14:30:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 14:30:21,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:21,308 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-09 14:30:21,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 14:30:21,308 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-09 14:30:21,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:21,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1371935090, now seen corresponding path program 1 times [2024-11-09 14:30:21,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:21,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522110941] [2024-11-09 14:30:21,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:21,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:21,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:21,751 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-09 14:30:21,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:21,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522110941] [2024-11-09 14:30:21,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522110941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:21,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:21,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 14:30:21,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998210150] [2024-11-09 14:30:21,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:21,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:30:21,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:21,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:30:21,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:30:21,753 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-09 14:30:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:21,831 INFO L93 Difference]: Finished difference Result 193 states and 241 transitions. [2024-11-09 14:30:21,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:21,832 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-09 14:30:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:21,833 INFO L225 Difference]: With dead ends: 193 [2024-11-09 14:30:21,833 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 14:30:21,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:30:21,834 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-09 14:30:21,834 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-09 14:30:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 14:30:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 14:30:21,840 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-09 14:30:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2024-11-09 14:30:21,841 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 52 [2024-11-09 14:30:21,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:21,841 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2024-11-09 14:30:21,841 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-09 14:30:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2024-11-09 14:30:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 14:30:21,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:21,843 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-09 14:30:21,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 14:30:21,844 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-09 14:30:21,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash -776451536, now seen corresponding path program 1 times [2024-11-09 14:30:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:21,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842999337] [2024-11-09 14:30:21,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:21,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:22,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:22,074 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-09 14:30:22,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:22,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842999337] [2024-11-09 14:30:22,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842999337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:22,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526155258] [2024-11-09 14:30:22,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:22,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:22,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:22,077 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-09 14:30:22,078 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-09 14:30:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:22,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:22,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:22,511 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-09 14:30:22,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:22,533 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-09 14:30:22,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526155258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:22,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:30:22,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 14:30:22,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171524319] [2024-11-09 14:30:22,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:22,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 14:30:22,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:22,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 14:30:22,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 14:30:22,535 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-09 14:30:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:22,571 INFO L93 Difference]: Finished difference Result 224 states and 279 transitions. [2024-11-09 14:30:22,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:22,572 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-09 14:30:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:22,573 INFO L225 Difference]: With dead ends: 224 [2024-11-09 14:30:22,573 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 14:30:22,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 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-09 14:30:22,574 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:22,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 519 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 14:30:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-09 14:30:22,579 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-09 14:30:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 169 transitions. [2024-11-09 14:30:22,580 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 169 transitions. Word has length 58 [2024-11-09 14:30:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:22,580 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 169 transitions. [2024-11-09 14:30:22,580 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-09 14:30:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 169 transitions. [2024-11-09 14:30:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 14:30:22,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:22,581 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-09 14:30:22,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:22,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:22,782 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-09 14:30:22,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:22,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2094163647, now seen corresponding path program 1 times [2024-11-09 14:30:22,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:22,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26580532] [2024-11-09 14:30:22,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:22,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:23,093 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-09 14:30:23,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:23,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26580532] [2024-11-09 14:30:23,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26580532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:23,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646157935] [2024-11-09 14:30:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:23,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:23,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:23,096 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-09 14:30:23,098 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-09 14:30:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:23,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 1296 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 14:30:23,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:23,554 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-09 14:30:23,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:23,636 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-09 14:30:23,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646157935] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:23,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:30:23,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 14:30:23,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840877306] [2024-11-09 14:30:23,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:23,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 14:30:23,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:23,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 14:30:23,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 14:30:23,638 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-09 14:30:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:23,694 INFO L93 Difference]: Finished difference Result 269 states and 330 transitions. [2024-11-09 14:30:23,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 14:30:23,695 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-09 14:30:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:23,696 INFO L225 Difference]: With dead ends: 269 [2024-11-09 14:30:23,696 INFO L226 Difference]: Without dead ends: 179 [2024-11-09 14:30:23,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 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-09 14:30:23,697 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:23,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:23,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-09 14:30:23,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-09 14:30:23,703 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-09 14:30:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 205 transitions. [2024-11-09 14:30:23,704 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 205 transitions. Word has length 69 [2024-11-09 14:30:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:23,704 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 205 transitions. [2024-11-09 14:30:23,704 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-09 14:30:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 205 transitions. [2024-11-09 14:30:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 14:30:23,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:23,705 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-09 14:30:23,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:23,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:23,910 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-09 14:30:23,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:23,910 INFO L85 PathProgramCache]: Analyzing trace with hash 89302591, now seen corresponding path program 2 times [2024-11-09 14:30:23,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:23,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716428424] [2024-11-09 14:30:23,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:23,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:24,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:24,282 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-09 14:30:24,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:24,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716428424] [2024-11-09 14:30:24,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716428424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:24,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122737676] [2024-11-09 14:30:24,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:30:24,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:24,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:24,285 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-09 14:30:24,286 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-09 14:30:24,653 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 14:30:24,654 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:30:24,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 14:30:24,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:24,869 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-09 14:30:24,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:24,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122737676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:24,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:30:24,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-09 14:30:24,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062542136] [2024-11-09 14:30:24,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:24,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:30:24,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:24,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:30:24,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 14:30:24,871 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-09 14:30:24,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:24,944 INFO L93 Difference]: Finished difference Result 181 states and 208 transitions. [2024-11-09 14:30:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:24,945 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-09 14:30:24,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:24,946 INFO L225 Difference]: With dead ends: 181 [2024-11-09 14:30:24,946 INFO L226 Difference]: Without dead ends: 180 [2024-11-09 14:30:24,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 14:30:24,947 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 89 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-09 14:30:24,947 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-09 14:30:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-09 14:30:24,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2024-11-09 14:30:24,954 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-09 14:30:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 204 transitions. [2024-11-09 14:30:24,955 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 204 transitions. Word has length 87 [2024-11-09 14:30:24,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:24,955 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 204 transitions. [2024-11-09 14:30:24,955 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-09 14:30:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 204 transitions. [2024-11-09 14:30:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 14:30:24,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:24,956 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-09 14:30:24,976 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-09 14:30:25,157 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,SelfDestructingSolverStorable15 [2024-11-09 14:30:25,157 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-09 14:30:25,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:25,158 INFO L85 PathProgramCache]: Analyzing trace with hash -853525022, now seen corresponding path program 1 times [2024-11-09 14:30:25,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:25,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123439336] [2024-11-09 14:30:25,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:25,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:25,410 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-09 14:30:25,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:25,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123439336] [2024-11-09 14:30:25,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123439336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:25,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778805877] [2024-11-09 14:30:25,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:25,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:25,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:25,413 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-09 14:30:25,415 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-09 14:30:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:25,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:25,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:25,905 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-09 14:30:25,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:25,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778805877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:25,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:30:25,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-09 14:30:25,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483700626] [2024-11-09 14:30:25,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:25,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:30:25,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:25,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:30:25,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:30:25,906 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-09 14:30:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:25,934 INFO L93 Difference]: Finished difference Result 178 states and 204 transitions. [2024-11-09 14:30:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:30:25,935 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-09 14:30:25,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:25,936 INFO L225 Difference]: With dead ends: 178 [2024-11-09 14:30:25,936 INFO L226 Difference]: Without dead ends: 177 [2024-11-09 14:30:25,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 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-09 14:30:25,937 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-09 14:30:25,937 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-09 14:30:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-09 14:30:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-09 14:30:25,944 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-09 14:30:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2024-11-09 14:30:25,945 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 88 [2024-11-09 14:30:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:25,945 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2024-11-09 14:30:25,946 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-09 14:30:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2024-11-09 14:30:25,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 14:30:25,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:25,946 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-09 14:30:25,968 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-09 14:30:26,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 14:30:26,147 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-09 14:30:26,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:26,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1526586787, now seen corresponding path program 1 times [2024-11-09 14:30:26,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:26,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733341118] [2024-11-09 14:30:26,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:26,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:26,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:26,541 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-09 14:30:26,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:26,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733341118] [2024-11-09 14:30:26,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733341118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:26,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:26,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:30:26,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858123706] [2024-11-09 14:30:26,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:26,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:30:26,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:26,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:30:26,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:30:26,544 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-09 14:30:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:26,580 INFO L93 Difference]: Finished difference Result 177 states and 203 transitions. [2024-11-09 14:30:26,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:30:26,581 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-09 14:30:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:26,582 INFO L225 Difference]: With dead ends: 177 [2024-11-09 14:30:26,582 INFO L226 Difference]: Without dead ends: 176 [2024-11-09 14:30:26,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-09 14:30:26,583 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-09 14:30:26,583 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-09 14:30:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-09 14:30:26,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-09 14:30:26,589 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-09 14:30:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 202 transitions. [2024-11-09 14:30:26,590 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 202 transitions. Word has length 88 [2024-11-09 14:30:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:26,590 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 202 transitions. [2024-11-09 14:30:26,590 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-09 14:30:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 202 transitions. [2024-11-09 14:30:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 14:30:26,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:26,591 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-09 14:30:26,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 14:30:26,591 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-09 14:30:26,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:26,592 INFO L85 PathProgramCache]: Analyzing trace with hash -689471541, now seen corresponding path program 1 times [2024-11-09 14:30:26,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:26,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774469919] [2024-11-09 14:30:26,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:26,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:26,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:26,869 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-09 14:30:26,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:26,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774469919] [2024-11-09 14:30:26,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774469919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:26,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143373998] [2024-11-09 14:30:26,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:26,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:26,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:26,872 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-09 14:30:26,873 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-09 14:30:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:27,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:27,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:27,409 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-09 14:30:27,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:27,428 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-09 14:30:27,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143373998] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:27,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:30:27,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-09 14:30:27,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921932867] [2024-11-09 14:30:27,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:27,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 14:30:27,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:27,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 14:30:27,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 14:30:27,430 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-09 14:30:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:27,461 INFO L93 Difference]: Finished difference Result 186 states and 214 transitions. [2024-11-09 14:30:27,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:27,461 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-09 14:30:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:27,462 INFO L225 Difference]: With dead ends: 186 [2024-11-09 14:30:27,462 INFO L226 Difference]: Without dead ends: 185 [2024-11-09 14:30:27,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 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-09 14:30:27,463 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:27,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:27,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-09 14:30:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-09 14:30:27,469 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-09 14:30:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 211 transitions. [2024-11-09 14:30:27,470 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 211 transitions. Word has length 89 [2024-11-09 14:30:27,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:27,471 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 211 transitions. [2024-11-09 14:30:27,471 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-09 14:30:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 211 transitions. [2024-11-09 14:30:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 14:30:27,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:27,472 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-09 14:30:27,494 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-09 14:30:27,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:27,673 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-09 14:30:27,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:27,673 INFO L85 PathProgramCache]: Analyzing trace with hash -703292001, now seen corresponding path program 2 times [2024-11-09 14:30:27,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:27,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200561652] [2024-11-09 14:30:27,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:27,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:27,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:27,995 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-09 14:30:27,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:27,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200561652] [2024-11-09 14:30:27,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200561652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:27,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042212455] [2024-11-09 14:30:27,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:30:27,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:27,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:27,998 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-09 14:30:27,999 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-09 14:30:28,450 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 14:30:28,451 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:30:28,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:28,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:28,525 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-09 14:30:28,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:28,611 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-09 14:30:28,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042212455] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:28,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:30:28,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-09 14:30:28,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886920139] [2024-11-09 14:30:28,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:28,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:30:28,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:28,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:30:28,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:30:28,613 INFO L87 Difference]: Start difference. First operand 185 states and 211 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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-09 14:30:28,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:28,663 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2024-11-09 14:30:28,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:28,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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 98 [2024-11-09 14:30:28,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:28,665 INFO L225 Difference]: With dead ends: 185 [2024-11-09 14:30:28,665 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 14:30:28,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 14:30:28,665 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 73 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:28,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 304 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:28,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 14:30:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-09 14:30:28,671 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-09 14:30:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2024-11-09 14:30:28,672 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 98 [2024-11-09 14:30:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:28,672 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2024-11-09 14:30:28,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 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-09 14:30:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2024-11-09 14:30:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 14:30:28,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:28,675 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-09 14:30:28,696 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-09 14:30:28,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:28,875 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-09 14:30:28,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:28,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1799807557, now seen corresponding path program 1 times [2024-11-09 14:30:28,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816940570] [2024-11-09 14:30:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:29,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:29,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 14:30:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:29,148 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-09 14:30:29,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:29,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816940570] [2024-11-09 14:30:29,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816940570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:29,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:29,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:30:29,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964068328] [2024-11-09 14:30:29,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:29,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:30:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:29,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:30:29,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 14:30:29,150 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-09 14:30:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:29,173 INFO L93 Difference]: Finished difference Result 178 states and 204 transitions. [2024-11-09 14:30:29,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:30:29,173 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-09 14:30:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:29,175 INFO L225 Difference]: With dead ends: 178 [2024-11-09 14:30:29,175 INFO L226 Difference]: Without dead ends: 177 [2024-11-09 14:30:29,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-09 14:30:29,175 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:29,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 268 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:29,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-09 14:30:29,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2024-11-09 14:30:29,181 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-09 14:30:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2024-11-09 14:30:29,182 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 201 transitions. Word has length 110 [2024-11-09 14:30:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:29,183 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 201 transitions. [2024-11-09 14:30:29,183 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-09 14:30:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 201 transitions. [2024-11-09 14:30:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 14:30:29,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:29,184 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-09 14:30:29,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 14:30:29,185 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-09 14:30:29,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash 40540923, now seen corresponding path program 1 times [2024-11-09 14:30:29,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:29,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671563174] [2024-11-09 14:30:29,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:29,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:29,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:29,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 14:30:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:29,498 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-09 14:30:29,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:29,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671563174] [2024-11-09 14:30:29,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671563174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:29,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:29,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 14:30:29,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919880135] [2024-11-09 14:30:29,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:29,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 14:30:29,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:29,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 14:30:29,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:30:29,501 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-09 14:30:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:29,528 INFO L93 Difference]: Finished difference Result 212 states and 243 transitions. [2024-11-09 14:30:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:30:29,529 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-09 14:30:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:29,530 INFO L225 Difference]: With dead ends: 212 [2024-11-09 14:30:29,530 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 14:30:29,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-09 14:30:29,531 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-09 14:30:29,531 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-09 14:30:29,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 14:30:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2024-11-09 14:30:29,538 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-09 14:30:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2024-11-09 14:30:29,539 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 111 [2024-11-09 14:30:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:29,539 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2024-11-09 14:30:29,540 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-09 14:30:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2024-11-09 14:30:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 14:30:29,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:29,541 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-09 14:30:29,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 14:30:29,541 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-09 14:30:29,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:29,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1815548285, now seen corresponding path program 1 times [2024-11-09 14:30:29,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:29,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185189238] [2024-11-09 14:30:29,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:29,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:29,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:29,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 14:30:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:29,945 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-09 14:30:29,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:29,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185189238] [2024-11-09 14:30:29,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185189238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:29,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:29,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 14:30:29,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877988880] [2024-11-09 14:30:29,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:29,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 14:30:29,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:29,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 14:30:29,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 14:30:29,948 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-09 14:30:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:30,030 INFO L93 Difference]: Finished difference Result 184 states and 210 transitions. [2024-11-09 14:30:30,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 14:30:30,030 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-09 14:30:30,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:30,031 INFO L225 Difference]: With dead ends: 184 [2024-11-09 14:30:30,032 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 14:30:30,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-09 14:30:30,032 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 4 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:30,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 277 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:30:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 14:30:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2024-11-09 14:30:30,039 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-09 14:30:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2024-11-09 14:30:30,040 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 111 [2024-11-09 14:30:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:30,040 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2024-11-09 14:30:30,040 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-09 14:30:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2024-11-09 14:30:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 14:30:30,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:30,042 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-09 14:30:30,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 14:30:30,042 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-09 14:30:30,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:30,042 INFO L85 PathProgramCache]: Analyzing trace with hash 955738558, now seen corresponding path program 2 times [2024-11-09 14:30:30,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:30,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244386229] [2024-11-09 14:30:30,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:30,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:30,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:30,380 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-09 14:30:30,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:30,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244386229] [2024-11-09 14:30:30,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244386229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:30,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017337019] [2024-11-09 14:30:30,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:30:30,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:30,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:30,384 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-09 14:30:30,385 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-09 14:30:31,194 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 14:30:31,195 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:30:31,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 1680 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:31,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:31,298 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-09 14:30:31,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:31,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017337019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:31,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:30:31,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-09 14:30:31,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331634335] [2024-11-09 14:30:31,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:31,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:30:31,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:31,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:30:31,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:30:31,302 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-09 14:30:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:31,344 INFO L93 Difference]: Finished difference Result 179 states and 204 transitions. [2024-11-09 14:30:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:30:31,345 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-09 14:30:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:31,346 INFO L225 Difference]: With dead ends: 179 [2024-11-09 14:30:31,346 INFO L226 Difference]: Without dead ends: 178 [2024-11-09 14:30:31,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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-09 14:30:31,348 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:31,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 177 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:31,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-09 14:30:31,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-09 14:30:31,359 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-09 14:30:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2024-11-09 14:30:31,360 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 112 [2024-11-09 14:30:31,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:31,360 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2024-11-09 14:30:31,360 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-09 14:30:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2024-11-09 14:30:31,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 14:30:31,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:31,362 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-09 14:30:31,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 14:30:31,562 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,SelfDestructingSolverStorable23 [2024-11-09 14:30:31,563 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-09 14:30:31,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:31,563 INFO L85 PathProgramCache]: Analyzing trace with hash -436875678, now seen corresponding path program 1 times [2024-11-09 14:30:31,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:31,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323911590] [2024-11-09 14:30:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:31,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:31,967 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-09 14:30:31,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:31,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323911590] [2024-11-09 14:30:31,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323911590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:31,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934830245] [2024-11-09 14:30:31,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:31,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:31,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:31,971 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-09 14:30:31,972 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-09 14:30:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:32,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:32,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:32,770 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-09 14:30:32,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:32,860 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-09 14:30:32,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934830245] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:32,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:30:32,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-09 14:30:32,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140472182] [2024-11-09 14:30:32,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:32,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 14:30:32,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:32,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 14:30:32,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 14:30:32,863 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-09 14:30:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:32,923 INFO L93 Difference]: Finished difference Result 284 states and 317 transitions. [2024-11-09 14:30:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:32,924 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-09 14:30:32,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:32,926 INFO L225 Difference]: With dead ends: 284 [2024-11-09 14:30:32,926 INFO L226 Difference]: Without dead ends: 283 [2024-11-09 14:30:32,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 224 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-09 14:30:32,926 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:32,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 14:30:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-09 14:30:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-09 14:30:32,937 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-09 14:30:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 314 transitions. [2024-11-09 14:30:32,938 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 314 transitions. Word has length 113 [2024-11-09 14:30:32,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:32,939 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 314 transitions. [2024-11-09 14:30:32,939 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-09 14:30:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 314 transitions. [2024-11-09 14:30:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 14:30:32,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:32,940 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-09 14:30:32,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-09 14:30:33,141 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,SelfDestructingSolverStorable24 [2024-11-09 14:30:33,141 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-09 14:30:33,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:33,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1482164134, now seen corresponding path program 1 times [2024-11-09 14:30:33,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:33,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051824512] [2024-11-09 14:30:33,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:33,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:33,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:33,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 14:30:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:33,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 14:30:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:33,473 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-09 14:30:33,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:33,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051824512] [2024-11-09 14:30:33,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051824512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:33,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256627462] [2024-11-09 14:30:33,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:33,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:33,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:33,477 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-09 14:30:33,478 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-09 14:30:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:34,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 1687 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 14:30:34,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:34,143 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-09 14:30:34,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:34,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256627462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:34,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:30:34,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 14:30:34,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737601780] [2024-11-09 14:30:34,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:34,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 14:30:34,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:34,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 14:30:34,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 14:30:34,146 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-09 14:30:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:34,173 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2024-11-09 14:30:34,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 14:30:34,173 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-09 14:30:34,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:34,175 INFO L225 Difference]: With dead ends: 283 [2024-11-09 14:30:34,176 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 14:30:34,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 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-09 14:30:34,177 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-09 14:30:34,178 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-09 14:30:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 14:30:34,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-09 14:30:34,188 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-09 14:30:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 313 transitions. [2024-11-09 14:30:34,190 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 313 transitions. Word has length 127 [2024-11-09 14:30:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:34,190 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 313 transitions. [2024-11-09 14:30:34,190 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-09 14:30:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 313 transitions. [2024-11-09 14:30:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 14:30:34,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:34,192 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-09 14:30:34,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 14:30:34,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:34,392 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-09 14:30:34,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:34,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1297552444, now seen corresponding path program 1 times [2024-11-09 14:30:34,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:34,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632283328] [2024-11-09 14:30:34,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:34,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:34,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:34,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 14:30:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:34,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 14:30:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:34,700 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-09 14:30:34,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:34,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632283328] [2024-11-09 14:30:34,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632283328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:34,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:34,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:30:34,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207569542] [2024-11-09 14:30:34,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:34,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:34,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:34,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:34,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:34,704 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-09 14:30:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:34,720 INFO L93 Difference]: Finished difference Result 322 states and 362 transitions. [2024-11-09 14:30:34,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:34,720 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-09 14:30:34,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:34,722 INFO L225 Difference]: With dead ends: 322 [2024-11-09 14:30:34,722 INFO L226 Difference]: Without dead ends: 283 [2024-11-09 14:30:34,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-09 14:30:34,722 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-09 14:30:34,723 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-09 14:30:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-09 14:30:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-09 14:30:34,733 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-09 14:30:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 314 transitions. [2024-11-09 14:30:34,734 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 314 transitions. Word has length 128 [2024-11-09 14:30:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:34,734 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 314 transitions. [2024-11-09 14:30:34,735 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-09 14:30:34,735 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 314 transitions. [2024-11-09 14:30:34,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 14:30:34,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:34,736 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-09 14:30:34,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 14:30:34,736 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-09 14:30:34,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1968055554, now seen corresponding path program 1 times [2024-11-09 14:30:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:34,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601858372] [2024-11-09 14:30:34,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:34,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:35,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 14:30:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:35,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 14:30:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:35,323 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-09 14:30:35,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:35,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601858372] [2024-11-09 14:30:35,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601858372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:35,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822159767] [2024-11-09 14:30:35,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:35,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:35,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:35,326 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-09 14:30:35,329 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-09 14:30:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:35,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 1687 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 14:30:35,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:36,112 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-09 14:30:36,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:36,373 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-09 14:30:36,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822159767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:36,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:30:36,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-09 14:30:36,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232109570] [2024-11-09 14:30:36,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:36,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 14:30:36,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:36,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 14:30:36,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-09 14:30:36,375 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-09 14:30:36,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:36,515 INFO L93 Difference]: Finished difference Result 353 states and 404 transitions. [2024-11-09 14:30:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 14:30:36,515 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-09 14:30:36,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:36,517 INFO L225 Difference]: With dead ends: 353 [2024-11-09 14:30:36,517 INFO L226 Difference]: Without dead ends: 283 [2024-11-09 14:30:36,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 256 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-09 14:30:36,517 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 71 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:36,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 566 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:30:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-09 14:30:36,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-11-09 14:30:36,535 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-09 14:30:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 313 transitions. [2024-11-09 14:30:36,536 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 313 transitions. Word has length 128 [2024-11-09 14:30:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:36,536 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 313 transitions. [2024-11-09 14:30:36,537 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-09 14:30:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 313 transitions. [2024-11-09 14:30:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 14:30:36,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:36,538 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-09 14:30:36,561 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-09 14:30:36,738 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,SelfDestructingSolverStorable27 [2024-11-09 14:30:36,739 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-09 14:30:36,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:36,739 INFO L85 PathProgramCache]: Analyzing trace with hash -222577589, now seen corresponding path program 2 times [2024-11-09 14:30:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:36,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217930399] [2024-11-09 14:30:36,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:36,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:38,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:38,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 14:30:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:38,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 14:30:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:38,877 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-09 14:30:38,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:38,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217930399] [2024-11-09 14:30:38,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217930399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:38,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398966591] [2024-11-09 14:30:38,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:30:38,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:38,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:38,879 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-09 14:30:38,881 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-09 14:30:39,629 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 14:30:39,629 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:30:39,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 14:30:39,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:39,727 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-09 14:30:39,795 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-09 14:30:39,806 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-09 14:30:39,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:39,883 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-09 14:30:39,888 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-09 14:30:39,937 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-09 14:30:39,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398966591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:39,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:30:39,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2024-11-09 14:30:39,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680458332] [2024-11-09 14:30:39,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:39,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 14:30:39,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:39,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 14:30:39,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 14:30:39,940 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-09 14:30:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:40,119 INFO L93 Difference]: Finished difference Result 348 states and 399 transitions. [2024-11-09 14:30:40,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 14:30:40,119 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-09 14:30:40,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:40,121 INFO L225 Difference]: With dead ends: 348 [2024-11-09 14:30:40,121 INFO L226 Difference]: Without dead ends: 290 [2024-11-09 14:30:40,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 328 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-09 14:30:40,122 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 19 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:40,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 719 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 14:30:40,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-09 14:30:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 286. [2024-11-09 14:30:40,143 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-09 14:30:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2024-11-09 14:30:40,145 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 163 [2024-11-09 14:30:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:40,145 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2024-11-09 14:30:40,145 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-09 14:30:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2024-11-09 14:30:40,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-09 14:30:40,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:40,147 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-09 14:30:40,170 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-09 14:30:40,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 14:30:40,348 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-09 14:30:40,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:40,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1166437475, now seen corresponding path program 1 times [2024-11-09 14:30:40,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:40,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557306304] [2024-11-09 14:30:40,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:40,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:42,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 14:30:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:42,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-09 14:30:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:42,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 14:30:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:42,372 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-09 14:30:42,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 14:30:42,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557306304] [2024-11-09 14:30:42,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557306304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 14:30:42,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510231400] [2024-11-09 14:30:42,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:42,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:42,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:42,375 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 14:30:42,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 14:30:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:43,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 1994 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 14:30:43,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:43,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 14:30:43,379 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-09 14:30:43,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:43,473 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 14 [2024-11-09 14:30:43,476 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 16 treesize of output 12 [2024-11-09 14:30:43,522 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-09 14:30:43,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510231400] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:43,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 14:30:43,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 16 [2024-11-09 14:30:43,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412640252] [2024-11-09 14:30:43,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:43,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 14:30:43,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 14:30:43,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 14:30:43,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 14:30:43,525 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 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-09 14:30:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:43,770 INFO L93 Difference]: Finished difference Result 355 states and 405 transitions. [2024-11-09 14:30:43,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 14:30:43,771 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 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-09 14:30:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:43,773 INFO L225 Difference]: With dead ends: 355 [2024-11-09 14:30:43,773 INFO L226 Difference]: Without dead ends: 308 [2024-11-09 14:30:43,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-09 14:30:43,774 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 42 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:43,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1053 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 14:30:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-09 14:30:43,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 290. [2024-11-09 14:30:43,794 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-09 14:30:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 321 transitions. [2024-11-09 14:30:43,795 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 321 transitions. Word has length 170 [2024-11-09 14:30:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:43,796 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 321 transitions. [2024-11-09 14:30:43,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 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-09 14:30:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 321 transitions. [2024-11-09 14:30:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-09 14:30:43,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:43,798 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-09 14:30:43,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:43,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 14:30:43,998 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-09 14:30:43,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:43,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1013270911, now seen corresponding path program 1 times [2024-11-09 14:30:43,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 14:30:43,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173356092] [2024-11-09 14:30:43,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:44,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 14:30:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:30:44,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 14:30:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 14:30:45,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 14:30:45,034 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 14:30:45,035 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2024-11-09 14:30:45,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2024-11-09 14:30:45,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2024-11-09 14:30:45,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2024-11-09 14:30:45,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2024-11-09 14:30:45,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2024-11-09 14:30:45,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2024-11-09 14:30:45,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2024-11-09 14:30:45,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2024-11-09 14:30:45,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2024-11-09 14:30:45,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2024-11-09 14:30:45,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2024-11-09 14:30:45,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2024-11-09 14:30:45,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2024-11-09 14:30:45,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2024-11-09 14:30:45,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2024-11-09 14:30:45,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2024-11-09 14:30:45,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2024-11-09 14:30:45,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2024-11-09 14:30:45,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2024-11-09 14:30:45,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2024-11-09 14:30:45,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2024-11-09 14:30:45,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2024-11-09 14:30:45,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2024-11-09 14:30:45,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 14:30:45,044 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-09 14:30:45,182 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 14:30:45,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:30:45 BoogieIcfgContainer [2024-11-09 14:30:45,185 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 14:30:45,185 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 14:30:45,185 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 14:30:45,186 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 14:30:45,186 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:30:14" (3/4) ... [2024-11-09 14:30:45,188 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 14:30:45,189 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 14:30:45,192 INFO L158 Benchmark]: Toolchain (without parser) took 32989.23ms. Allocated memory was 155.2MB in the beginning and 855.6MB in the end (delta: 700.4MB). Free memory was 116.3MB in the beginning and 506.1MB in the end (delta: -389.8MB). Peak memory consumption was 309.2MB. Max. memory is 16.1GB. [2024-11-09 14:30:45,192 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory was 122.4MB in the beginning and 122.3MB in the end (delta: 87.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:30:45,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 974.84ms. Allocated memory is still 155.2MB. Free memory was 116.3MB in the beginning and 114.9MB in the end (delta: 1.4MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2024-11-09 14:30:45,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.19ms. Allocated memory is still 155.2MB. Free memory was 114.9MB in the beginning and 107.7MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 14:30:45,193 INFO L158 Benchmark]: Boogie Preprocessor took 164.76ms. Allocated memory is still 155.2MB. Free memory was 107.7MB in the beginning and 98.0MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 14:30:45,193 INFO L158 Benchmark]: RCFGBuilder took 1142.62ms. Allocated memory was 155.2MB in the beginning and 199.2MB in the end (delta: 44.0MB). Free memory was 98.0MB in the beginning and 126.4MB in the end (delta: -28.4MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2024-11-09 14:30:45,193 INFO L158 Benchmark]: TraceAbstraction took 30582.76ms. Allocated memory was 199.2MB in the beginning and 855.6MB in the end (delta: 656.4MB). Free memory was 125.1MB in the beginning and 506.1MB in the end (delta: -380.9MB). Peak memory consumption was 274.4MB. Max. memory is 16.1GB. [2024-11-09 14:30:45,193 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 855.6MB. Free memory is still 506.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 14:30:45,194 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.21ms. Allocated memory is still 155.2MB. Free memory was 122.4MB in the beginning and 122.3MB in the end (delta: 87.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 974.84ms. Allocated memory is still 155.2MB. Free memory was 116.3MB in the beginning and 114.9MB in the end (delta: 1.4MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.19ms. Allocated memory is still 155.2MB. Free memory was 114.9MB in the beginning and 107.7MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 164.76ms. Allocated memory is still 155.2MB. Free memory was 107.7MB in the beginning and 98.0MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1142.62ms. Allocated memory was 155.2MB in the beginning and 199.2MB in the end (delta: 44.0MB). Free memory was 98.0MB in the beginning and 126.4MB in the end (delta: -28.4MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * TraceAbstraction took 30582.76ms. Allocated memory was 199.2MB in the beginning and 855.6MB in the end (delta: 656.4MB). Free memory was 125.1MB in the beginning and 506.1MB in the end (delta: -380.9MB). Peak memory consumption was 274.4MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 855.6MB. Free memory is still 506.1MB. There was no memory consumed. 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={-2: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={-2: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={-2: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={-2: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={-2: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={-2: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={-2: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={-2: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={-2: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={-2: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={-2: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={-2: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={-2: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={-2: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={-2: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={-2:0}, argc=2, argv={-14:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=0, mem_track={-15: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={-2: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={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, c=47, dummy_utmp={11:0}, optind=1, s={-27:0}] [L1444] RET, EXPR last_char_is(path, 47) [L1444] slash=last_char_is(path, 47) [L1445] char *tmp_post$1; VAL [applet_name={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-27:0}, slash={0:0}] [L1446] COND FALSE !(!(slash == ((char *)((void *)0)))) VAL [applet_name={-2: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={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-27:0}] [L1424] slash=strrchr(path, 47) [L1425] _Bool tmp_if_expr$2; [L1426] _Bool tmp_if_expr$1; VAL [applet_name={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-27:0}, slash={0:0}] [L1427] COND TRUE slash == ((char *)((void *)0)) [L1428] tmp_if_expr$2 = 1 != 0 VAL [applet_name={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-27:0}, slash={0:0}, tmp_if_expr$2=1] [L1437] COND TRUE !(tmp_if_expr$2 == (_Bool)0) [L1438] return (char *)path; VAL [\result={-27:0}, applet_name={-2: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={-27:0}, applet_name={-2: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={-2: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={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, dummy_utmp={11:0}, fd=1, len=(((unsigned __int128) 1 << 64) | 9223372036854775808U), 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={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, count=(((unsigned __int128) 1 << 64) | 9223372036854775808U), 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={-2: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={-2: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={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=(((unsigned __int128) 1 << 64) | 9223372036854775808U), optind=1, ret=2] [L1571] return ret; VAL [\result=2, applet_name={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=(((unsigned __int128) 1 << 64) | 9223372036854775808U), 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={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, count=(((unsigned __int128) 1 << 64) | 9223372036854775808U), 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={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, count=(((unsigned __int128) 1 << 64) | 9223372036854775808U), dummy_utmp={11:0}, fd=1, n=2, optind=1] [L1510] return n; VAL [\result=2, applet_name={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, count=(((unsigned __int128) 1 << 64) | 9223372036854775808U), 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={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:0}, cc=2, dummy_utmp={11:0}, fd=1, len=(((unsigned __int128) 1 << 64) | 9223372036854775808U), optind=1, total=0] [L1475] EXPR total + cc [L1475] total = total + cc [L1476] buf = (const void *)((const char *)buf + cc) VAL [applet_name={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, cc=2, dummy_utmp={11:0}, fd=1, len=(((unsigned __int128) 1 << 64) | 9223372036854775808U), optind=1, total=2] [L1466] len = len - (unsigned long int)cc VAL [applet_name={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, dummy_utmp={11:0}, fd=1, len=(((unsigned __int128) 1 << 64) | 9223372036854775806), 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={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, count=(((unsigned __int128) 1 << 64) | 9223372036854775806), 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={-2: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={-2: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={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=(((unsigned __int128) 1 << 64) | 9223372036854775806), optind=1, ret=9223372036854775806] [L1571] return ret; VAL [\result=9223372036854775806, applet_name={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=(((unsigned __int128) 1 << 64) | 9223372036854775806), 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={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, count=(((unsigned __int128) 1 << 64) | 9223372036854775806), 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={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, count=(((unsigned __int128) 1 << 64) | 9223372036854775806), dummy_utmp={11:0}, fd=1, n=9223372036854775806, optind=1] [L1510] return n; VAL [\result=9223372036854775806, applet_name={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, count=(((unsigned __int128) 1 << 64) | 9223372036854775806), 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={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, cc=9223372036854775806, dummy_utmp={11:0}, fd=1, len=(((unsigned __int128) 1 << 64) | 9223372036854775806), optind=1, total=2] [L1475] total + cc VAL [applet_name={-2:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-27:2}, dummy_utmp={11:0}, fd=1, len=(((unsigned __int128) 1 << 64) | 9223372036854775806), 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.4s, OverallIterations: 31, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 782 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 774 mSDsluCounter, 10904 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7631 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1209 IncrementalHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 3273 mSDtfsCounter, 1209 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2513 GetRequests, 2363 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=30, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 44 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 3790 NumberOfCodeBlocks, 3636 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 4496 ConstructedInterpolants, 0 QuantifiedInterpolants, 10833 SizeOfPredicates, 24 NumberOfNonLiveVariables, 22745 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 57 InterpolantComputations, 20 PerfectInterpolantSequences, 12988/16442 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-09 14:30:45,237 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/11.0.12-open/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-?-c7c6ca5-m [2024-11-09 14:30:47,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 14:30:47,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-09 14:30:47,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 14:30:47,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 14:30:47,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-09 14:30:47,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 14:30:47,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 14:30:47,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 14:30:47,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 14:30:47,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 14:30:47,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 14:30:47,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 14:30:47,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 14:30:47,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 14:30:47,545 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 14:30:47,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 14:30:47,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 14:30:47,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 14:30:47,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 14:30:47,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 14:30:47,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 14:30:47,550 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 14:30:47,551 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 14:30:47,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 14:30:47,551 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 14:30:47,551 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 14:30:47,552 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 14:30:47,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 14:30:47,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 14:30:47,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 14:30:47,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 14:30:47,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 14:30:47,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 14:30:47,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:30:47,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 14:30:47,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 14:30:47,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 14:30:47,557 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 14:30:47,557 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 14:30:47,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 14:30:47,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 14:30:47,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 14:30:47,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 14:30:47,560 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-09 14:30:47,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 14:30:47,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 14:30:47,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 14:30:47,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 14:30:47,928 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 14:30:47,929 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-09 14:30:49,445 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 14:30:49,779 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 14:30:49,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2024-11-09 14:30:49,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ca00a47/8225c89f03e0438182e706267f8dd446/FLAG100e26bc9 [2024-11-09 14:30:49,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ca00a47/8225c89f03e0438182e706267f8dd446 [2024-11-09 14:30:49,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 14:30:49,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 14:30:49,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 14:30:49,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 14:30:49,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 14:30:49,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:30:49" (1/1) ... [2024-11-09 14:30:49,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b235745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:49, skipping insertion in model container [2024-11-09 14:30:49,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:30:49" (1/1) ... [2024-11-09 14:30:49,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 14:30:50,378 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-09 14:30:50,395 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-09 14:30:50,398 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-09 14:30:50,401 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-09 14:30:50,404 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-09 14:30:50,409 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-09 14:30:50,409 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-09 14:30:50,410 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-09 14:30:50,411 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-09 14:30:50,417 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-09 14:30:50,430 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-09 14:30:50,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:30:50,471 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 14:30:50,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 14:30:50,679 INFO L204 MainTranslator]: Completed translation [2024-11-09 14:30:50,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:50 WrapperNode [2024-11-09 14:30:50,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 14:30:50,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 14:30:50,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 14:30:50,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 14:30:50,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:50" (1/1) ... [2024-11-09 14:30:50,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:50" (1/1) ... [2024-11-09 14:30:50,793 INFO L138 Inliner]: procedures = 353, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 734 [2024-11-09 14:30:50,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 14:30:50,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 14:30:50,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 14:30:50,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 14:30:50,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:50" (1/1) ... [2024-11-09 14:30:50,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:50" (1/1) ... [2024-11-09 14:30:50,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:50" (1/1) ... [2024-11-09 14:30:50,870 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 3, 3, 3, 12, 4, 4, 4, 3, 3, 355, 12, 2, 2]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 3, 3, 0, 3, 3, 3, 3, 1, 355, 0, 0, 0]. The 11 writes are split as follows [0, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 5, 1, 2]. [2024-11-09 14:30:50,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:50" (1/1) ... [2024-11-09 14:30:50,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:50" (1/1) ... [2024-11-09 14:30:50,926 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:50" (1/1) ... [2024-11-09 14:30:50,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:50" (1/1) ... [2024-11-09 14:30:50,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:50" (1/1) ... [2024-11-09 14:30:50,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:50" (1/1) ... [2024-11-09 14:30:51,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 14:30:51,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 14:30:51,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 14:30:51,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 14:30:51,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:50" (1/1) ... [2024-11-09 14:30:51,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 14:30:51,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 14:30:51,046 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-09 14:30:51,049 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-09 14:30:51,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 14:30:51,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 14:30:51,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 14:30:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 14:30:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 14:30:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 14:30:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-09 14:30:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-09 14:30:51,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-09 14:30:51,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-09 14:30:51,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-09 14:30:51,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-09 14:30:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-09 14:30:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-09 14:30:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 14:30:51,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 14:30:51,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 14:30:51,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 14:30:51,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 14:30:51,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-09 14:30:51,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-09 14:30:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-09 14:30:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-09 14:30:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-09 14:30:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-09 14:30:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-09 14:30:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-09 14:30:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-09 14:30:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 14:30:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 14:30:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 14:30:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 14:30:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 14:30:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 14:30:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 14:30:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 14:30:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-09 14:30:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-09 14:30:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-09 14:30:51,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-09 14:30:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-09 14:30:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-09 14:30:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-09 14:30:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-09 14:30:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 14:30:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 14:30:51,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 14:30:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 14:30:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 14:30:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 14:30:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-09 14:30:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-09 14:30:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-09 14:30:51,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-09 14:30:51,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-09 14:30:51,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-09 14:30:51,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-09 14:30:51,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-09 14:30:51,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 14:30:51,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 14:30:51,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 14:30:51,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 14:30:51,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 14:30:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-09 14:30:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-09 14:30:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-09 14:30:51,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-09 14:30:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-09 14:30:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-09 14:30:51,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-09 14:30:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-09 14:30:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-09 14:30:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-09 14:30:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 14:30:51,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 14:30:51,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 14:30:51,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 14:30:51,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 14:30:51,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-09 14:30:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-09 14:30:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-09 14:30:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-09 14:30:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-09 14:30:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-09 14:30:51,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-09 14:30:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-09 14:30:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-09 14:30:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 14:30:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 14:30:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 14:30:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 14:30:51,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 14:30:51,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 14:30:51,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-09 14:30:51,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-09 14:30:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-09 14:30:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-09 14:30:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-09 14:30:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-09 14:30:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-09 14:30:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-09 14:30:51,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 14:30:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 14:30:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 14:30:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 14:30:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 14:30:51,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 14:30:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-09 14:30:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-09 14:30:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-09 14:30:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-09 14:30:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-09 14:30:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-09 14:30:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-09 14:30:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-09 14:30:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 14:30:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 14:30:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 14:30:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 14:30:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 14:30:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 14:30:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 14:30:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-09 14:30:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-09 14:30:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-09 14:30:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-09 14:30:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-09 14:30:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-09 14:30:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-09 14:30:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-09 14:30:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-09 14:30:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 14:30:51,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 14:30:51,607 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 14:30:51,609 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 14:30:52,499 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-09 14:30:52,499 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 14:30:52,515 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 14:30:52,516 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-09 14:30:52,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:30:52 BoogieIcfgContainer [2024-11-09 14:30:52,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 14:30:52,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 14:30:52,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 14:30:52,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 14:30:52,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:30:49" (1/3) ... [2024-11-09 14:30:52,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65866d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:30:52, skipping insertion in model container [2024-11-09 14:30:52,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:30:50" (2/3) ... [2024-11-09 14:30:52,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65866d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:30:52, skipping insertion in model container [2024-11-09 14:30:52,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:30:52" (3/3) ... [2024-11-09 14:30:52,529 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-2.i [2024-11-09 14:30:52,546 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 14:30:52,547 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-09 14:30:52,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 14:30:52,612 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;@7d7c8803, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 14:30:52,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-09 14:30:52,617 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-09 14:30:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 14:30:52,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:52,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 14:30:52,626 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-09 14:30:52,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:52,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-09 14:30:52,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:52,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322203589] [2024-11-09 14:30:52,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:52,647 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-09 14:30:52,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:52,651 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-09 14:30:52,717 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-09 14:30:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:53,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 14:30:53,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:53,139 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-09 14:30:53,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:53,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:53,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322203589] [2024-11-09 14:30:53,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322203589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:53,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:53,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 14:30:53,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978942836] [2024-11-09 14:30:53,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:53,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 14:30:53,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:53,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 14:30:53,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 14:30:53,173 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-09 14:30:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:53,210 INFO L93 Difference]: Finished difference Result 223 states and 322 transitions. [2024-11-09 14:30:53,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 14:30:53,212 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-09 14:30:53,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:53,220 INFO L225 Difference]: With dead ends: 223 [2024-11-09 14:30:53,220 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 14:30:53,225 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-09 14:30:53,230 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-09 14:30:53,231 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-09 14:30:53,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 14:30:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-09 14:30:53,292 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-09 14:30:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2024-11-09 14:30:53,303 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 4 [2024-11-09 14:30:53,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:53,305 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2024-11-09 14:30:53,308 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-09 14:30:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2024-11-09 14:30:53,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 14:30:53,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:53,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 14:30:53,333 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 (2)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:53,509 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-09 14:30:53,510 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-09 14:30:53,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:53,511 INFO L85 PathProgramCache]: Analyzing trace with hash 36333200, now seen corresponding path program 1 times [2024-11-09 14:30:53,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:53,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781313238] [2024-11-09 14:30:53,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:53,514 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-09 14:30:53,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:53,517 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-09 14:30:53,519 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-09 14:30:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:53,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 14:30:53,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:53,841 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-09 14:30:53,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:53,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:53,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781313238] [2024-11-09 14:30:53,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781313238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:53,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:53,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:53,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557326491] [2024-11-09 14:30:53,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:53,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:53,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:53,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:53,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:53,845 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-09 14:30:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:53,888 INFO L93 Difference]: Finished difference Result 202 states and 264 transitions. [2024-11-09 14:30:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:53,890 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-09 14:30:53,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:53,891 INFO L225 Difference]: With dead ends: 202 [2024-11-09 14:30:53,892 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 14:30:53,893 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-09 14:30:53,894 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-09 14:30:53,895 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-09 14:30:53,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 14:30:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-09 14:30:53,907 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-09 14:30:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2024-11-09 14:30:53,910 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 5 [2024-11-09 14:30:53,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:53,910 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2024-11-09 14:30:53,910 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-09 14:30:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2024-11-09 14:30:53,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 14:30:53,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:53,911 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-09 14:30:53,923 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 (3)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:54,111 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-09 14:30:54,112 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-09 14:30:54,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:54,113 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-09 14:30:54,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:54,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488089133] [2024-11-09 14:30:54,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:54,114 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-09 14:30:54,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:54,116 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-09 14:30:54,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 (4)] Waiting until timeout for monitored process [2024-11-09 14:30:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:54,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:54,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:54,471 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-09 14:30:54,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:54,517 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-09 14:30:54,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:54,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488089133] [2024-11-09 14:30:54,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488089133] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:54,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:30:54,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-09 14:30:54,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009741457] [2024-11-09 14:30:54,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:54,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:30:54,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:54,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:30:54,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:30:54,523 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-09 14:30:54,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:54,629 INFO L93 Difference]: Finished difference Result 205 states and 269 transitions. [2024-11-09 14:30:54,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:54,631 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-09 14:30:54,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:54,632 INFO L225 Difference]: With dead ends: 205 [2024-11-09 14:30:54,632 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 14:30:54,633 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-09 14:30:54,634 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-09 14:30:54,634 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-09 14:30:54,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 14:30:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-11-09 14:30:54,641 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-09 14:30:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2024-11-09 14:30:54,642 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 8 [2024-11-09 14:30:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:54,642 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2024-11-09 14:30:54,642 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-09 14:30:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2024-11-09 14:30:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 14:30:54,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:54,643 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:30:54,655 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 (4)] Ended with exit code 0 [2024-11-09 14:30:54,844 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-09 14:30:54,844 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-09 14:30:54,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:54,845 INFO L85 PathProgramCache]: Analyzing trace with hash 765480000, now seen corresponding path program 1 times [2024-11-09 14:30:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:54,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602582478] [2024-11-09 14:30:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:54,847 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-09 14:30:54,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:54,850 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-09 14:30:54,851 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-09 14:30:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:55,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 14:30:55,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:55,194 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-09 14:30:55,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:55,250 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-09 14:30:55,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:55,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602582478] [2024-11-09 14:30:55,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602582478] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:55,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:30:55,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 14:30:55,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137856515] [2024-11-09 14:30:55,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:55,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 14:30:55,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:55,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 14:30:55,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 14:30:55,253 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-09 14:30:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:55,396 INFO L93 Difference]: Finished difference Result 213 states and 278 transitions. [2024-11-09 14:30:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 14:30:55,398 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-09 14:30:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:55,399 INFO L225 Difference]: With dead ends: 213 [2024-11-09 14:30:55,399 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 14:30:55,400 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-09 14:30:55,400 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-09 14:30:55,401 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-09 14:30:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 14:30:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-09 14:30:55,408 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-09 14:30:55,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2024-11-09 14:30:55,409 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 17 [2024-11-09 14:30:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:55,410 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2024-11-09 14:30:55,410 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-09 14:30:55,410 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2024-11-09 14:30:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 14:30:55,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:55,411 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 14:30:55,424 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-09 14:30:55,611 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-09 14:30:55,612 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-09 14:30:55,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash -871046720, now seen corresponding path program 2 times [2024-11-09 14:30:55,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:55,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034568632] [2024-11-09 14:30:55,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:30:55,614 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-09 14:30:55,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:55,617 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-09 14:30:55,618 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-09 14:30:55,903 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 14:30:55,903 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:30:55,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 14:30:55,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:55,961 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-09 14:30:55,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:55,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:55,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034568632] [2024-11-09 14:30:55,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034568632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:55,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:55,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 14:30:55,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844497197] [2024-11-09 14:30:55,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:55,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 14:30:55,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:55,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 14:30:55,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:30:55,964 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-09 14:30:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:56,213 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2024-11-09 14:30:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:30:56,214 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-09 14:30:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:56,215 INFO L225 Difference]: With dead ends: 117 [2024-11-09 14:30:56,215 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 14:30:56,215 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-09 14:30:56,216 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 115 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:56,217 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.2s Time] [2024-11-09 14:30:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 14:30:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-09 14:30:56,231 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-09 14:30:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 146 transitions. [2024-11-09 14:30:56,237 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 146 transitions. Word has length 29 [2024-11-09 14:30:56,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:56,238 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 146 transitions. [2024-11-09 14:30:56,238 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-09 14:30:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2024-11-09 14:30:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 14:30:56,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:56,239 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-09 14:30:56,250 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 (6)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:56,440 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-09 14:30:56,440 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-09 14:30:56,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:56,441 INFO L85 PathProgramCache]: Analyzing trace with hash -456152404, now seen corresponding path program 1 times [2024-11-09 14:30:56,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:56,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408560705] [2024-11-09 14:30:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:56,442 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-09 14:30:56,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:56,443 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-09 14:30:56,444 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-09 14:30:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:56,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 14:30:56,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:56,910 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-09 14:30:56,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:57,071 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-09 14:30:57,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:57,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408560705] [2024-11-09 14:30:57,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408560705] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:57,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:30:57,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-09 14:30:57,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539456937] [2024-11-09 14:30:57,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:57,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 14:30:57,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:57,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 14:30:57,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-09 14:30:57,074 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-09 14:30:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:57,437 INFO L93 Difference]: Finished difference Result 221 states and 286 transitions. [2024-11-09 14:30:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 14:30:57,438 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-09 14:30:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:57,439 INFO L225 Difference]: With dead ends: 221 [2024-11-09 14:30:57,439 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 14:30:57,440 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-09 14:30:57,441 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-09 14:30:57,441 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-09 14:30:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 14:30:57,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-09 14:30:57,449 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-09 14:30:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2024-11-09 14:30:57,450 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 35 [2024-11-09 14:30:57,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:57,450 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2024-11-09 14:30:57,450 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-09 14:30:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2024-11-09 14:30:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 14:30:57,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:57,452 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-09 14:30:57,473 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 (7)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:57,652 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-09 14:30:57,653 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-09 14:30:57,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:57,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1314512940, now seen corresponding path program 2 times [2024-11-09 14:30:57,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:57,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633443894] [2024-11-09 14:30:57,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:30:57,654 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-09 14:30:57,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:57,656 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-09 14:30:57,657 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-09 14:30:58,004 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 14:30:58,004 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:30:58,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 14:30:58,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:58,030 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-09 14:30:58,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:58,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:58,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633443894] [2024-11-09 14:30:58,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633443894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:58,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:58,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:58,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262838511] [2024-11-09 14:30:58,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:58,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:58,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:58,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:58,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:58,032 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-09 14:30:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:58,068 INFO L93 Difference]: Finished difference Result 218 states and 280 transitions. [2024-11-09 14:30:58,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:58,069 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-09 14:30:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:58,070 INFO L225 Difference]: With dead ends: 218 [2024-11-09 14:30:58,070 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 14:30:58,070 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-09 14:30:58,071 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-09 14:30:58,071 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-09 14:30:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 14:30:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-09 14:30:58,076 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-09 14:30:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2024-11-09 14:30:58,077 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 47 [2024-11-09 14:30:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:58,077 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2024-11-09 14:30:58,077 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-09 14:30:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2024-11-09 14:30:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 14:30:58,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:58,078 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-09 14:30:58,100 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-09 14:30:58,279 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-09 14:30:58,279 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-09 14:30:58,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:58,279 INFO L85 PathProgramCache]: Analyzing trace with hash -856727864, now seen corresponding path program 1 times [2024-11-09 14:30:58,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:58,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332433967] [2024-11-09 14:30:58,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:58,280 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-09 14:30:58,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:58,282 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-09 14:30:58,282 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-09 14:30:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:58,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:30:58,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:58,715 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-09 14:30:58,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:30:58,759 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-09 14:30:58,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:58,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332433967] [2024-11-09 14:30:58,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332433967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:30:58,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:30:58,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-09 14:30:58,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965367643] [2024-11-09 14:30:58,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:30:58,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:30:58,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:58,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:30:58,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:30:58,762 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-09 14:30:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:58,903 INFO L93 Difference]: Finished difference Result 224 states and 288 transitions. [2024-11-09 14:30:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:30:58,904 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-09 14:30:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:58,905 INFO L225 Difference]: With dead ends: 224 [2024-11-09 14:30:58,905 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 14:30:58,906 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-09 14:30:58,907 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:30:58,907 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.1s Time] [2024-11-09 14:30:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 14:30:58,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-11-09 14:30:58,920 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-09 14:30:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 161 transitions. [2024-11-09 14:30:58,921 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 161 transitions. Word has length 50 [2024-11-09 14:30:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:58,922 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 161 transitions. [2024-11-09 14:30:58,922 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-09 14:30:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 161 transitions. [2024-11-09 14:30:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 14:30:58,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:58,926 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-09 14:30:58,944 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 (9)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:59,126 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-09 14:30:59,127 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-09 14:30:59,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:59,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2047188748, now seen corresponding path program 1 times [2024-11-09 14:30:59,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:59,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606711138] [2024-11-09 14:30:59,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:59,128 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-09 14:30:59,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:59,129 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-09 14:30:59,131 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-09 14:30:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:30:59,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 14:30:59,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:30:59,493 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-09 14:30:59,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:30:59,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:30:59,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606711138] [2024-11-09 14:30:59,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606711138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:30:59,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:30:59,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:30:59,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161831055] [2024-11-09 14:30:59,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:30:59,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:30:59,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:30:59,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:30:59,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:30:59,496 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-09 14:30:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:30:59,525 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2024-11-09 14:30:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:30:59,526 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-09 14:30:59,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:30:59,527 INFO L225 Difference]: With dead ends: 134 [2024-11-09 14:30:59,527 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 14:30:59,527 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-09 14:30:59,528 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-09 14:30:59,528 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-09 14:30:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 14:30:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-09 14:30:59,556 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-09 14:30:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2024-11-09 14:30:59,557 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 51 [2024-11-09 14:30:59,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:30:59,558 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2024-11-09 14:30:59,558 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-09 14:30:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2024-11-09 14:30:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 14:30:59,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:30:59,563 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-09 14:30:59,579 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 (10)] Forceful destruction successful, exit code 0 [2024-11-09 14:30:59,764 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-09 14:30:59,764 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-09 14:30:59,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:30:59,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1371935090, now seen corresponding path program 1 times [2024-11-09 14:30:59,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:30:59,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789513107] [2024-11-09 14:30:59,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:30:59,766 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-09 14:30:59,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:30:59,767 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-09 14:30:59,768 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-09 14:31:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:31:00,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 14:31:00,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:00,231 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-09 14:31:00,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:31:00,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:00,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789513107] [2024-11-09 14:31:00,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789513107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:31:00,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:31:00,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 14:31:00,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493687618] [2024-11-09 14:31:00,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:31:00,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:31:00,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:00,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:31:00,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:31:00,234 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-09 14:31:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:00,696 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2024-11-09 14:31:00,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:31:00,697 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-09 14:31:00,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:00,698 INFO L225 Difference]: With dead ends: 135 [2024-11-09 14:31:00,698 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 14:31:00,698 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-09 14:31:00,699 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-09 14:31:00,699 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-09 14:31:00,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 14:31:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2024-11-09 14:31:00,705 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-09 14:31:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2024-11-09 14:31:00,706 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 52 [2024-11-09 14:31:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:00,706 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2024-11-09 14:31:00,706 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-09 14:31:00,706 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2024-11-09 14:31:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 14:31:00,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:00,708 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-09 14:31:00,721 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 (11)] Forceful destruction successful, exit code 0 [2024-11-09 14:31:00,908 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-09 14:31:00,908 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-09 14:31:00,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:00,909 INFO L85 PathProgramCache]: Analyzing trace with hash -735253954, now seen corresponding path program 1 times [2024-11-09 14:31:00,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:00,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892991229] [2024-11-09 14:31:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:31:00,910 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-09 14:31:00,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:00,912 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-09 14:31:00,912 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-09 14:31:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:31:01,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 14:31:01,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:01,289 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-09 14:31:01,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:31:01,322 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-09 14:31:01,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:01,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892991229] [2024-11-09 14:31:01,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892991229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:31:01,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:31:01,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-09 14:31:01,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302725511] [2024-11-09 14:31:01,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:31:01,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:31:01,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:01,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:31:01,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:31:01,324 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-09 14:31:01,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:01,385 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2024-11-09 14:31:01,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:31:01,385 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-09 14:31:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:01,386 INFO L225 Difference]: With dead ends: 139 [2024-11-09 14:31:01,386 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 14:31:01,387 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-09 14:31:01,387 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-09 14:31:01,387 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-09 14:31:01,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 14:31:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-09 14:31:01,393 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-09 14:31:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2024-11-09 14:31:01,394 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 54 [2024-11-09 14:31:01,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:01,394 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2024-11-09 14:31:01,394 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-09 14:31:01,394 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2024-11-09 14:31:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 14:31:01,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:01,396 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-09 14:31:01,410 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 (12)] Ended with exit code 0 [2024-11-09 14:31:01,599 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-09 14:31:01,600 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-09 14:31:01,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:01,600 INFO L85 PathProgramCache]: Analyzing trace with hash -180848171, now seen corresponding path program 1 times [2024-11-09 14:31:01,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:01,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673488101] [2024-11-09 14:31:01,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:31:01,601 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-09 14:31:01,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:01,602 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-09 14:31:01,603 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-09 14:31:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:31:02,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 14:31:02,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:02,055 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-09 14:31:02,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:31:02,092 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-09 14:31:02,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:02,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673488101] [2024-11-09 14:31:02,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673488101] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:31:02,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:31:02,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 14:31:02,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030610602] [2024-11-09 14:31:02,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:31:02,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 14:31:02,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:02,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 14:31:02,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 14:31:02,094 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-09 14:31:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:02,308 INFO L93 Difference]: Finished difference Result 215 states and 271 transitions. [2024-11-09 14:31:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 14:31:02,309 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-09 14:31:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:02,310 INFO L225 Difference]: With dead ends: 215 [2024-11-09 14:31:02,310 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 14:31:02,311 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-09 14:31:02,311 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-09 14:31:02,312 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-09 14:31:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 14:31:02,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-09 14:31:02,318 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-09 14:31:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 160 transitions. [2024-11-09 14:31:02,319 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 160 transitions. Word has length 54 [2024-11-09 14:31:02,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:02,320 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 160 transitions. [2024-11-09 14:31:02,320 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-09 14:31:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 160 transitions. [2024-11-09 14:31:02,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 14:31:02,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:02,321 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-09 14:31:02,336 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 (13)] Ended with exit code 0 [2024-11-09 14:31:02,522 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-09 14:31:02,522 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-09 14:31:02,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:02,522 INFO L85 PathProgramCache]: Analyzing trace with hash -614640115, now seen corresponding path program 1 times [2024-11-09 14:31:02,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:02,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237343058] [2024-11-09 14:31:02,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:31:02,523 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-09 14:31:02,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:02,525 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-09 14:31:02,525 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-09 14:31:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:31:02,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 14:31:02,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:02,922 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-09 14:31:02,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:31:02,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:02,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237343058] [2024-11-09 14:31:02,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237343058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:31:02,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:31:02,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:31:02,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454629465] [2024-11-09 14:31:02,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:31:02,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:31:02,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:02,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:31:02,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:31:02,925 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-09 14:31:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:02,937 INFO L93 Difference]: Finished difference Result 182 states and 225 transitions. [2024-11-09 14:31:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:31:02,937 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-09 14:31:02,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:02,938 INFO L225 Difference]: With dead ends: 182 [2024-11-09 14:31:02,938 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 14:31:02,938 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-09 14:31:02,939 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-09 14:31:02,939 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-09 14:31:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 14:31:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-09 14:31:02,945 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-09 14:31:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2024-11-09 14:31:02,946 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 55 [2024-11-09 14:31:02,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:02,946 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2024-11-09 14:31:02,946 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-09 14:31:02,946 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2024-11-09 14:31:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 14:31:02,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:02,947 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-09 14:31:02,959 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-09 14:31:03,148 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-09 14:31:03,148 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-09 14:31:03,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:03,149 INFO L85 PathProgramCache]: Analyzing trace with hash 692610261, now seen corresponding path program 2 times [2024-11-09 14:31:03,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:03,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411409397] [2024-11-09 14:31:03,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:31:03,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-09 14:31:03,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:03,152 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-09 14:31:03,153 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-09 14:31:03,457 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 14:31:03,457 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:31:03,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 14:31:03,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:03,508 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-09 14:31:03,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:31:03,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:03,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411409397] [2024-11-09 14:31:03,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411409397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:31:03,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:31:03,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 14:31:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226342529] [2024-11-09 14:31:03,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:31:03,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:31:03,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:03,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:31:03,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:31:03,509 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-09 14:31:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:03,659 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2024-11-09 14:31:03,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:31:03,659 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-09 14:31:03,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:03,660 INFO L225 Difference]: With dead ends: 141 [2024-11-09 14:31:03,660 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 14:31:03,660 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-09 14:31:03,661 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-09 14:31:03,661 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-09 14:31:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 14:31:03,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-09 14:31:03,670 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-09 14:31:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2024-11-09 14:31:03,671 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 66 [2024-11-09 14:31:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:03,672 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2024-11-09 14:31:03,672 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-09 14:31:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2024-11-09 14:31:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 14:31:03,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:03,673 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-09 14:31:03,687 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-09 14:31:03,873 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-09 14:31:03,874 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-09 14:31:03,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:03,874 INFO L85 PathProgramCache]: Analyzing trace with hash -773011160, now seen corresponding path program 1 times [2024-11-09 14:31:03,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:03,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787198666] [2024-11-09 14:31:03,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:31:03,875 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-09 14:31:03,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:03,877 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-09 14:31:03,878 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-09 14:31:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:31:04,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 14:31:04,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:04,346 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-09 14:31:04,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:31:04,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:04,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787198666] [2024-11-09 14:31:04,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787198666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:31:04,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:31:04,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 14:31:04,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255838574] [2024-11-09 14:31:04,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:31:04,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:31:04,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:04,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:31:04,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:31:04,348 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-09 14:31:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:04,627 INFO L93 Difference]: Finished difference Result 194 states and 234 transitions. [2024-11-09 14:31:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:31:04,628 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-09 14:31:04,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:04,629 INFO L225 Difference]: With dead ends: 194 [2024-11-09 14:31:04,629 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 14:31:04,629 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-09 14:31:04,630 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-09 14:31:04,630 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-09 14:31:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 14:31:04,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-09 14:31:04,636 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-09 14:31:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2024-11-09 14:31:04,637 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 75 [2024-11-09 14:31:04,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:04,638 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2024-11-09 14:31:04,638 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-09 14:31:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2024-11-09 14:31:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 14:31:04,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:04,639 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-09 14:31:04,655 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 (16)] Forceful destruction successful, exit code 0 [2024-11-09 14:31:04,839 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-09 14:31:04,840 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-09 14:31:04,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:04,840 INFO L85 PathProgramCache]: Analyzing trace with hash -475670046, now seen corresponding path program 1 times [2024-11-09 14:31:04,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:04,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226490983] [2024-11-09 14:31:04,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:31:04,841 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-09 14:31:04,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:04,857 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-09 14:31:04,858 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-09 14:31:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:31:05,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 14:31:05,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:05,447 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-09 14:31:05,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:31:05,577 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-09 14:31:05,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:05,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226490983] [2024-11-09 14:31:05,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226490983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:31:05,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:31:05,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-09 14:31:05,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93203757] [2024-11-09 14:31:05,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:31:05,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 14:31:05,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:05,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 14:31:05,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-09 14:31:05,579 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-09 14:31:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:06,267 INFO L93 Difference]: Finished difference Result 245 states and 294 transitions. [2024-11-09 14:31:06,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 14:31:06,268 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-09 14:31:06,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:06,269 INFO L225 Difference]: With dead ends: 245 [2024-11-09 14:31:06,269 INFO L226 Difference]: Without dead ends: 164 [2024-11-09 14:31:06,270 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-09 14:31:06,270 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 14:31:06,271 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.6s Time] [2024-11-09 14:31:06,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-09 14:31:06,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-09 14:31:06,278 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-09 14:31:06,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2024-11-09 14:31:06,279 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 186 transitions. Word has length 89 [2024-11-09 14:31:06,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:06,279 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 186 transitions. [2024-11-09 14:31:06,280 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-09 14:31:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 186 transitions. [2024-11-09 14:31:06,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 14:31:06,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:06,281 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-09 14:31:06,302 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-09 14:31:06,481 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-09 14:31:06,482 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-09 14:31:06,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:06,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1799807557, now seen corresponding path program 1 times [2024-11-09 14:31:06,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:06,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272030289] [2024-11-09 14:31:06,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:31:06,483 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-09 14:31:06,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:06,484 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-09 14:31:06,485 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-09 14:31:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:31:07,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 14:31:07,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:07,438 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-09 14:31:07,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:31:07,753 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-09 14:31:07,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:07,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272030289] [2024-11-09 14:31:07,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272030289] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:31:07,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:31:07,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2024-11-09 14:31:07,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283962991] [2024-11-09 14:31:07,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:31:07,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 14:31:07,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:07,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 14:31:07,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 14:31:07,755 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-09 14:31:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:08,903 INFO L93 Difference]: Finished difference Result 256 states and 297 transitions. [2024-11-09 14:31:08,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 14:31:08,904 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-09 14:31:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:08,906 INFO L225 Difference]: With dead ends: 256 [2024-11-09 14:31:08,906 INFO L226 Difference]: Without dead ends: 199 [2024-11-09 14:31:08,906 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-09 14:31:08,907 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 162 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:31:08,907 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.1s Time] [2024-11-09 14:31:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-09 14:31:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-09 14:31:08,917 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-09 14:31:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 222 transitions. [2024-11-09 14:31:08,918 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 222 transitions. Word has length 110 [2024-11-09 14:31:08,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:08,919 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 222 transitions. [2024-11-09 14:31:08,919 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-09 14:31:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 222 transitions. [2024-11-09 14:31:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 14:31:08,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:08,920 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-09 14:31:08,944 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 (18)] Forceful destruction successful, exit code 0 [2024-11-09 14:31:09,121 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-09 14:31:09,121 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-09 14:31:09,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:09,122 INFO L85 PathProgramCache]: Analyzing trace with hash -46553016, now seen corresponding path program 2 times [2024-11-09 14:31:09,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:09,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170596438] [2024-11-09 14:31:09,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:31:09,123 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-09 14:31:09,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:09,126 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-09 14:31:09,127 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-09 14:31:09,514 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 14:31:09,514 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:31:09,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 14:31:09,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:09,552 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-09 14:31:09,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:31:09,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:09,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170596438] [2024-11-09 14:31:09,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170596438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:31:09,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:31:09,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 14:31:09,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42792079] [2024-11-09 14:31:09,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:31:09,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 14:31:09,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:09,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 14:31:09,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:31:09,558 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-09 14:31:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:09,606 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2024-11-09 14:31:09,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:31:09,606 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-09 14:31:09,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:09,607 INFO L225 Difference]: With dead ends: 226 [2024-11-09 14:31:09,607 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 14:31:09,607 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-09 14:31:09,608 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 14:31:09,608 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.0s Time] [2024-11-09 14:31:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 14:31:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2024-11-09 14:31:09,618 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-09 14:31:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2024-11-09 14:31:09,619 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 145 [2024-11-09 14:31:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:09,619 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2024-11-09 14:31:09,620 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-09 14:31:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2024-11-09 14:31:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 14:31:09,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:09,621 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-09 14:31:09,632 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 (19)] Forceful destruction successful, exit code 0 [2024-11-09 14:31:09,821 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-09 14:31:09,822 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-09 14:31:09,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:09,822 INFO L85 PathProgramCache]: Analyzing trace with hash 10705286, now seen corresponding path program 1 times [2024-11-09 14:31:09,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:09,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460617759] [2024-11-09 14:31:09,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:31:09,823 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-09 14:31:09,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:09,825 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-09 14:31:09,826 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-09 14:31:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:31:10,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 14:31:10,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:10,778 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-09 14:31:10,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:31:10,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:10,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460617759] [2024-11-09 14:31:10,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460617759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:31:10,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:31:10,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 14:31:10,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501743566] [2024-11-09 14:31:10,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:31:10,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:31:10,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:10,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:31:10,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 14:31:10,780 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-09 14:31:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:10,802 INFO L93 Difference]: Finished difference Result 228 states and 257 transitions. [2024-11-09 14:31:10,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:31:10,803 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-09 14:31:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:10,804 INFO L225 Difference]: With dead ends: 228 [2024-11-09 14:31:10,804 INFO L226 Difference]: Without dead ends: 201 [2024-11-09 14:31:10,805 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-09 14:31:10,805 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-09 14:31:10,805 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-09 14:31:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-09 14:31:10,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-09 14:31:10,815 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-09 14:31:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 224 transitions. [2024-11-09 14:31:10,816 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 224 transitions. Word has length 145 [2024-11-09 14:31:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:10,817 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 224 transitions. [2024-11-09 14:31:10,817 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-09 14:31:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 224 transitions. [2024-11-09 14:31:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 14:31:10,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:10,820 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-09 14:31:10,843 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 (20)] Ended with exit code 0 [2024-11-09 14:31:11,020 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-09 14:31:11,021 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-09 14:31:11,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash 828353736, now seen corresponding path program 1 times [2024-11-09 14:31:11,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:11,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529501676] [2024-11-09 14:31:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:31:11,023 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-09 14:31:11,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:11,026 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-09 14:31:11,027 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-09 14:31:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:31:12,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 14:31:12,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:12,144 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-09 14:31:12,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:31:12,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:12,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529501676] [2024-11-09 14:31:12,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529501676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:31:12,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:31:12,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 14:31:12,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903523538] [2024-11-09 14:31:12,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:31:12,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 14:31:12,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:12,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 14:31:12,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 14:31:12,145 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-09 14:31:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:12,221 INFO L93 Difference]: Finished difference Result 220 states and 247 transitions. [2024-11-09 14:31:12,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 14:31:12,222 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-09 14:31:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:12,223 INFO L225 Difference]: With dead ends: 220 [2024-11-09 14:31:12,223 INFO L226 Difference]: Without dead ends: 218 [2024-11-09 14:31:12,224 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-09 14:31:12,224 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-09 14:31:12,224 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-09 14:31:12,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-09 14:31:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 214. [2024-11-09 14:31:12,237 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-09 14:31:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 240 transitions. [2024-11-09 14:31:12,238 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 240 transitions. Word has length 145 [2024-11-09 14:31:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:12,239 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 240 transitions. [2024-11-09 14:31:12,239 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-09 14:31:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 240 transitions. [2024-11-09 14:31:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 14:31:12,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:12,241 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-09 14:31:12,274 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 (21)] Ended with exit code 0 [2024-11-09 14:31:12,441 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-09 14:31:12,441 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-09 14:31:12,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:12,442 INFO L85 PathProgramCache]: Analyzing trace with hash -328131403, now seen corresponding path program 2 times [2024-11-09 14:31:12,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:12,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252985347] [2024-11-09 14:31:12,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 14:31:12,443 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-09 14:31:12,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:12,444 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-09 14:31:12,445 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-09 14:31:12,904 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 14:31:12,904 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 14:31:12,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 14:31:12,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:13,213 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-09 14:31:13,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:31:13,294 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-09 14:31:13,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:13,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252985347] [2024-11-09 14:31:13,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252985347] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 14:31:13,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:31:13,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-09 14:31:13,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21872253] [2024-11-09 14:31:13,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:31:13,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 14:31:13,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:13,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 14:31:13,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 14:31:13,296 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-09 14:31:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:13,387 INFO L93 Difference]: Finished difference Result 214 states and 240 transitions. [2024-11-09 14:31:13,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 14:31:13,388 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-09 14:31:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:13,389 INFO L225 Difference]: With dead ends: 214 [2024-11-09 14:31:13,389 INFO L226 Difference]: Without dead ends: 213 [2024-11-09 14:31:13,389 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-09 14:31:13,390 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-09 14:31:13,390 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-09 14:31:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-09 14:31:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 179. [2024-11-09 14:31:13,399 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-09 14:31:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 204 transitions. [2024-11-09 14:31:13,400 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 204 transitions. Word has length 148 [2024-11-09 14:31:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:13,400 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 204 transitions. [2024-11-09 14:31:13,401 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-09 14:31:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 204 transitions. [2024-11-09 14:31:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 14:31:13,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:13,402 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-09 14:31:13,415 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-09 14:31:13,602 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-09 14:31:13,602 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-09 14:31:13,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:13,603 INFO L85 PathProgramCache]: Analyzing trace with hash 269914731, now seen corresponding path program 1 times [2024-11-09 14:31:13,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:13,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358805605] [2024-11-09 14:31:13,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:31:13,604 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-09 14:31:13,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:13,605 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-09 14:31:13,607 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-09 14:31:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:31:14,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 14:31:14,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:15,008 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-09 14:31:15,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:31:15,102 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-09 14:31:15,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:15,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358805605] [2024-11-09 14:31:15,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358805605] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 14:31:15,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 14:31:15,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-11-09 14:31:15,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849370449] [2024-11-09 14:31:15,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:31:15,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 14:31:15,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:15,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 14:31:15,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-09 14:31:15,105 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-09 14:31:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:15,288 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2024-11-09 14:31:15,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 14:31:15,290 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-09 14:31:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:15,291 INFO L225 Difference]: With dead ends: 187 [2024-11-09 14:31:15,291 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 14:31:15,292 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-09 14:31:15,292 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-09 14:31:15,292 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-09 14:31:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 14:31:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2024-11-09 14:31:15,302 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-09 14:31:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 203 transitions. [2024-11-09 14:31:15,303 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 203 transitions. Word has length 162 [2024-11-09 14:31:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:15,303 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 203 transitions. [2024-11-09 14:31:15,304 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-09 14:31:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 203 transitions. [2024-11-09 14:31:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 14:31:15,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:15,305 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-09 14:31:15,337 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 (23)] Forceful destruction successful, exit code 0 [2024-11-09 14:31:15,505 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-09 14:31:15,506 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-09 14:31:15,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:15,506 INFO L85 PathProgramCache]: Analyzing trace with hash -222577589, now seen corresponding path program 1 times [2024-11-09 14:31:15,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:15,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821298563] [2024-11-09 14:31:15,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:31:15,507 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-09 14:31:15,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:15,508 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-09 14:31:15,509 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-09 14:31:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:31:16,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 14:31:16,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:17,060 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-09 14:31:17,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 14:31:17,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 14:31:17,266 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-09 14:31:17,276 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-09 14:31:17,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:31:17,418 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-09 14:31:17,424 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-09 14:31:17,587 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-09 14:31:17,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:17,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821298563] [2024-11-09 14:31:17,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821298563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:31:17,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:31:17,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2024-11-09 14:31:17,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248604456] [2024-11-09 14:31:17,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:31:17,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 14:31:17,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:17,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 14:31:17,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 14:31:17,589 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-09 14:31:18,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:18,764 INFO L93 Difference]: Finished difference Result 270 states and 314 transitions. [2024-11-09 14:31:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 14:31:18,765 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-09 14:31:18,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:18,767 INFO L225 Difference]: With dead ends: 270 [2024-11-09 14:31:18,767 INFO L226 Difference]: Without dead ends: 212 [2024-11-09 14:31:18,767 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-09 14:31:18,768 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 7 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 14:31:18,768 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.1s Time] [2024-11-09 14:31:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-09 14:31:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 178. [2024-11-09 14:31:18,779 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-09 14:31:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 202 transitions. [2024-11-09 14:31:18,780 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 202 transitions. Word has length 163 [2024-11-09 14:31:18,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:18,781 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 202 transitions. [2024-11-09 14:31:18,781 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-09 14:31:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 202 transitions. [2024-11-09 14:31:18,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 14:31:18,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:18,782 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-09 14:31:18,815 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 (24)] Ended with exit code 0 [2024-11-09 14:31:18,983 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-09 14:31:18,984 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-09 14:31:18,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:18,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1554467069, now seen corresponding path program 1 times [2024-11-09 14:31:18,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:18,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383818883] [2024-11-09 14:31:18,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:31:18,986 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-09 14:31:18,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:18,989 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-09 14:31:18,990 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-09 14:31:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:31:20,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 14:31:20,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:20,367 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-09 14:31:20,372 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-09 14:31:20,393 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-09 14:31:20,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 14:31:20,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:20,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383818883] [2024-11-09 14:31:20,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383818883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 14:31:20,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 14:31:20,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 14:31:20,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356633257] [2024-11-09 14:31:20,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 14:31:20,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 14:31:20,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:20,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 14:31:20,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 14:31:20,397 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-09 14:31:20,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 14:31:20,699 INFO L93 Difference]: Finished difference Result 237 states and 277 transitions. [2024-11-09 14:31:20,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 14:31:20,700 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-09 14:31:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 14:31:20,701 INFO L225 Difference]: With dead ends: 237 [2024-11-09 14:31:20,701 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 14:31:20,702 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-09 14:31:20,702 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 14:31:20,702 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.3s Time] [2024-11-09 14:31:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 14:31:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2024-11-09 14:31:20,712 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-09 14:31:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2024-11-09 14:31:20,715 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 169 [2024-11-09 14:31:20,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 14:31:20,715 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2024-11-09 14:31:20,716 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-09 14:31:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2024-11-09 14:31:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-09 14:31:20,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 14:31:20,717 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-09 14:31:20,747 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 (25)] Forceful destruction successful, exit code 0 [2024-11-09 14:31:20,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-09 14:31:20,918 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-09 14:31:20,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 14:31:20,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1166437475, now seen corresponding path program 1 times [2024-11-09 14:31:20,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 14:31:20,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194685171] [2024-11-09 14:31:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 14:31:20,920 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-09 14:31:20,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 14:31:20,921 INFO L229 MonitoredProcess]: Starting monitored process 26 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-09 14:31:20,922 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 (26)] Waiting until timeout for monitored process [2024-11-09 14:31:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 14:31:22,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 14:31:22,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 14:31:22,499 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-09 14:31:22,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 14:31:22,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 14:31:22,762 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-09 14:31:22,808 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-09 14:31:22,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 14:31:22,960 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-09 14:31:22,963 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-09 14:31:23,091 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-09 14:31:23,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 14:31:23,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194685171] [2024-11-09 14:31:23,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194685171] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 14:31:23,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 14:31:23,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2024-11-09 14:31:23,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842534360] [2024-11-09 14:31:23,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 14:31:23,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 14:31:23,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 14:31:23,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 14:31:23,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-09 14:31:23,093 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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)