./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/dirname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f 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/dirname-1.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 deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:03:37,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:03:37,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 20:03:37,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:03:37,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:03:37,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:03:37,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:03:37,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:03:37,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:03:37,886 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:03:37,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 20:03:37,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 20:03:37,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:03:37,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:03:37,888 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:03:37,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:03:37,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 20:03:37,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:03:37,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:03:37,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 20:03:37,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 20:03:37,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 20:03:37,892 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:03:37,892 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 20:03:37,893 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:03:37,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:03:37,893 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:03:37,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:03:37,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:03:37,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 20:03:37,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 20:03:37,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:03:37,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:03:37,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 20:03:37,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 20:03:37,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:03:37,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 20:03:37,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 20:03:37,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 20:03:37,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 20:03:37,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 20:03:37,896 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 -> deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 [2024-11-12 20:03:38,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:03:38,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:03:38,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:03:38,125 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:03:38,125 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:03:38,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-12 20:03:39,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:03:39,634 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:03:39,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-12 20:03:39,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ef7daca/07d3321dd88b48b3a6249745ff1543d9/FLAG169fc443a [2024-11-12 20:03:39,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ef7daca/07d3321dd88b48b3a6249745ff1543d9 [2024-11-12 20:03:39,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:03:39,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:03:39,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:03:39,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:03:39,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:03:39,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:03:39" (1/1) ... [2024-11-12 20:03:39,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fa7dbdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:39, skipping insertion in model container [2024-11-12 20:03:39,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:03:39" (1/1) ... [2024-11-12 20:03:39,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:03:40,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:03:40,182 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:03:40,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:03:40,370 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:03:40,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:40 WrapperNode [2024-11-12 20:03:40,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:03:40,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:03:40,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:03:40,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:03:40,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:40" (1/1) ... [2024-11-12 20:03:40,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:40" (1/1) ... [2024-11-12 20:03:40,459 INFO L138 Inliner]: procedures = 344, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 669 [2024-11-12 20:03:40,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:03:40,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:03:40,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:03:40,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:03:40,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:40" (1/1) ... [2024-11-12 20:03:40,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:40" (1/1) ... [2024-11-12 20:03:40,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:40" (1/1) ... [2024-11-12 20:03:40,510 INFO L175 MemorySlicer]: Split 450 memory accesses to 15 slices as follows [2, 3, 3, 3, 4, 4, 4, 4, 3, 44, 355, 2, 11, 6, 2]. 79 percent of accesses are in the largest equivalence class. The 423 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 3, 42, 355, 0, 0, 0, 0]. The 9 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 1, 2, 2, 2]. [2024-11-12 20:03:40,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:40" (1/1) ... [2024-11-12 20:03:40,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:40" (1/1) ... [2024-11-12 20:03:40,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:40" (1/1) ... [2024-11-12 20:03:40,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:40" (1/1) ... [2024-11-12 20:03:40,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:40" (1/1) ... [2024-11-12 20:03:40,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:40" (1/1) ... [2024-11-12 20:03:40,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:03:40,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:03:40,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:03:40,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:03:40,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:40" (1/1) ... [2024-11-12 20:03:40,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:03:40,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:40,597 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-12 20:03:40,599 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-12 20:03:40,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 20:03:40,634 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 20:03:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 20:03:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 20:03:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 20:03:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-12 20:03:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-12 20:03:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-12 20:03:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-12 20:03:40,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-12 20:03:40,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-12 20:03:40,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-12 20:03:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-12 20:03:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-12 20:03:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-12 20:03:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-12 20:03:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-12 20:03:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 20:03:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 20:03:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 20:03:40,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 20:03:40,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-12 20:03:40,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-12 20:03:40,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-12 20:03:40,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-12 20:03:40,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-12 20:03:40,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-12 20:03:40,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:03:40,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:03:40,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:03:40,821 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:03:41,263 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-11-12 20:03:41,263 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:03:41,274 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:03:41,274 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-12 20:03:41,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:03:41 BoogieIcfgContainer [2024-11-12 20:03:41,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:03:41,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 20:03:41,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 20:03:41,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 20:03:41,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:03:39" (1/3) ... [2024-11-12 20:03:41,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd92376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:03:41, skipping insertion in model container [2024-11-12 20:03:41,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:03:40" (2/3) ... [2024-11-12 20:03:41,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd92376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:03:41, skipping insertion in model container [2024-11-12 20:03:41,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:03:41" (3/3) ... [2024-11-12 20:03:41,282 INFO L112 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2024-11-12 20:03:41,294 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 20:03:41,295 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-12 20:03:41,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 20:03:41,356 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;@3e55a491, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 20:03:41,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-12 20:03:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 90 states have internal predecessors, (115), 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-12 20:03:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-12 20:03:41,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:41,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-12 20:03:41,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:41,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-12 20:03:41,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:41,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341941498] [2024-11-12 20:03:41,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:41,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:41,706 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-12 20:03:41,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:41,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341941498] [2024-11-12 20:03:41,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341941498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:41,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:03:41,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:03:41,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892400116] [2024-11-12 20:03:41,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:41,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:03:41,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:41,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:03:41,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:03:41,729 INFO L87 Difference]: Start difference. First operand has 93 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 90 states have internal predecessors, (115), 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) 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-12 20:03:41,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:41,770 INFO L93 Difference]: Finished difference Result 173 states and 221 transitions. [2024-11-12 20:03:41,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:03:41,772 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-12 20:03:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:41,779 INFO L225 Difference]: With dead ends: 173 [2024-11-12 20:03:41,779 INFO L226 Difference]: Without dead ends: 85 [2024-11-12 20:03:41,782 INFO L434 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-12 20:03:41,785 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:41,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 181 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:41,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-12 20:03:41,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-12 20:03:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 82 states have internal predecessors, (97), 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-12 20:03:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-11-12 20:03:41,811 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 4 [2024-11-12 20:03:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:41,811 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-11-12 20:03:41,812 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-12 20:03:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-11-12 20:03:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 20:03:41,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:41,812 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-12 20:03:41,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 20:03:41,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:41,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:41,813 INFO L85 PathProgramCache]: Analyzing trace with hash 556468371, now seen corresponding path program 1 times [2024-11-12 20:03:41,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:41,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492851430] [2024-11-12 20:03:41,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:41,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:41,948 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-12 20:03:41,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:41,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492851430] [2024-11-12 20:03:41,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492851430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:41,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83472360] [2024-11-12 20:03:41,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:41,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:41,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:41,951 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-12 20:03:41,953 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-12 20:03:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:42,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:03:42,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:42,234 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-12 20:03:42,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:03:42,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83472360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:42,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:03:42,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-12 20:03:42,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294731388] [2024-11-12 20:03:42,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:42,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:03:42,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:42,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:03:42,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:03:42,237 INFO L87 Difference]: Start difference. First operand 85 states and 99 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-12 20:03:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:42,267 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2024-11-12 20:03:42,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:03:42,268 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-12 20:03:42,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:42,269 INFO L225 Difference]: With dead ends: 85 [2024-11-12 20:03:42,269 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 20:03:42,270 INFO L434 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-12 20:03:42,271 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 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-12 20:03:42,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 20:03:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-12 20:03:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.6) internal successors, (96), 81 states have internal predecessors, (96), 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-12 20:03:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2024-11-12 20:03:42,280 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 7 [2024-11-12 20:03:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:42,281 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2024-11-12 20:03:42,281 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-12 20:03:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2024-11-12 20:03:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 20:03:42,281 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:42,281 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-12 20:03:42,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 20:03:42,485 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-12 20:03:42,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:42,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:42,487 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-12 20:03:42,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:42,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191541427] [2024-11-12 20:03:42,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:42,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:42,591 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-12 20:03:42,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:42,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191541427] [2024-11-12 20:03:42,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191541427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:42,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:03:42,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:03:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755903688] [2024-11-12 20:03:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:42,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:03:42,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:42,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:03:42,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:03:42,595 INFO L87 Difference]: Start difference. First operand 84 states and 98 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-12 20:03:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:42,612 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2024-11-12 20:03:42,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:03:42,612 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-12 20:03:42,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:42,613 INFO L225 Difference]: With dead ends: 84 [2024-11-12 20:03:42,613 INFO L226 Difference]: Without dead ends: 83 [2024-11-12 20:03:42,614 INFO L434 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-12 20:03:42,615 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 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-12 20:03:42,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:42,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-12 20:03:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-12 20:03:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.603448275862069) internal successors, (93), 78 states have internal predecessors, (93), 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-12 20:03:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2024-11-12 20:03:42,626 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 8 [2024-11-12 20:03:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:42,626 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2024-11-12 20:03:42,626 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-12 20:03:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2024-11-12 20:03:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 20:03:42,627 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:42,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:03:42,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 20:03:42,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:42,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:42,628 INFO L85 PathProgramCache]: Analyzing trace with hash 216065076, now seen corresponding path program 1 times [2024-11-12 20:03:42,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:42,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027631159] [2024-11-12 20:03:42,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:42,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:42,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-12 20:03:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:42,773 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-12 20:03:42,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:42,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027631159] [2024-11-12 20:03:42,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027631159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:42,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929644633] [2024-11-12 20:03:42,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:42,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:42,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:42,777 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-12 20:03:42,778 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-12 20:03:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:42,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:03:42,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:42,998 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-12 20:03:42,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:03:42,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929644633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:42,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:03:42,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-12 20:03:42,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17524821] [2024-11-12 20:03:42,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:43,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:03:43,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:43,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:03:43,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:03:43,003 INFO L87 Difference]: Start difference. First operand 81 states and 95 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-12 20:03:43,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:43,025 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2024-11-12 20:03:43,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:03:43,030 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-12 20:03:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:43,030 INFO L225 Difference]: With dead ends: 81 [2024-11-12 20:03:43,031 INFO L226 Difference]: Without dead ends: 79 [2024-11-12 20:03:43,032 INFO L434 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-12 20:03:43,033 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 78 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:43,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 92 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-12 20:03:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-12 20:03:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 76 states have internal predecessors, (91), 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-12 20:03:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2024-11-12 20:03:43,041 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 13 [2024-11-12 20:03:43,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:43,042 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2024-11-12 20:03:43,042 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-12 20:03:43,042 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2024-11-12 20:03:43,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 20:03:43,043 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:43,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:03:43,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 20:03:43,243 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-12 20:03:43,244 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:43,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:43,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1891917174, now seen corresponding path program 1 times [2024-11-12 20:03:43,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:43,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458453196] [2024-11-12 20:03:43,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:43,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:43,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-12 20:03:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:43,374 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-12 20:03:43,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:43,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458453196] [2024-11-12 20:03:43,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458453196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:43,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230535039] [2024-11-12 20:03:43,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:43,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:43,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:43,376 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-12 20:03:43,378 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-12 20:03:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:43,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:03:43,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:43,581 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-12 20:03:43,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:03:43,612 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-12 20:03:43,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230535039] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:03:43,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:03:43,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-12 20:03:43,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332480262] [2024-11-12 20:03:43,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:03:43,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 20:03:43,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:43,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 20:03:43,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:03:43,615 INFO L87 Difference]: Start difference. First operand 79 states and 93 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-12 20:03:43,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:43,652 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2024-11-12 20:03:43,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:03:43,654 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-12 20:03:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:43,655 INFO L225 Difference]: With dead ends: 161 [2024-11-12 20:03:43,655 INFO L226 Difference]: Without dead ends: 88 [2024-11-12 20:03:43,656 INFO L434 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-12 20:03:43,658 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 4 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:43,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 433 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-12 20:03:43,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-12 20:03:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.492537313432836) internal successors, (100), 85 states have internal predecessors, (100), 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-12 20:03:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2024-11-12 20:03:43,666 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 14 [2024-11-12 20:03:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:43,666 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2024-11-12 20:03:43,666 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-12 20:03:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2024-11-12 20:03:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 20:03:43,667 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:43,667 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:03:43,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 20:03:43,868 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-12 20:03:43,868 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:43,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:43,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1138585064, now seen corresponding path program 2 times [2024-11-12 20:03:43,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:43,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47700652] [2024-11-12 20:03:43,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:43,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:44,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 20:03:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:44,016 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-12 20:03:44,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:44,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47700652] [2024-11-12 20:03:44,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47700652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:44,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903020316] [2024-11-12 20:03:44,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:03:44,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:44,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:44,018 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-12 20:03:44,019 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-12 20:03:44,215 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 20:03:44,215 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:03:44,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 20:03:44,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:44,247 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-12 20:03:44,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:03:44,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903020316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:44,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:03:44,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-12 20:03:44,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32838076] [2024-11-12 20:03:44,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:44,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:03:44,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:44,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:03:44,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:03:44,249 INFO L87 Difference]: Start difference. First operand 88 states and 102 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-12 20:03:44,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:44,277 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2024-11-12 20:03:44,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:03:44,278 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-12 20:03:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:44,279 INFO L225 Difference]: With dead ends: 88 [2024-11-12 20:03:44,279 INFO L226 Difference]: Without dead ends: 86 [2024-11-12 20:03:44,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:03:44,280 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 77 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:44,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 246 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:44,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-12 20:03:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-12 20:03:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.462686567164179) internal successors, (98), 83 states have internal predecessors, (98), 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-12 20:03:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2024-11-12 20:03:44,284 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 23 [2024-11-12 20:03:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:44,284 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2024-11-12 20:03:44,284 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-12 20:03:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2024-11-12 20:03:44,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 20:03:44,285 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:44,285 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:03:44,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 20:03:44,485 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-12 20:03:44,485 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:44,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:44,486 INFO L85 PathProgramCache]: Analyzing trace with hash -649986637, now seen corresponding path program 1 times [2024-11-12 20:03:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:44,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513256265] [2024-11-12 20:03:44,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:44,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:44,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 20:03:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:44,649 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-12 20:03:44,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:44,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513256265] [2024-11-12 20:03:44,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513256265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:44,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:03:44,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:03:44,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666912917] [2024-11-12 20:03:44,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:44,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:03:44,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:44,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:03:44,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:03:44,653 INFO L87 Difference]: Start difference. First operand 86 states and 100 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-12 20:03:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:44,674 INFO L93 Difference]: Finished difference Result 150 states and 180 transitions. [2024-11-12 20:03:44,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:03:44,675 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-12 20:03:44,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:44,676 INFO L225 Difference]: With dead ends: 150 [2024-11-12 20:03:44,676 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 20:03:44,676 INFO L434 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-12 20:03:44,678 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 168 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-12 20:03:44,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 168 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:44,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 20:03:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-12 20:03:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 86 states have internal predecessors, (101), 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-12 20:03:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2024-11-12 20:03:44,689 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 28 [2024-11-12 20:03:44,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:44,689 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2024-11-12 20:03:44,689 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-12 20:03:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2024-11-12 20:03:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 20:03:44,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:44,690 INFO L218 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-12 20:03:44,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 20:03:44,690 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:44,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2039246265, now seen corresponding path program 1 times [2024-11-12 20:03:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:44,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189671229] [2024-11-12 20:03:44,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:44,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:44,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 20:03:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:44,810 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-12 20:03:44,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:44,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189671229] [2024-11-12 20:03:44,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189671229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:44,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494022437] [2024-11-12 20:03:44,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:44,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:44,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:44,812 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-12 20:03:44,813 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-12 20:03:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:45,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 20:03:45,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:45,114 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-12 20:03:45,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:03:45,177 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-12 20:03:45,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494022437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:03:45,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:03:45,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2024-11-12 20:03:45,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065653127] [2024-11-12 20:03:45,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:03:45,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 20:03:45,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:45,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 20:03:45,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-12 20:03:45,180 INFO L87 Difference]: Start difference. First operand 89 states and 103 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-12 20:03:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:45,248 INFO L93 Difference]: Finished difference Result 180 states and 214 transitions. [2024-11-12 20:03:45,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 20:03:45,249 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-12 20:03:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:45,249 INFO L225 Difference]: With dead ends: 180 [2024-11-12 20:03:45,249 INFO L226 Difference]: Without dead ends: 106 [2024-11-12 20:03:45,250 INFO L434 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-12 20:03:45,250 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:45,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 393 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:03:45,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-12 20:03:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-12 20:03:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 103 states have internal predecessors, (118), 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-12 20:03:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2024-11-12 20:03:45,255 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 31 [2024-11-12 20:03:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:45,255 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2024-11-12 20:03:45,255 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-12 20:03:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2024-11-12 20:03:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 20:03:45,256 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:45,256 INFO L218 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-12 20:03:45,271 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-12 20:03:45,456 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-12 20:03:45,457 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:45,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash -800434536, now seen corresponding path program 1 times [2024-11-12 20:03:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:45,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161812681] [2024-11-12 20:03:45,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:45,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:45,629 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-12 20:03:45,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161812681] [2024-11-12 20:03:45,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161812681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:45,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:03:45,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:03:45,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50605683] [2024-11-12 20:03:45,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:45,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:03:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:45,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:03:45,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:03:45,632 INFO L87 Difference]: Start difference. First operand 106 states and 120 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-12 20:03:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:45,639 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2024-11-12 20:03:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:03:45,639 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-12 20:03:45,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:45,640 INFO L225 Difference]: With dead ends: 124 [2024-11-12 20:03:45,640 INFO L226 Difference]: Without dead ends: 79 [2024-11-12 20:03:45,640 INFO L434 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-12 20:03:45,640 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 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-12 20:03:45,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:45,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-12 20:03:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-12 20:03:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 76 states have internal predecessors, (84), 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-12 20:03:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2024-11-12 20:03:45,648 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 50 [2024-11-12 20:03:45,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:45,648 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2024-11-12 20:03:45,648 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-12 20:03:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-11-12 20:03:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 20:03:45,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:45,649 INFO L218 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-12 20:03:45,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 20:03:45,649 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:45,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:45,650 INFO L85 PathProgramCache]: Analyzing trace with hash 441966575, now seen corresponding path program 1 times [2024-11-12 20:03:45,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:45,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804746551] [2024-11-12 20:03:45,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:45,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:45,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:45,776 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-12 20:03:45,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:45,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804746551] [2024-11-12 20:03:45,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804746551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:45,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:03:45,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:03:45,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970945602] [2024-11-12 20:03:45,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:45,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:03:45,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:45,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:03:45,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:03:45,778 INFO L87 Difference]: Start difference. First operand 79 states and 86 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-12 20:03:45,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:45,797 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-11-12 20:03:45,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:03:45,797 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-12 20:03:45,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:45,798 INFO L225 Difference]: With dead ends: 92 [2024-11-12 20:03:45,798 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 20:03:45,798 INFO L434 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-12 20:03:45,798 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 95 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-12 20:03:45,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 95 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:45,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 20:03:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-12 20:03:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 86 states have internal predecessors, (97), 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-12 20:03:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2024-11-12 20:03:45,803 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 50 [2024-11-12 20:03:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:45,803 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2024-11-12 20:03:45,803 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-12 20:03:45,803 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2024-11-12 20:03:45,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 20:03:45,804 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:45,804 INFO L218 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-12 20:03:45,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 20:03:45,804 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:45,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:45,805 INFO L85 PathProgramCache]: Analyzing trace with hash 441968304, now seen corresponding path program 1 times [2024-11-12 20:03:45,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:45,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361233697] [2024-11-12 20:03:45,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:45,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:45,898 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-12 20:03:45,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:45,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361233697] [2024-11-12 20:03:45,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361233697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:45,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:03:45,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:03:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779024550] [2024-11-12 20:03:45,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:45,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:03:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:45,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:03:45,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:03:45,900 INFO L87 Difference]: Start difference. First operand 89 states and 99 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-12 20:03:45,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:45,909 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-11-12 20:03:45,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:03:45,910 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-12 20:03:45,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:45,910 INFO L225 Difference]: With dead ends: 89 [2024-11-12 20:03:45,910 INFO L226 Difference]: Without dead ends: 88 [2024-11-12 20:03:45,910 INFO L434 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-12 20:03:45,911 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 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-12 20:03:45,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-12 20:03:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-11-12 20:03:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 81 states have internal predecessors, (91), 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-12 20:03:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-11-12 20:03:45,919 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 50 [2024-11-12 20:03:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:45,919 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-11-12 20:03:45,920 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-12 20:03:45,920 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-11-12 20:03:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 20:03:45,920 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:45,921 INFO L218 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] [2024-11-12 20:03:45,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 20:03:45,922 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:45,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:45,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1496638887, now seen corresponding path program 1 times [2024-11-12 20:03:45,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:45,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022011572] [2024-11-12 20:03:45,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:45,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:46,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:46,052 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-12 20:03:46,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:46,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022011572] [2024-11-12 20:03:46,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022011572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:46,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:03:46,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:03:46,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043892560] [2024-11-12 20:03:46,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:46,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:03:46,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:46,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:03:46,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:03:46,055 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12 20:03:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:46,069 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-11-12 20:03:46,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:03:46,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 53 [2024-11-12 20:03:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:46,070 INFO L225 Difference]: With dead ends: 93 [2024-11-12 20:03:46,070 INFO L226 Difference]: Without dead ends: 87 [2024-11-12 20:03:46,071 INFO L434 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-12 20:03:46,071 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 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-12 20:03:46,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:46,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-12 20:03:46,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-12 20:03:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.175) internal successors, (94), 84 states have internal predecessors, (94), 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-12 20:03:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-12 20:03:46,076 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 53 [2024-11-12 20:03:46,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:46,076 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-12 20:03:46,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12 20:03:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-12 20:03:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 20:03:46,077 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:46,077 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-12 20:03:46,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 20:03:46,077 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:46,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:46,081 INFO L85 PathProgramCache]: Analyzing trace with hash 313800151, now seen corresponding path program 1 times [2024-11-12 20:03:46,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:46,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673533010] [2024-11-12 20:03:46,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:46,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-12 20:03:46,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:46,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673533010] [2024-11-12 20:03:46,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673533010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:46,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401560005] [2024-11-12 20:03:46,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:46,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:46,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:46,191 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-12 20:03:46,192 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-12 20:03:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:46,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:03:46,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-12 20:03:46,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:03:46,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401560005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:46,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:03:46,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-12 20:03:46,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863896418] [2024-11-12 20:03:46,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:46,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:03:46,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:46,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:03:46,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:03:46,465 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-12 20:03:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:46,478 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-11-12 20:03:46,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:03:46,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 56 [2024-11-12 20:03:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:46,479 INFO L225 Difference]: With dead ends: 87 [2024-11-12 20:03:46,479 INFO L226 Difference]: Without dead ends: 86 [2024-11-12 20:03:46,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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-12 20:03:46,480 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:46,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-12 20:03:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-12 20:03:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 80 states have (on average 1.1625) internal successors, (93), 83 states have internal predecessors, (93), 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-12 20:03:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2024-11-12 20:03:46,483 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 56 [2024-11-12 20:03:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:46,484 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2024-11-12 20:03:46,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-12 20:03:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-11-12 20:03:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-12 20:03:46,484 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:46,485 INFO L218 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, 1, 1, 1] [2024-11-12 20:03:46,499 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-12 20:03:46,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:46,685 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:46,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:46,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1137870308, now seen corresponding path program 1 times [2024-11-12 20:03:46,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:46,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293766980] [2024-11-12 20:03:46,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:46,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:46,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:46,776 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-12 20:03:46,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:46,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293766980] [2024-11-12 20:03:46,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293766980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:46,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:03:46,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:03:46,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135480042] [2024-11-12 20:03:46,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:46,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:03:46,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:46,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:03:46,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:03:46,778 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-12 20:03:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:46,786 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-12 20:03:46,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:03:46,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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 57 [2024-11-12 20:03:46,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:46,787 INFO L225 Difference]: With dead ends: 86 [2024-11-12 20:03:46,787 INFO L226 Difference]: Without dead ends: 85 [2024-11-12 20:03:46,788 INFO L434 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-12 20:03:46,788 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 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-12 20:03:46,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-12 20:03:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2024-11-12 20:03:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.1538461538461537) internal successors, (90), 80 states have internal predecessors, (90), 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-12 20:03:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2024-11-12 20:03:46,791 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 57 [2024-11-12 20:03:46,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:46,791 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2024-11-12 20:03:46,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 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-12 20:03:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2024-11-12 20:03:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 20:03:46,792 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:46,792 INFO L218 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, 1, 1, 1] [2024-11-12 20:03:46,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 20:03:46,792 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:46,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:46,793 INFO L85 PathProgramCache]: Analyzing trace with hash 914187780, now seen corresponding path program 1 times [2024-11-12 20:03:46,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:46,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712217330] [2024-11-12 20:03:46,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:46,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:46,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-12 20:03:46,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:46,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712217330] [2024-11-12 20:03:46,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712217330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:46,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338853052] [2024-11-12 20:03:46,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:46,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:46,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:46,892 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-12 20:03:46,893 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-12 20:03:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:47,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:03:47,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:47,179 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-12 20:03:47,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:03:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-12 20:03:47,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338853052] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:03:47,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:03:47,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-12 20:03:47,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886035565] [2024-11-12 20:03:47,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:03:47,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 20:03:47,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:47,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 20:03:47,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:03:47,203 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-12 20:03:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:47,224 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2024-11-12 20:03:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:03:47,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-12 20:03:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:47,225 INFO L225 Difference]: With dead ends: 96 [2024-11-12 20:03:47,225 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 20:03:47,225 INFO L434 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-12 20:03:47,226 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:47,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 184 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 20:03:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 20:03:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 89 states have internal predecessors, (99), 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-12 20:03:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-11-12 20:03:47,229 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 58 [2024-11-12 20:03:47,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:47,230 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-11-12 20:03:47,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-12 20:03:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-11-12 20:03:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 20:03:47,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:47,230 INFO L218 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-12 20:03:47,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 20:03:47,431 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-12 20:03:47,431 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:47,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:47,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1414632936, now seen corresponding path program 1 times [2024-11-12 20:03:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:47,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922912668] [2024-11-12 20:03:47,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:47,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:47,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:47,556 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-12 20:03:47,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:47,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922912668] [2024-11-12 20:03:47,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922912668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:47,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868474154] [2024-11-12 20:03:47,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:47,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:47,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:47,559 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-12 20:03:47,560 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-12 20:03:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:47,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:03:47,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:47,837 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-12 20:03:47,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:03:47,850 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-12 20:03:47,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868474154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:03:47,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:03:47,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-12 20:03:47,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306902362] [2024-11-12 20:03:47,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:03:47,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 20:03:47,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:47,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 20:03:47,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:03:47,852 INFO L87 Difference]: Start difference. First operand 92 states and 101 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-12 20:03:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:47,875 INFO L93 Difference]: Finished difference Result 154 states and 175 transitions. [2024-11-12 20:03:47,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:03:47,875 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-12 20:03:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:47,876 INFO L225 Difference]: With dead ends: 154 [2024-11-12 20:03:47,876 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 20:03:47,877 INFO L434 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-12 20:03:47,877 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:47,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 139 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 20:03:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-12 20:03:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.1142857142857143) internal successors, (117), 107 states have internal predecessors, (117), 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-12 20:03:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2024-11-12 20:03:47,881 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 58 [2024-11-12 20:03:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:47,881 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2024-11-12 20:03:47,882 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-12 20:03:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2024-11-12 20:03:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 20:03:47,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:47,882 INFO L218 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] [2024-11-12 20:03:47,897 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-12 20:03:48,082 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-12 20:03:48,083 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:48,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash 169510356, now seen corresponding path program 2 times [2024-11-12 20:03:48,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:48,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279705602] [2024-11-12 20:03:48,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:48,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-12 20:03:48,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:48,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279705602] [2024-11-12 20:03:48,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279705602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:48,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492118312] [2024-11-12 20:03:48,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:03:48,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:48,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:48,254 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-12 20:03:48,255 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-12 20:03:48,507 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 20:03:48,508 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:03:48,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 20:03:48,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-11-12 20:03:48,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:03:48,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492118312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:48,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:03:48,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-12 20:03:48,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928736728] [2024-11-12 20:03:48,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:48,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 20:03:48,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:48,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 20:03:48,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-12 20:03:48,565 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-12 20:03:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:48,601 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2024-11-12 20:03:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:03:48,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 67 [2024-11-12 20:03:48,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:48,602 INFO L225 Difference]: With dead ends: 141 [2024-11-12 20:03:48,602 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 20:03:48,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-12 20:03:48,602 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 44 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:48,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 159 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 20:03:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-12 20:03:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.1047619047619048) internal successors, (116), 107 states have internal predecessors, (116), 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-12 20:03:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2024-11-12 20:03:48,607 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 67 [2024-11-12 20:03:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:48,608 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2024-11-12 20:03:48,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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-12 20:03:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2024-11-12 20:03:48,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-12 20:03:48,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:48,610 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:03:48,626 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-12 20:03:48,811 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-12 20:03:48,811 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:48,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash -967455130, now seen corresponding path program 2 times [2024-11-12 20:03:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:48,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370528894] [2024-11-12 20:03:48,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:48,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:48,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-11-12 20:03:48,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:48,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370528894] [2024-11-12 20:03:48,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370528894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:48,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596659197] [2024-11-12 20:03:48,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:03:48,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:48,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:48,981 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-12 20:03:48,982 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-12 20:03:49,351 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 20:03:49,351 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:03:49,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 1482 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 20:03:49,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-12 20:03:49,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:03:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-12 20:03:49,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596659197] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:03:49,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:03:49,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2024-11-12 20:03:49,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913199995] [2024-11-12 20:03:49,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:03:49,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 20:03:49,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 20:03:49,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-12 20:03:49,456 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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-12 20:03:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:49,694 INFO L93 Difference]: Finished difference Result 198 states and 225 transitions. [2024-11-12 20:03:49,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 20:03:49,695 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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 76 [2024-11-12 20:03:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:49,696 INFO L225 Difference]: With dead ends: 198 [2024-11-12 20:03:49,696 INFO L226 Difference]: Without dead ends: 145 [2024-11-12 20:03:49,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 20:03:49,697 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 9 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:49,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 205 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:03:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-12 20:03:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-12 20:03:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 141 states have (on average 1.070921985815603) internal successors, (151), 142 states have internal predecessors, (151), 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-12 20:03:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2024-11-12 20:03:49,705 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 76 [2024-11-12 20:03:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:49,705 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2024-11-12 20:03:49,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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-12 20:03:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2024-11-12 20:03:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-12 20:03:49,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:49,706 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1] [2024-11-12 20:03:49,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-12 20:03:49,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 20:03:49,907 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:49,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash -615859145, now seen corresponding path program 1 times [2024-11-12 20:03:49,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:49,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887739165] [2024-11-12 20:03:49,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 20:03:50,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:50,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887739165] [2024-11-12 20:03:50,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887739165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:50,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789048499] [2024-11-12 20:03:50,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:50,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:50,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:50,222 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-12 20:03:50,223 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-12 20:03:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:50,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 20:03:50,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 20:03:50,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:03:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 20:03:50,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789048499] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:03:50,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:03:50,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-12 20:03:50,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159236602] [2024-11-12 20:03:50,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:03:50,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 20:03:50,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:50,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 20:03:50,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-12 20:03:50,752 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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-12 20:03:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:50,814 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2024-11-12 20:03:50,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 20:03:50,814 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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 102 [2024-11-12 20:03:50,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:50,815 INFO L225 Difference]: With dead ends: 167 [2024-11-12 20:03:50,815 INFO L226 Difference]: Without dead ends: 163 [2024-11-12 20:03:50,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-12 20:03:50,816 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 92 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:50,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 92 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:03:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-12 20:03:50,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-12 20:03:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 159 states have (on average 1.0628930817610063) internal successors, (169), 160 states have internal predecessors, (169), 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-12 20:03:50,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2024-11-12 20:03:50,821 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 171 transitions. Word has length 102 [2024-11-12 20:03:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:50,822 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 171 transitions. [2024-11-12 20:03:50,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 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-12 20:03:50,822 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2024-11-12 20:03:50,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 20:03:50,822 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:50,823 INFO L218 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-12 20:03:50,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-12 20:03:51,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:51,025 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:51,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:51,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1015277946, now seen corresponding path program 1 times [2024-11-12 20:03:51,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:51,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022961632] [2024-11-12 20:03:51,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:51,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:51,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:51,283 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-12 20:03:51,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:51,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022961632] [2024-11-12 20:03:51,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022961632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:51,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285670674] [2024-11-12 20:03:51,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:51,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:51,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:51,286 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-12 20:03:51,297 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-12 20:03:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:51,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 1759 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:03:51,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:51,848 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-12 20:03:51,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:03:51,937 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-12 20:03:51,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285670674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:03:51,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:03:51,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-12 20:03:51,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818108074] [2024-11-12 20:03:51,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:03:51,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 20:03:51,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:51,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 20:03:51,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:03:51,940 INFO L87 Difference]: Start difference. First operand 163 states and 171 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-12 20:03:52,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:52,001 INFO L93 Difference]: Finished difference Result 269 states and 285 transitions. [2024-11-12 20:03:52,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:03:52,001 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-12 20:03:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:52,003 INFO L225 Difference]: With dead ends: 269 [2024-11-12 20:03:52,003 INFO L226 Difference]: Without dead ends: 268 [2024-11-12 20:03:52,007 INFO L434 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-12 20:03:52,008 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:52,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-12 20:03:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-12 20:03:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 264 states have (on average 1.0606060606060606) internal successors, (280), 265 states have internal predecessors, (280), 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-12 20:03:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 282 transitions. [2024-11-12 20:03:52,020 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 282 transitions. Word has length 113 [2024-11-12 20:03:52,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:52,020 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 282 transitions. [2024-11-12 20:03:52,020 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-12 20:03:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 282 transitions. [2024-11-12 20:03:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 20:03:52,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:52,022 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1] [2024-11-12 20:03:52,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-12 20:03:52,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:52,223 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:52,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:52,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2026995575, now seen corresponding path program 2 times [2024-11-12 20:03:52,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:52,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283176853] [2024-11-12 20:03:52,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:52,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:52,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 20:03:52,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:52,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283176853] [2024-11-12 20:03:52,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283176853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:52,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54670586] [2024-11-12 20:03:52,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:03:52,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:52,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:52,630 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-12 20:03:52,631 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-12 20:03:52,982 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 20:03:52,982 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:03:52,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:03:52,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-12 20:03:52,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:03:52,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54670586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:52,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:03:52,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2024-11-12 20:03:52,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203491218] [2024-11-12 20:03:52,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:52,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:03:52,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:52,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:03:52,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-11-12 20:03:52,999 INFO L87 Difference]: Start difference. First operand 268 states and 282 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-12 20:03:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:53,015 INFO L93 Difference]: Finished difference Result 306 states and 321 transitions. [2024-11-12 20:03:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:03:53,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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 120 [2024-11-12 20:03:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:53,016 INFO L225 Difference]: With dead ends: 306 [2024-11-12 20:03:53,016 INFO L226 Difference]: Without dead ends: 269 [2024-11-12 20:03:53,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-11-12 20:03:53,017 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 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-12 20:03:53,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-12 20:03:53,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-12 20:03:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 265 states have (on average 1.060377358490566) internal successors, (281), 266 states have internal predecessors, (281), 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-12 20:03:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 283 transitions. [2024-11-12 20:03:53,025 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 283 transitions. Word has length 120 [2024-11-12 20:03:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:53,026 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 283 transitions. [2024-11-12 20:03:53,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-12 20:03:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 283 transitions. [2024-11-12 20:03:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 20:03:53,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:53,027 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1] [2024-11-12 20:03:53,042 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-12 20:03:53,227 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,SelfDestructingSolverStorable20 [2024-11-12 20:03:53,228 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:53,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:53,228 INFO L85 PathProgramCache]: Analyzing trace with hash 997636277, now seen corresponding path program 1 times [2024-11-12 20:03:53,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:53,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984264207] [2024-11-12 20:03:53,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:53,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-12 20:03:53,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:53,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984264207] [2024-11-12 20:03:53,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984264207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:03:53,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:03:53,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 20:03:53,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826105153] [2024-11-12 20:03:53,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:03:53,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:03:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:53,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:03:53,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:03:53,531 INFO L87 Difference]: Start difference. First operand 269 states and 283 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-12 20:03:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:53,579 INFO L93 Difference]: Finished difference Result 313 states and 329 transitions. [2024-11-12 20:03:53,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:03:53,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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 120 [2024-11-12 20:03:53,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:53,580 INFO L225 Difference]: With dead ends: 313 [2024-11-12 20:03:53,580 INFO L226 Difference]: Without dead ends: 274 [2024-11-12 20:03:53,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:03:53,581 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:53,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 168 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:03:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-12 20:03:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2024-11-12 20:03:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 267 states have (on average 1.0599250936329587) internal successors, (283), 268 states have internal predecessors, (283), 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-12 20:03:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 285 transitions. [2024-11-12 20:03:53,588 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 285 transitions. Word has length 120 [2024-11-12 20:03:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:53,589 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 285 transitions. [2024-11-12 20:03:53,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-12 20:03:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 285 transitions. [2024-11-12 20:03:53,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-12 20:03:53,589 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:53,590 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1] [2024-11-12 20:03:53,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 20:03:53,590 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:53,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:53,590 INFO L85 PathProgramCache]: Analyzing trace with hash -563744935, now seen corresponding path program 1 times [2024-11-12 20:03:53,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:53,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773199670] [2024-11-12 20:03:53,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:53,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:53,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 20:03:53,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:53,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773199670] [2024-11-12 20:03:53,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773199670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:53,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948084390] [2024-11-12 20:03:53,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:53,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:53,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:53,979 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-12 20:03:53,980 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-12 20:03:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:54,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 1747 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 20:03:54,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 20:03:54,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:03:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 20:03:54,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948084390] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:03:54,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:03:54,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-12 20:03:54,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370240134] [2024-11-12 20:03:54,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:03:54,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 20:03:54,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:54,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 20:03:54,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-12 20:03:54,643 INFO L87 Difference]: Start difference. First operand 271 states and 285 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 25 states have internal predecessors, (101), 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-12 20:03:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:54,726 INFO L93 Difference]: Finished difference Result 311 states and 336 transitions. [2024-11-12 20:03:54,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 20:03:54,726 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 25 states have internal predecessors, (101), 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 121 [2024-11-12 20:03:54,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:54,727 INFO L225 Difference]: With dead ends: 311 [2024-11-12 20:03:54,728 INFO L226 Difference]: Without dead ends: 307 [2024-11-12 20:03:54,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-12 20:03:54,729 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:54,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 224 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:03:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-12 20:03:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-12 20:03:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 303 states have (on average 1.0528052805280528) internal successors, (319), 304 states have internal predecessors, (319), 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-12 20:03:54,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 321 transitions. [2024-11-12 20:03:54,740 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 321 transitions. Word has length 121 [2024-11-12 20:03:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:54,741 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 321 transitions. [2024-11-12 20:03:54,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 25 states have internal predecessors, (101), 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-12 20:03:54,741 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 321 transitions. [2024-11-12 20:03:54,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-12 20:03:54,742 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:54,742 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 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, 1, 1, 1] [2024-11-12 20:03:54,762 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-12 20:03:54,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:54,943 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:54,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:54,944 INFO L85 PathProgramCache]: Analyzing trace with hash 284015833, now seen corresponding path program 2 times [2024-11-12 20:03:54,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:54,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957817694] [2024-11-12 20:03:54,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:55,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 20:03:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:03:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 20:03:55,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:03:55,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957817694] [2024-11-12 20:03:55,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957817694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:03:55,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662493293] [2024-11-12 20:03:55,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:03:55,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:55,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:03:55,852 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-12 20:03:55,853 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-12 20:03:56,405 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 20:03:56,405 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:03:56,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1975 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 20:03:56,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:03:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 20:03:56,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:03:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 20:03:57,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662493293] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:03:57,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:03:57,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 45 [2024-11-12 20:03:57,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254226759] [2024-11-12 20:03:57,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:03:57,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-12 20:03:57,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:03:57,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-12 20:03:57,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2024-11-12 20:03:57,091 INFO L87 Difference]: Start difference. First operand 307 states and 321 transitions. Second operand has 45 states, 45 states have (on average 3.6444444444444444) internal successors, (164), 45 states have internal predecessors, (164), 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-12 20:03:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:03:57,263 INFO L93 Difference]: Finished difference Result 371 states and 404 transitions. [2024-11-12 20:03:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-12 20:03:57,264 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.6444444444444444) internal successors, (164), 45 states have internal predecessors, (164), 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 157 [2024-11-12 20:03:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:03:57,265 INFO L225 Difference]: With dead ends: 371 [2024-11-12 20:03:57,266 INFO L226 Difference]: Without dead ends: 367 [2024-11-12 20:03:57,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 292 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2024-11-12 20:03:57,267 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:03:57,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 268 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:03:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-12 20:03:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2024-11-12 20:03:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 363 states have (on average 1.044077134986226) internal successors, (379), 364 states have internal predecessors, (379), 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-12 20:03:57,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 381 transitions. [2024-11-12 20:03:57,281 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 381 transitions. Word has length 157 [2024-11-12 20:03:57,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:03:57,281 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 381 transitions. [2024-11-12 20:03:57,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.6444444444444444) internal successors, (164), 45 states have internal predecessors, (164), 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-12 20:03:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 381 transitions. [2024-11-12 20:03:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-12 20:03:57,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:03:57,288 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 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, 1, 1, 1] [2024-11-12 20:03:57,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-12 20:03:57,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:03:57,489 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:03:57,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:03:57,490 INFO L85 PathProgramCache]: Analyzing trace with hash -65465511, now seen corresponding path program 3 times [2024-11-12 20:03:57,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:03:57,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17149062] [2024-11-12 20:03:57,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:03:57,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:03:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:03:57,931 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 20:03:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 20:03:58,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 20:03:58,339 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 20:03:58,339 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE (24 of 25 remaining) [2024-11-12 20:03:58,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2024-11-12 20:03:58,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2024-11-12 20:03:58,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2024-11-12 20:03:58,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2024-11-12 20:03:58,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2024-11-12 20:03:58,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2024-11-12 20:03:58,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2024-11-12 20:03:58,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2024-11-12 20:03:58,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2024-11-12 20:03:58,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2024-11-12 20:03:58,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2024-11-12 20:03:58,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2024-11-12 20:03:58,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2024-11-12 20:03:58,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2024-11-12 20:03:58,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2024-11-12 20:03:58,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2024-11-12 20:03:58,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2024-11-12 20:03:58,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2024-11-12 20:03:58,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2024-11-12 20:03:58,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2024-11-12 20:03:58,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2024-11-12 20:03:58,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2024-11-12 20:03:58,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2024-11-12 20:03:58,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2024-11-12 20:03:58,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 20:03:58,346 INFO L421 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:03:58,442 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 20:03:58,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:03:58 BoogieIcfgContainer [2024-11-12 20:03:58,445 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 20:03:58,445 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 20:03:58,445 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 20:03:58,445 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 20:03:58,446 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:03:41" (3/4) ... [2024-11-12 20:03:58,448 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 20:03:58,448 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 20:03:58,449 INFO L158 Benchmark]: Toolchain (without parser) took 18774.45ms. Allocated memory was 180.4MB in the beginning and 503.3MB in the end (delta: 323.0MB). Free memory was 106.0MB in the beginning and 228.3MB in the end (delta: -122.3MB). Peak memory consumption was 202.2MB. Max. memory is 16.1GB. [2024-11-12 20:03:58,449 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory was 89.6MB in the beginning and 89.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:03:58,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 695.69ms. Allocated memory is still 180.4MB. Free memory was 105.8MB in the beginning and 124.8MB in the end (delta: -19.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-12 20:03:58,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.68ms. Allocated memory is still 180.4MB. Free memory was 124.8MB in the beginning and 118.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 20:03:58,449 INFO L158 Benchmark]: Boogie Preprocessor took 107.59ms. Allocated memory is still 180.4MB. Free memory was 118.5MB in the beginning and 110.9MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 20:03:58,450 INFO L158 Benchmark]: RCFGBuilder took 706.56ms. Allocated memory is still 180.4MB. Free memory was 110.9MB in the beginning and 127.6MB in the end (delta: -16.7MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2024-11-12 20:03:58,451 INFO L158 Benchmark]: TraceAbstraction took 17168.77ms. Allocated memory was 180.4MB in the beginning and 503.3MB in the end (delta: 323.0MB). Free memory was 127.6MB in the beginning and 228.3MB in the end (delta: -100.7MB). Peak memory consumption was 223.3MB. Max. memory is 16.1GB. [2024-11-12 20:03:58,452 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 503.3MB. Free memory is still 228.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 20:03:58,453 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.17ms. Allocated memory is still 125.8MB. Free memory was 89.6MB in the beginning and 89.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 695.69ms. Allocated memory is still 180.4MB. Free memory was 105.8MB in the beginning and 124.8MB in the end (delta: -19.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.68ms. Allocated memory is still 180.4MB. Free memory was 124.8MB in the beginning and 118.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.59ms. Allocated memory is still 180.4MB. Free memory was 118.5MB in the beginning and 110.9MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 706.56ms. Allocated memory is still 180.4MB. Free memory was 110.9MB in the beginning and 127.6MB in the end (delta: -16.7MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17168.77ms. Allocated memory was 180.4MB in the beginning and 503.3MB in the end (delta: 323.0MB). Free memory was 127.6MB in the beginning and 228.3MB in the end (delta: -100.7MB). Peak memory consumption was 223.3MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 503.3MB. Free memory is still 228.3MB. 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: 1162]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of fflush at line 1162. Possible FailurePath: [L1136] static const char *applet_name; [L1137] static signed int bb_errno_location; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1235] static char dir[42]; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; [L1241] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1304] char *a = malloc(11); [L1305] a[10] = 0 [L1306] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=0] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=1] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=2] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=3] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=4] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=5] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=6] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=7] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=8] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=9] [L1306] COND TRUE i<10 [L1307] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1306] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=10] [L1306] COND FALSE !(i<10) VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}] [L1308] applet_name = a [L1309] bb_errno_location = __VERIFIER_nondet_int() [L1310] optind = 1 [L1311] int argc = __VERIFIER_nondet_int(); [L1312] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, optind=1] [L1312] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=1, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, optind=1] [L1313] EXPR argc+1 [L1313] char **argv=malloc((argc+1)*sizeof(char*)); [L1314] EXPR argc+1 [L1314] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1315] argv[argc]=0 [L1316] int i=0; VAL [applet_name={-1:0}, argc=1, argv={-12:0}, bb_errno_location=0, dir={11:0}, dummy_utmp={12:0}, i=0, mem_track={-13:0}, optind=1] [L1316] COND TRUE i 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 -> deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 [2024-11-12 20:04:00,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:04:00,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:04:00,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:04:00,585 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:04:00,585 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:04:00,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-12 20:04:01,844 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:04:02,088 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:04:02,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-12 20:04:02,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d358a5b/4726edab1ee3425d8c9a7230fbf613b0/FLAG651913c33 [2024-11-12 20:04:02,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d358a5b/4726edab1ee3425d8c9a7230fbf613b0 [2024-11-12 20:04:02,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:04:02,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:04:02,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:04:02,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:04:02,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:04:02,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:04:02" (1/1) ... [2024-11-12 20:04:02,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bcf0196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02, skipping insertion in model container [2024-11-12 20:04:02,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:04:02" (1/1) ... [2024-11-12 20:04:02,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:04:02,618 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-12 20:04:02,628 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-12 20:04:02,629 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-12 20:04:02,637 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-12 20:04:02,644 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-12 20:04:02,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:04:02,680 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:04:02,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:04:02,864 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:04:02,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02 WrapperNode [2024-11-12 20:04:02,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:04:02,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:04:02,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:04:02,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:04:02,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02" (1/1) ... [2024-11-12 20:04:02,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02" (1/1) ... [2024-11-12 20:04:02,948 INFO L138 Inliner]: procedures = 351, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 663 [2024-11-12 20:04:02,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:04:02,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:04:02,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:04:02,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:04:02,957 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02" (1/1) ... [2024-11-12 20:04:02,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02" (1/1) ... [2024-11-12 20:04:02,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02" (1/1) ... [2024-11-12 20:04:02,995 INFO L175 MemorySlicer]: Split 450 memory accesses to 15 slices as follows [2, 3, 2, 3, 6, 3, 11, 4, 4, 4, 4, 2, 3, 44, 355]. 79 percent of accesses are in the largest equivalence class. The 423 initializations are split as follows [2, 3, 0, 3, 0, 3, 0, 3, 3, 3, 3, 0, 3, 42, 355]. The 9 writes are split as follows [0, 0, 2, 0, 2, 0, 2, 0, 0, 0, 0, 1, 0, 2, 0]. [2024-11-12 20:04:02,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02" (1/1) ... [2024-11-12 20:04:02,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02" (1/1) ... [2024-11-12 20:04:03,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02" (1/1) ... [2024-11-12 20:04:03,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02" (1/1) ... [2024-11-12 20:04:03,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02" (1/1) ... [2024-11-12 20:04:03,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02" (1/1) ... [2024-11-12 20:04:03,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:04:03,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:04:03,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:04:03,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:04:03,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02" (1/1) ... [2024-11-12 20:04:03,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:04:03,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:04:03,098 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-12 20:04:03,100 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-12 20:04:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 20:04:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 20:04:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 20:04:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-12 20:04:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-12 20:04:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-12 20:04:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-12 20:04:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-12 20:04:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-12 20:04:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-12 20:04:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 20:04:03,134 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-12 20:04:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-12 20:04:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-12 20:04:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-12 20:04:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-12 20:04:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-12 20:04:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-12 20:04:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 20:04:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 20:04:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-12 20:04:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-12 20:04:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-12 20:04:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-12 20:04:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-12 20:04:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-12 20:04:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-12 20:04:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-12 20:04:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-12 20:04:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-12 20:04:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-12 20:04:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-12 20:04:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-12 20:04:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 20:04:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-12 20:04:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-12 20:04:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-12 20:04:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-12 20:04:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-12 20:04:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-12 20:04:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-12 20:04:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-12 20:04:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-12 20:04:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-12 20:04:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-12 20:04:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-12 20:04:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-12 20:04:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-12 20:04:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-11-12 20:04:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 20:04:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 20:04:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 20:04:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-12 20:04:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-12 20:04:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-12 20:04:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-12 20:04:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-12 20:04:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-12 20:04:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-12 20:04:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-12 20:04:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-12 20:04:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-12 20:04:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-12 20:04:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-12 20:04:03,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 20:04:03,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 20:04:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-12 20:04:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-12 20:04:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-12 20:04:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-12 20:04:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-12 20:04:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-12 20:04:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-12 20:04:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-12 20:04:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-12 20:04:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-12 20:04:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-12 20:04:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-12 20:04:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:04:03,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:04:03,368 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:04:03,370 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:04:03,970 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-12 20:04:03,971 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:04:03,984 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:04:03,984 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-12 20:04:03,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:04:03 BoogieIcfgContainer [2024-11-12 20:04:03,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:04:03,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 20:04:03,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 20:04:03,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 20:04:03,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:04:02" (1/3) ... [2024-11-12 20:04:03,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c3284c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:04:03, skipping insertion in model container [2024-11-12 20:04:03,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:04:02" (2/3) ... [2024-11-12 20:04:03,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c3284c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:04:03, skipping insertion in model container [2024-11-12 20:04:03,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:04:03" (3/3) ... [2024-11-12 20:04:03,991 INFO L112 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2024-11-12 20:04:04,003 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 20:04:04,003 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-12 20:04:04,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 20:04:04,057 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;@8c1041b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 20:04:04,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-12 20:04:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 90 states have internal predecessors, (115), 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-12 20:04:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-12 20:04:04,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:04,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-12 20:04:04,067 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:04,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:04,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-12 20:04:04,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:04,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032299091] [2024-11-12 20:04:04,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:04,087 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-12 20:04:04,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:04,090 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-12 20:04:04,091 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-12 20:04:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:04,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 20:04:04,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:04,403 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-12 20:04:04,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:04:04,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:04,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032299091] [2024-11-12 20:04:04,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032299091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:04:04,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:04:04,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 20:04:04,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253265712] [2024-11-12 20:04:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:04:04,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 20:04:04,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:04,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 20:04:04,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:04:04,429 INFO L87 Difference]: Start difference. First operand has 93 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 90 states have internal predecessors, (115), 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) 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-12 20:04:04,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:04,449 INFO L93 Difference]: Finished difference Result 154 states and 214 transitions. [2024-11-12 20:04:04,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 20:04:04,450 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-12 20:04:04,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:04,457 INFO L225 Difference]: With dead ends: 154 [2024-11-12 20:04:04,457 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 20:04:04,460 INFO L434 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-12 20:04:04,463 INFO L435 NwaCegarLoop]: 81 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, 81 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-12 20:04:04,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:04:04,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 20:04:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-12 20:04:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 64 states have internal predecessors, (79), 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-12 20:04:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2024-11-12 20:04:04,512 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 4 [2024-11-12 20:04:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:04,512 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-11-12 20:04:04,512 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-12 20:04:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2024-11-12 20:04:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 20:04:04,513 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:04,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 20:04:04,523 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-12 20:04:04,713 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-12 20:04:04,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:04,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:04,715 INFO L85 PathProgramCache]: Analyzing trace with hash 36333200, now seen corresponding path program 1 times [2024-11-12 20:04:04,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:04,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677635315] [2024-11-12 20:04:04,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:04,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 20:04:04,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:04,719 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-12 20:04:04,720 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-12 20:04:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:05,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:04:05,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:05,027 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-12 20:04:05,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:04:05,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:05,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677635315] [2024-11-12 20:04:05,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677635315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:04:05,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:04:05,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:04:05,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137712066] [2024-11-12 20:04:05,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:04:05,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:04:05,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:05,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:04:05,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:04:05,033 INFO L87 Difference]: Start difference. First operand 67 states and 81 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-12 20:04:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:05,075 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2024-11-12 20:04:05,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:04:05,076 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-12 20:04:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:05,077 INFO L225 Difference]: With dead ends: 132 [2024-11-12 20:04:05,078 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 20:04:05,078 INFO L434 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-12 20:04:05,080 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 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-12 20:04:05,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:04:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 20:04:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-12 20:04:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 67 states have internal predecessors, (82), 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-12 20:04:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2024-11-12 20:04:05,092 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 5 [2024-11-12 20:04:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:05,092 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2024-11-12 20:04:05,092 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-12 20:04:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2024-11-12 20:04:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 20:04:05,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:05,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-12 20:04:05,104 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-12 20:04:05,294 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-12 20:04:05,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:05,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:05,295 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-12 20:04:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:05,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933573244] [2024-11-12 20:04:05,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:05,296 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-12 20:04:05,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:05,299 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-12 20:04:05,300 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-12 20:04:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:05,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:04:05,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:05,588 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-12 20:04:05,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:04:05,624 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-12 20:04:05,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:05,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933573244] [2024-11-12 20:04:05,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933573244] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:04:05,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 20:04:05,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-12 20:04:05,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179046778] [2024-11-12 20:04:05,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 20:04:05,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 20:04:05,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:05,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 20:04:05,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:04:05,627 INFO L87 Difference]: Start difference. First operand 70 states and 84 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-12 20:04:05,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:05,701 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2024-11-12 20:04:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:04:05,702 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-12 20:04:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:05,703 INFO L225 Difference]: With dead ends: 135 [2024-11-12 20:04:05,703 INFO L226 Difference]: Without dead ends: 73 [2024-11-12 20:04:05,703 INFO L434 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-12 20:04:05,704 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 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.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:04:05,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:04:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-12 20:04:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-11-12 20:04:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 67 states have internal predecessors, (82), 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-12 20:04:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2024-11-12 20:04:05,713 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 8 [2024-11-12 20:04:05,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:05,713 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2024-11-12 20:04:05,713 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-12 20:04:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2024-11-12 20:04:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 20:04:05,714 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:05,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:04:05,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-12 20:04:05,918 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-12 20:04:05,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:05,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash 894156632, now seen corresponding path program 1 times [2024-11-12 20:04:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:05,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036337005] [2024-11-12 20:04:05,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:05,921 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-12 20:04:05,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:05,922 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-12 20:04:05,923 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-12 20:04:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:06,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:04:06,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:06,176 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-12 20:04:06,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:04:06,221 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-12 20:04:06,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:06,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036337005] [2024-11-12 20:04:06,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036337005] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:04:06,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 20:04:06,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 20:04:06,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691795603] [2024-11-12 20:04:06,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 20:04:06,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 20:04:06,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:06,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 20:04:06,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:04:06,224 INFO L87 Difference]: Start difference. First operand 70 states and 84 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-12 20:04:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:06,315 INFO L93 Difference]: Finished difference Result 143 states and 174 transitions. [2024-11-12 20:04:06,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 20:04:06,316 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-12 20:04:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:06,316 INFO L225 Difference]: With dead ends: 143 [2024-11-12 20:04:06,316 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 20:04:06,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:04:06,317 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 8 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:04:06,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 373 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:04:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 20:04:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-12 20:04:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 79 states have internal predecessors, (94), 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-12 20:04:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2024-11-12 20:04:06,327 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 17 [2024-11-12 20:04:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:06,327 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2024-11-12 20:04:06,327 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-12 20:04:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2024-11-12 20:04:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 20:04:06,328 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:06,328 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:04:06,337 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 (5)] Ended with exit code 0 [2024-11-12 20:04:06,528 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-12 20:04:06,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:06,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash -742370088, now seen corresponding path program 2 times [2024-11-12 20:04:06,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:06,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700242742] [2024-11-12 20:04:06,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:04:06,530 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-12 20:04:06,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:06,534 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-12 20:04:06,534 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-12 20:04:06,766 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 20:04:06,767 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:04:06,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:04:06,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:06,810 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-12 20:04:06,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:04:06,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:06,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700242742] [2024-11-12 20:04:06,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700242742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:04:06,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:04:06,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:04:06,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383445047] [2024-11-12 20:04:06,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:04:06,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:04:06,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:06,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:04:06,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:04:06,813 INFO L87 Difference]: Start difference. First operand 82 states and 96 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-12 20:04:07,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:07,071 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-11-12 20:04:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:04:07,072 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-12 20:04:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:07,073 INFO L225 Difference]: With dead ends: 82 [2024-11-12 20:04:07,073 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 20:04:07,077 INFO L434 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-12 20:04:07,078 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 65 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 20:04:07,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 210 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 20:04:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 20:04:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-12 20:04:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 77 states have internal predecessors, (92), 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-12 20:04:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-12 20:04:07,086 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 29 [2024-11-12 20:04:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:07,086 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-12 20:04:07,086 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-12 20:04:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-11-12 20:04:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-12 20:04:07,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:07,087 INFO L218 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-12 20:04:07,096 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-12 20:04:07,287 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-12 20:04:07,288 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:07,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:07,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1569821756, now seen corresponding path program 1 times [2024-11-12 20:04:07,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:07,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630077688] [2024-11-12 20:04:07,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:07,289 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-12 20:04:07,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:07,292 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-12 20:04:07,292 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-12 20:04:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:07,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 20:04:07,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:07,699 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-12 20:04:07,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:04:07,847 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-12 20:04:07,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:07,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630077688] [2024-11-12 20:04:07,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630077688] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:04:07,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 20:04:07,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-12 20:04:07,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967639748] [2024-11-12 20:04:07,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 20:04:07,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 20:04:07,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:07,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 20:04:07,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-12 20:04:07,850 INFO L87 Difference]: Start difference. First operand 80 states and 94 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-12 20:04:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:08,094 INFO L93 Difference]: Finished difference Result 151 states and 182 transitions. [2024-11-12 20:04:08,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 20:04:08,095 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-12 20:04:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:08,096 INFO L225 Difference]: With dead ends: 151 [2024-11-12 20:04:08,096 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 20:04:08,096 INFO L434 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-12 20:04:08,097 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 10 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:04:08,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 723 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:04:08,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 20:04:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 20:04:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 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-12 20:04:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2024-11-12 20:04:08,102 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 35 [2024-11-12 20:04:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:08,103 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2024-11-12 20:04:08,103 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-12 20:04:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2024-11-12 20:04:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-12 20:04:08,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:08,104 INFO L218 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-12 20:04:08,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-12 20:04:08,304 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-12 20:04:08,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:08,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:08,305 INFO L85 PathProgramCache]: Analyzing trace with hash 200843588, now seen corresponding path program 2 times [2024-11-12 20:04:08,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736997301] [2024-11-12 20:04:08,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:04:08,306 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-12 20:04:08,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:08,307 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-12 20:04:08,308 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-12 20:04:08,583 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 20:04:08,583 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:04:08,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:04:08,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:08,603 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-12 20:04:08,603 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:04:08,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736997301] [2024-11-12 20:04:08,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736997301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:04:08,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:04:08,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:04:08,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650889426] [2024-11-12 20:04:08,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:04:08,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:04:08,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:08,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:04:08,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:04:08,605 INFO L87 Difference]: Start difference. First operand 92 states and 106 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-12 20:04:08,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:08,631 INFO L93 Difference]: Finished difference Result 144 states and 173 transitions. [2024-11-12 20:04:08,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:04:08,631 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-12 20:04:08,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:08,632 INFO L225 Difference]: With dead ends: 144 [2024-11-12 20:04:08,632 INFO L226 Difference]: Without dead ends: 95 [2024-11-12 20:04:08,632 INFO L434 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-12 20:04:08,633 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 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-12 20:04:08,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:04:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-12 20:04:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-12 20:04:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 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-12 20:04:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2024-11-12 20:04:08,641 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 47 [2024-11-12 20:04:08,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:08,641 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2024-11-12 20:04:08,641 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-12 20:04:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2024-11-12 20:04:08,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 20:04:08,642 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:08,642 INFO L218 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-12 20:04:08,654 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-12 20:04:08,842 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-12 20:04:08,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:08,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:08,843 INFO L85 PathProgramCache]: Analyzing trace with hash 441968304, now seen corresponding path program 1 times [2024-11-12 20:04:08,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:08,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079858772] [2024-11-12 20:04:08,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:08,844 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-12 20:04:08,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:08,845 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-12 20:04:08,845 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-12 20:04:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:09,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:04:09,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:09,184 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-12 20:04:09,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:04:09,227 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-12 20:04:09,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:09,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079858772] [2024-11-12 20:04:09,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079858772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:04:09,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 20:04:09,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-12 20:04:09,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204243770] [2024-11-12 20:04:09,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 20:04:09,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 20:04:09,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:09,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 20:04:09,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:04:09,228 INFO L87 Difference]: Start difference. First operand 95 states and 109 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-12 20:04:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:09,319 INFO L93 Difference]: Finished difference Result 150 states and 181 transitions. [2024-11-12 20:04:09,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:04:09,319 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-12 20:04:09,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:09,320 INFO L225 Difference]: With dead ends: 150 [2024-11-12 20:04:09,320 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 20:04:09,321 INFO L434 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-12 20:04:09,323 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 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-12 20:04:09,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:04:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 20:04:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2024-11-12 20:04:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 89 states have (on average 1.202247191011236) internal successors, (107), 92 states have internal predecessors, (107), 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-12 20:04:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2024-11-12 20:04:09,332 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 50 [2024-11-12 20:04:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:09,332 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2024-11-12 20:04:09,332 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-12 20:04:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2024-11-12 20:04:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 20:04:09,333 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:09,334 INFO L218 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] [2024-11-12 20:04:09,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-12 20:04:09,534 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-12 20:04:09,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:09,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash -848834540, now seen corresponding path program 1 times [2024-11-12 20:04:09,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:09,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605633307] [2024-11-12 20:04:09,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:09,536 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-12 20:04:09,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:09,537 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-12 20:04:09,538 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-12 20:04:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:09,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:04:09,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:09,858 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-12 20:04:09,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:04:09,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:09,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605633307] [2024-11-12 20:04:09,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605633307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:04:09,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:04:09,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:04:09,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587173280] [2024-11-12 20:04:09,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:04:09,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:04:09,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:09,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:04:09,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:04:09,860 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-12 20:04:09,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:09,881 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2024-11-12 20:04:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:04:09,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-12 20:04:09,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:09,883 INFO L225 Difference]: With dead ends: 106 [2024-11-12 20:04:09,883 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 20:04:09,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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-12 20:04:09,884 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 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-12 20:04:09,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:04:09,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 20:04:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-12 20:04:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 90 states have (on average 1.2) internal successors, (108), 93 states have internal predecessors, (108), 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-12 20:04:09,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2024-11-12 20:04:09,895 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 54 [2024-11-12 20:04:09,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:09,895 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2024-11-12 20:04:09,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-12 20:04:09,895 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2024-11-12 20:04:09,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 20:04:09,896 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:09,896 INFO L218 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] [2024-11-12 20:04:09,909 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-12 20:04:10,096 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-12 20:04:10,097 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:10,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:10,097 INFO L85 PathProgramCache]: Analyzing trace with hash 926172822, now seen corresponding path program 1 times [2024-11-12 20:04:10,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:10,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883579437] [2024-11-12 20:04:10,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:10,098 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-12 20:04:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:10,107 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-12 20:04:10,108 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-12 20:04:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:10,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 20:04:10,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:10,490 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-12 20:04:10,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:04:10,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:10,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883579437] [2024-11-12 20:04:10,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883579437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:04:10,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:04:10,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 20:04:10,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416612627] [2024-11-12 20:04:10,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:04:10,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:04:10,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:10,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:04:10,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:04:10,492 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-12 20:04:10,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:10,692 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-11-12 20:04:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:04:10,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-12 20:04:10,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:10,693 INFO L225 Difference]: With dead ends: 113 [2024-11-12 20:04:10,693 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 20:04:10,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:04:10,694 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 4 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:04:10,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 270 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:04:10,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 20:04:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-12 20:04:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.1956521739130435) internal successors, (110), 95 states have internal predecessors, (110), 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-12 20:04:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2024-11-12 20:04:10,699 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 54 [2024-11-12 20:04:10,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:10,699 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2024-11-12 20:04:10,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-12 20:04:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2024-11-12 20:04:10,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 20:04:10,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:10,700 INFO L218 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-12 20:04:10,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-12 20:04:10,901 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-12 20:04:10,901 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:10,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:10,901 INFO L85 PathProgramCache]: Analyzing trace with hash -909455939, now seen corresponding path program 1 times [2024-11-12 20:04:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:10,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797324444] [2024-11-12 20:04:10,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:10,902 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-12 20:04:10,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:10,905 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-12 20:04:10,906 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-12 20:04:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:11,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:04:11,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:11,260 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-12 20:04:11,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:04:11,293 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-12 20:04:11,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:11,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797324444] [2024-11-12 20:04:11,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797324444] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:04:11,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 20:04:11,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 20:04:11,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641662872] [2024-11-12 20:04:11,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 20:04:11,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 20:04:11,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:11,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 20:04:11,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:04:11,295 INFO L87 Difference]: Start difference. First operand 98 states and 112 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-12 20:04:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:11,469 INFO L93 Difference]: Finished difference Result 165 states and 196 transitions. [2024-11-12 20:04:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 20:04:11,469 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-12 20:04:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:11,470 INFO L225 Difference]: With dead ends: 165 [2024-11-12 20:04:11,470 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 20:04:11,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:04:11,471 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 8 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:04:11,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 354 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:04:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 20:04:11,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-12 20:04:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 104 states have (on average 1.1730769230769231) internal successors, (122), 107 states have internal predecessors, (122), 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-12 20:04:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2024-11-12 20:04:11,476 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 54 [2024-11-12 20:04:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:11,477 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2024-11-12 20:04:11,477 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-12 20:04:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2024-11-12 20:04:11,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-12 20:04:11,478 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:11,478 INFO L218 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-12 20:04:11,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-12 20:04:11,678 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-12 20:04:11,678 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:11,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1726736795, now seen corresponding path program 1 times [2024-11-12 20:04:11,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:11,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318154223] [2024-11-12 20:04:11,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:11,680 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-12 20:04:11,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:11,681 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-12 20:04:11,681 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-12 20:04:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:11,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:04:11,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:11,960 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-12 20:04:11,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:04:11,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:11,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318154223] [2024-11-12 20:04:11,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318154223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:04:11,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:04:11,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:04:11,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378354981] [2024-11-12 20:04:11,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:04:11,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:04:11,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:11,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:04:11,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:04:11,962 INFO L87 Difference]: Start difference. First operand 110 states and 124 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-12 20:04:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:11,971 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2024-11-12 20:04:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:04:11,972 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-12 20:04:11,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:11,973 INFO L225 Difference]: With dead ends: 128 [2024-11-12 20:04:11,973 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 20:04:11,973 INFO L434 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-12 20:04:11,973 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 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-12 20:04:11,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:04:11,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 20:04:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 20:04:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 89 states have internal predecessors, (97), 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-12 20:04:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2024-11-12 20:04:11,979 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 55 [2024-11-12 20:04:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:11,979 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2024-11-12 20:04:11,979 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-12 20:04:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2024-11-12 20:04:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-12 20:04:11,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:11,980 INFO L218 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-12 20:04:11,992 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-12 20:04:12,180 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-12 20:04:12,181 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:12,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:12,181 INFO L85 PathProgramCache]: Analyzing trace with hash 84280908, now seen corresponding path program 1 times [2024-11-12 20:04:12,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:12,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110406242] [2024-11-12 20:04:12,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:12,182 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-12 20:04:12,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:12,183 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-12 20:04:12,184 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-12 20:04:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:12,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:04:12,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:12,510 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-12 20:04:12,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:04:12,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:12,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110406242] [2024-11-12 20:04:12,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110406242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:04:12,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:04:12,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:04:12,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367787080] [2024-11-12 20:04:12,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:04:12,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:04:12,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:12,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:04:12,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:04:12,512 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 3 states, 2 states have (on average 13.0) 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-12 20:04:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:12,531 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2024-11-12 20:04:12,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:04:12,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) 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-12 20:04:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:12,532 INFO L225 Difference]: With dead ends: 100 [2024-11-12 20:04:12,532 INFO L226 Difference]: Without dead ends: 95 [2024-11-12 20:04:12,532 INFO L434 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-12 20:04:12,532 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 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-12 20:04:12,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:04:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-12 20:04:12,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-12 20:04:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.1111111111111112) internal successors, (100), 92 states have internal predecessors, (100), 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-12 20:04:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-12 20:04:12,536 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 55 [2024-11-12 20:04:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:12,537 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-12 20:04:12,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) 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-12 20:04:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-12 20:04:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 20:04:12,537 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:12,538 INFO L218 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, 1, 1, 1, 1] [2024-11-12 20:04:12,549 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-12 20:04:12,738 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-12 20:04:12,738 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:12,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:12,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1743125332, now seen corresponding path program 1 times [2024-11-12 20:04:12,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:12,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605083126] [2024-11-12 20:04:12,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:12,740 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-12 20:04:12,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:12,741 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-12 20:04:12,742 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-12 20:04:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:13,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:04:13,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:13,083 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-12 20:04:13,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:04:13,112 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-12 20:04:13,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:13,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605083126] [2024-11-12 20:04:13,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605083126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:04:13,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 20:04:13,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-12 20:04:13,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421609327] [2024-11-12 20:04:13,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 20:04:13,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 20:04:13,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:13,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 20:04:13,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:04:13,114 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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-12 20:04:13,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:13,158 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2024-11-12 20:04:13,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:04:13,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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-12 20:04:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:13,159 INFO L225 Difference]: With dead ends: 103 [2024-11-12 20:04:13,160 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 20:04:13,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 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-12 20:04:13,160 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 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.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:04:13,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:04:13,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 20:04:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2024-11-12 20:04:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.098901098901099) internal successors, (100), 92 states have internal predecessors, (100), 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-12 20:04:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-12 20:04:13,168 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 58 [2024-11-12 20:04:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:13,168 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-12 20:04:13,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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-12 20:04:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-12 20:04:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 20:04:13,169 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:13,169 INFO L218 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] [2024-11-12 20:04:13,182 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-12 20:04:13,369 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-12 20:04:13,370 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:13,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1028886172, now seen corresponding path program 1 times [2024-11-12 20:04:13,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:13,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146721975] [2024-11-12 20:04:13,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:13,371 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-12 20:04:13,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:13,372 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-12 20:04:13,373 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-12 20:04:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:13,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:04:13,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:13,721 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-12 20:04:13,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:04:13,749 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-12 20:04:13,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:13,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146721975] [2024-11-12 20:04:13,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146721975] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:04:13,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 20:04:13,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 20:04:13,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698520297] [2024-11-12 20:04:13,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 20:04:13,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 20:04:13,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:13,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 20:04:13,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:04:13,750 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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-12 20:04:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:13,839 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-11-12 20:04:13,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 20:04:13,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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 62 [2024-11-12 20:04:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:13,840 INFO L225 Difference]: With dead ends: 111 [2024-11-12 20:04:13,840 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 20:04:13,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:04:13,841 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 10 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:04:13,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 224 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:04:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 20:04:13,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-12 20:04:13,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 103 states have (on average 1.087378640776699) internal successors, (112), 104 states have internal predecessors, (112), 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-12 20:04:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2024-11-12 20:04:13,847 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 62 [2024-11-12 20:04:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:13,847 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2024-11-12 20:04:13,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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-12 20:04:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2024-11-12 20:04:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 20:04:13,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:13,848 INFO L218 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-12 20:04:13,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-12 20:04:14,049 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-12 20:04:14,049 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:14,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:14,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1421089981, now seen corresponding path program 2 times [2024-11-12 20:04:14,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:14,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440345973] [2024-11-12 20:04:14,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:04:14,050 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-12 20:04:14,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:14,051 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-12 20:04:14,052 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-12 20:04:14,319 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 20:04:14,320 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:04:14,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 20:04:14,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:14,356 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-12 20:04:14,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:04:14,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:14,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440345973] [2024-11-12 20:04:14,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440345973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:04:14,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:04:14,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:04:14,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103739798] [2024-11-12 20:04:14,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:04:14,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:04:14,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:14,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:04:14,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:04:14,357 INFO L87 Difference]: Start difference. First operand 107 states and 114 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-12 20:04:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:14,469 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2024-11-12 20:04:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:04:14,469 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-12 20:04:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:14,470 INFO L225 Difference]: With dead ends: 131 [2024-11-12 20:04:14,470 INFO L226 Difference]: Without dead ends: 130 [2024-11-12 20:04:14,470 INFO L434 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-12 20:04:14,471 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 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-12 20:04:14,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:04:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-12 20:04:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-12 20:04:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 126 states have (on average 1.0873015873015872) internal successors, (137), 127 states have internal predecessors, (137), 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-12 20:04:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2024-11-12 20:04:14,475 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 66 [2024-11-12 20:04:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:14,475 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2024-11-12 20:04:14,476 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-12 20:04:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2024-11-12 20:04:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-12 20:04:14,476 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:14,476 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:04:14,486 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-12 20:04:14,676 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-12 20:04:14,677 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:14,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:14,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1336424804, now seen corresponding path program 2 times [2024-11-12 20:04:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:14,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618321703] [2024-11-12 20:04:14,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:04:14,678 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-12 20:04:14,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:14,680 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-12 20:04:14,681 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-12 20:04:14,944 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 20:04:14,944 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:04:14,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:04:14,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:14,995 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-12 20:04:14,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:04:14,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:14,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618321703] [2024-11-12 20:04:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618321703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:04:14,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:04:15,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 20:04:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222600645] [2024-11-12 20:04:15,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:04:15,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 20:04:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:15,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 20:04:15,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:04:15,002 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-12 20:04:15,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:15,248 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2024-11-12 20:04:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:04:15,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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 74 [2024-11-12 20:04:15,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:15,249 INFO L225 Difference]: With dead ends: 170 [2024-11-12 20:04:15,249 INFO L226 Difference]: Without dead ends: 130 [2024-11-12 20:04:15,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 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-12 20:04:15,249 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:04:15,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 156 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:04:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-12 20:04:15,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-12 20:04:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 126 states have (on average 1.0793650793650793) internal successors, (136), 127 states have internal predecessors, (136), 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-12 20:04:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2024-11-12 20:04:15,254 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 74 [2024-11-12 20:04:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:15,254 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2024-11-12 20:04:15,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-12 20:04:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2024-11-12 20:04:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 20:04:15,255 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:15,255 INFO L218 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-12 20:04:15,265 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-12 20:04:15,455 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-12 20:04:15,456 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:15,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:15,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1905935110, now seen corresponding path program 1 times [2024-11-12 20:04:15,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:15,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073971805] [2024-11-12 20:04:15,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:15,457 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-12 20:04:15,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:15,458 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-12 20:04:15,458 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-12 20:04:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:15,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 20:04:15,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:15,971 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-12 20:04:15,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:04:16,077 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-12 20:04:16,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:16,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073971805] [2024-11-12 20:04:16,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073971805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:04:16,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 20:04:16,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-12 20:04:16,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078668401] [2024-11-12 20:04:16,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 20:04:16,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 20:04:16,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:16,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 20:04:16,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-12 20:04:16,078 INFO L87 Difference]: Start difference. First operand 130 states and 138 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-12 20:04:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:16,468 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2024-11-12 20:04:16,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 20:04:16,468 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-12 20:04:16,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:16,469 INFO L225 Difference]: With dead ends: 221 [2024-11-12 20:04:16,469 INFO L226 Difference]: Without dead ends: 154 [2024-11-12 20:04:16,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2024-11-12 20:04:16,470 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 20:04:16,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 356 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 20:04:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-12 20:04:16,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-12 20:04:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 150 states have (on average 1.0666666666666667) internal successors, (160), 151 states have internal predecessors, (160), 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-12 20:04:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2024-11-12 20:04:16,476 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 89 [2024-11-12 20:04:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:16,476 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2024-11-12 20:04:16,476 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-12 20:04:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2024-11-12 20:04:16,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 20:04:16,477 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:16,477 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-12 20:04:16,491 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-12 20:04:16,677 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-12 20:04:16,678 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:16,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:16,678 INFO L85 PathProgramCache]: Analyzing trace with hash -726455591, now seen corresponding path program 1 times [2024-11-12 20:04:16,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:16,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605495902] [2024-11-12 20:04:16,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:04:16,679 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-12 20:04:16,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:16,680 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-12 20:04:16,681 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-12 20:04:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:04:17,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 20:04:17,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 20:04:17,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:04:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 20:04:17,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:17,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605495902] [2024-11-12 20:04:17,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605495902] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:04:17,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 20:04:17,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-12 20:04:17,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969304000] [2024-11-12 20:04:17,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 20:04:17,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 20:04:17,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:17,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 20:04:17,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-12 20:04:17,445 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 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-12 20:04:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:17,804 INFO L93 Difference]: Finished difference Result 182 states and 197 transitions. [2024-11-12 20:04:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 20:04:17,806 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 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 109 [2024-11-12 20:04:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:17,807 INFO L225 Difference]: With dead ends: 182 [2024-11-12 20:04:17,807 INFO L226 Difference]: Without dead ends: 178 [2024-11-12 20:04:17,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2024-11-12 20:04:17,807 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 16 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:04:17,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 356 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:04:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-12 20:04:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-12 20:04:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 174 states have (on average 1.0574712643678161) internal successors, (184), 175 states have internal predecessors, (184), 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-12 20:04:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 186 transitions. [2024-11-12 20:04:17,815 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 186 transitions. Word has length 109 [2024-11-12 20:04:17,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:17,815 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 186 transitions. [2024-11-12 20:04:17,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 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-12 20:04:17,815 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 186 transitions. [2024-11-12 20:04:17,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 20:04:17,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:17,816 INFO L218 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-12 20:04:17,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-12 20:04:18,016 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-12 20:04:18,017 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:18,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:18,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1015277946, now seen corresponding path program 2 times [2024-11-12 20:04:18,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:18,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106040490] [2024-11-12 20:04:18,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:04:18,018 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-12 20:04:18,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:18,020 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-12 20:04:18,021 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-12 20:04:18,324 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 20:04:18,324 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:04:18,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:04:18,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-12 20:04:18,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:04:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-12 20:04:18,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:18,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106040490] [2024-11-12 20:04:18,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106040490] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 20:04:18,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:04:18,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-12 20:04:18,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597861557] [2024-11-12 20:04:18,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:04:18,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:04:18,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:18,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:04:18,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:04:18,556 INFO L87 Difference]: Start difference. First operand 178 states and 186 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-12 20:04:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:18,628 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2024-11-12 20:04:18,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:04:18,629 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 113 [2024-11-12 20:04:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:18,630 INFO L225 Difference]: With dead ends: 178 [2024-11-12 20:04:18,630 INFO L226 Difference]: Without dead ends: 177 [2024-11-12 20:04:18,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 219 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-12 20:04:18,630 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 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-12 20:04:18,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:04:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-12 20:04:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 143. [2024-11-12 20:04:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 140 states have (on average 1.0571428571428572) internal successors, (148), 140 states have internal predecessors, (148), 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-12 20:04:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2024-11-12 20:04:18,637 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 113 [2024-11-12 20:04:18,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:18,637 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2024-11-12 20:04:18,637 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-12 20:04:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2024-11-12 20:04:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 20:04:18,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:18,638 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1] [2024-11-12 20:04:18,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-12 20:04:18,838 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-12 20:04:18,839 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:18,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:18,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2140533721, now seen corresponding path program 2 times [2024-11-12 20:04:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:18,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704396910] [2024-11-12 20:04:18,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:04:18,840 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-12 20:04:18,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:18,841 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-12 20:04:18,842 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-12 20:04:22,820 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 20:04:22,820 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:04:22,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 20:04:22,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:04:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 20:04:23,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:04:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-12 20:04:23,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 20:04:23,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704396910] [2024-11-12 20:04:23,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704396910] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:04:23,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 20:04:23,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-11-12 20:04:23,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794203993] [2024-11-12 20:04:23,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 20:04:23,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-12 20:04:23,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 20:04:23,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-12 20:04:23,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2024-11-12 20:04:23,465 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 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-12 20:04:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:04:25,007 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2024-11-12 20:04:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-12 20:04:25,008 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 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 133 [2024-11-12 20:04:25,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:04:25,009 INFO L225 Difference]: With dead ends: 195 [2024-11-12 20:04:25,009 INFO L226 Difference]: Without dead ends: 191 [2024-11-12 20:04:25,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2024-11-12 20:04:25,010 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 20:04:25,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 821 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 20:04:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-12 20:04:25,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-12 20:04:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 188 states have (on average 1.0425531914893618) internal successors, (196), 188 states have internal predecessors, (196), 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-12 20:04:25,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 198 transitions. [2024-11-12 20:04:25,017 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 198 transitions. Word has length 133 [2024-11-12 20:04:25,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:04:25,018 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 198 transitions. [2024-11-12 20:04:25,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 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-12 20:04:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 198 transitions. [2024-11-12 20:04:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-12 20:04:25,018 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:04:25,018 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 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, 1, 1, 1] [2024-11-12 20:04:25,042 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 (22)] Ended with exit code 0 [2024-11-12 20:04:25,219 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-12 20:04:25,219 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2024-11-12 20:04:25,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:04:25,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1178958375, now seen corresponding path program 3 times [2024-11-12 20:04:25,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 20:04:25,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712834238] [2024-11-12 20:04:25,220 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 20:04:25,220 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-12 20:04:25,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 20:04:25,221 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-12 20:04:25,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-12 20:05:14,337 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2024-11-12 20:05:14,337 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:05:14,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 20:05:14,391 INFO L279 TraceCheckSpWp]: Computing forward predicates...