./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/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.dd.update-z3-fca748b-m [2024-11-20 21:20:38,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 21:20:38,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-20 21:20:38,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 21:20:38,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 21:20:38,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 21:20:38,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 21:20:38,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 21:20:38,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 21:20:38,827 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 21:20:38,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 21:20:38,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 21:20:38,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 21:20:38,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 21:20:38,828 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 21:20:38,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 21:20:38,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 21:20:38,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 21:20:38,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 21:20:38,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 21:20:38,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 21:20:38,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 21:20:38,832 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 21:20:38,832 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 21:20:38,832 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 21:20:38,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 21:20:38,832 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 21:20:38,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 21:20:38,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 21:20:38,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 21:20:38,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 21:20:38,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 21:20:38,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 21:20:38,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 21:20:38,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 21:20:38,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 21:20:38,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 21:20:38,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 21:20:38,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 21:20:38,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 21:20:38,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 21:20:38,836 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-20 21:20:39,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 21:20:39,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 21:20:39,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 21:20:39,069 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 21:20:39,069 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 21:20:39,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-20 21:20:40,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 21:20:40,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 21:20:40,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-20 21:20:40,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb72ab30/4280a3389edc45508d5338eae6e46005/FLAG7e998a081 [2024-11-20 21:20:40,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cb72ab30/4280a3389edc45508d5338eae6e46005 [2024-11-20 21:20:40,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 21:20:40,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 21:20:40,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 21:20:40,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 21:20:40,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 21:20:40,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:20:40" (1/1) ... [2024-11-20 21:20:40,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d8ea1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:40, skipping insertion in model container [2024-11-20 21:20:40,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:20:40" (1/1) ... [2024-11-20 21:20:40,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 21:20:41,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 21:20:41,257 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 21:20:41,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 21:20:41,383 INFO L204 MainTranslator]: Completed translation [2024-11-20 21:20:41,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:41 WrapperNode [2024-11-20 21:20:41,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 21:20:41,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 21:20:41,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 21:20:41,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 21:20:41,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:41" (1/1) ... [2024-11-20 21:20:41,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:41" (1/1) ... [2024-11-20 21:20:41,456 INFO L138 Inliner]: procedures = 344, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 669 [2024-11-20 21:20:41,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 21:20:41,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 21:20:41,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 21:20:41,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 21:20:41,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:41" (1/1) ... [2024-11-20 21:20:41,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:41" (1/1) ... [2024-11-20 21:20:41,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:41" (1/1) ... [2024-11-20 21:20:41,529 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, 2, 2, 2, 1]. [2024-11-20 21:20:41,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:41" (1/1) ... [2024-11-20 21:20:41,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:41" (1/1) ... [2024-11-20 21:20:41,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:41" (1/1) ... [2024-11-20 21:20:41,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:41" (1/1) ... [2024-11-20 21:20:41,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:41" (1/1) ... [2024-11-20 21:20:41,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:41" (1/1) ... [2024-11-20 21:20:41,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 21:20:41,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 21:20:41,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 21:20:41,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 21:20:41,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:41" (1/1) ... [2024-11-20 21:20:41,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 21:20:41,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:41,627 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-20 21:20:41,629 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-20 21:20:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 21:20:41,668 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 21:20:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 21:20:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 21:20:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 21:20:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-20 21:20:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-20 21:20:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-20 21:20:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-20 21:20:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-20 21:20:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-20 21:20:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-20 21:20:41,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-20 21:20:41,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-20 21:20:41,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-20 21:20:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-20 21:20:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-20 21:20:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 21:20:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 21:20:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 21:20:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 21:20:41,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-20 21:20:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-20 21:20:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-20 21:20:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-20 21:20:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-20 21:20:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-20 21:20:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-20 21:20:41,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-20 21:20:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-20 21:20:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-20 21:20:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-20 21:20:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-20 21:20:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 21:20:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 21:20:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 21:20:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-20 21:20:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-20 21:20:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-20 21:20:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-20 21:20:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-20 21:20:41,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-20 21:20:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-20 21:20:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-20 21:20:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-20 21:20:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-20 21:20:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-20 21:20:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-20 21:20:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 21:20:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 21:20:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 21:20:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 21:20:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 21:20:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-20 21:20:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-20 21:20:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-20 21:20:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-20 21:20:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-20 21:20:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-20 21:20:41,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-20 21:20:41,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-20 21:20:41,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-20 21:20:41,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-20 21:20:41,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-20 21:20:41,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-20 21:20:41,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 21:20:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 21:20:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 21:20:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-20 21:20:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-20 21:20:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-20 21:20:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-20 21:20:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-20 21:20:41,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-20 21:20:41,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-20 21:20:41,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-20 21:20:41,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-20 21:20:41,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-20 21:20:41,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-20 21:20:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-20 21:20:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 21:20:41,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 21:20:41,876 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 21:20:41,878 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 21:20:42,325 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-11-20 21:20:42,325 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 21:20:42,339 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 21:20:42,339 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-20 21:20:42,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:20:42 BoogieIcfgContainer [2024-11-20 21:20:42,340 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 21:20:42,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 21:20:42,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 21:20:42,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 21:20:42,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:20:40" (1/3) ... [2024-11-20 21:20:42,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a6b41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:20:42, skipping insertion in model container [2024-11-20 21:20:42,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:41" (2/3) ... [2024-11-20 21:20:42,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a6b41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:20:42, skipping insertion in model container [2024-11-20 21:20:42,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:20:42" (3/3) ... [2024-11-20 21:20:42,349 INFO L112 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2024-11-20 21:20:42,362 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 21:20:42,362 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-20 21:20:42,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 21:20:42,423 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;@379a92fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 21:20:42,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-20 21:20:42,427 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-20 21:20:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 21:20:42,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:42,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 21:20:42,432 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-20 21:20:42,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:42,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-20 21:20:42,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:42,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122182224] [2024-11-20 21:20:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:42,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:42,954 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-20 21:20:42,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:42,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122182224] [2024-11-20 21:20:42,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122182224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:42,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:42,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:42,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765143744] [2024-11-20 21:20:42,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:42,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:42,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:42,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:42,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:42,998 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-20 21:20:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:43,040 INFO L93 Difference]: Finished difference Result 173 states and 221 transitions. [2024-11-20 21:20:43,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:43,043 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-20 21:20:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:43,050 INFO L225 Difference]: With dead ends: 173 [2024-11-20 21:20:43,051 INFO L226 Difference]: Without dead ends: 85 [2024-11-20 21:20:43,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:43,055 INFO L432 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-20 21:20:43,056 INFO L433 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-20 21:20:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-20 21:20:43,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-20 21:20:43,079 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-20 21:20:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2024-11-20 21:20:43,082 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 4 [2024-11-20 21:20:43,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:43,082 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2024-11-20 21:20:43,082 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-20 21:20:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2024-11-20 21:20:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 21:20:43,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:43,083 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-20 21:20:43,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 21:20:43,083 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-20 21:20:43,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 556468371, now seen corresponding path program 1 times [2024-11-20 21:20:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117848048] [2024-11-20 21:20:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:43,198 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-20 21:20:43,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:43,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117848048] [2024-11-20 21:20:43,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117848048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:43,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955436122] [2024-11-20 21:20:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:43,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:43,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:43,201 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-20 21:20:43,203 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-20 21:20:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:43,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:43,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:43,490 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-20 21:20:43,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955436122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:43,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:43,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-20 21:20:43,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221057072] [2024-11-20 21:20:43,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:43,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 21:20:43,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:43,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 21:20:43,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:20:43,496 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-20 21:20:43,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:43,523 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2024-11-20 21:20:43,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 21:20:43,524 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-20 21:20:43,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:43,525 INFO L225 Difference]: With dead ends: 85 [2024-11-20 21:20:43,525 INFO L226 Difference]: Without dead ends: 84 [2024-11-20 21:20:43,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:20:43,526 INFO L432 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-20 21:20:43,526 INFO L433 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-20 21:20:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-20 21:20:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-20 21:20:43,535 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-20 21:20:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2024-11-20 21:20:43,540 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 7 [2024-11-20 21:20:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:43,540 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2024-11-20 21:20:43,540 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-20 21:20:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2024-11-20 21:20:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 21:20:43,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:43,541 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-20 21:20:43,551 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-20 21:20:43,741 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-20 21:20:43,743 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-20 21:20:43,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:43,744 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-20 21:20:43,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:43,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13239741] [2024-11-20 21:20:43,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:43,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:43,867 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-20 21:20:43,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:43,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13239741] [2024-11-20 21:20:43,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13239741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:43,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:43,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:43,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330173583] [2024-11-20 21:20:43,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:43,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:43,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:43,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:43,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:43,871 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-20 21:20:43,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:43,887 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2024-11-20 21:20:43,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:43,888 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-20 21:20:43,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:43,888 INFO L225 Difference]: With dead ends: 84 [2024-11-20 21:20:43,891 INFO L226 Difference]: Without dead ends: 83 [2024-11-20 21:20:43,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:43,892 INFO L432 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-20 21:20:43,892 INFO L433 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-20 21:20:43,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-20 21:20:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-20 21:20:43,897 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-20 21:20:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2024-11-20 21:20:43,897 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 8 [2024-11-20 21:20:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:43,898 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2024-11-20 21:20:43,898 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-20 21:20:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2024-11-20 21:20:43,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 21:20:43,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:43,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:43,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 21:20:43,899 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-20 21:20:43,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:43,899 INFO L85 PathProgramCache]: Analyzing trace with hash 216065076, now seen corresponding path program 1 times [2024-11-20 21:20:43,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:43,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011475377] [2024-11-20 21:20:43,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:43,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-20 21:20:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:43,989 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-20 21:20:43,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:43,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011475377] [2024-11-20 21:20:43,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011475377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:43,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858932910] [2024-11-20 21:20:43,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:43,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:43,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:43,991 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-20 21:20:43,992 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-20 21:20:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:44,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:20:44,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:44,190 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-20 21:20:44,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:44,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858932910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:44,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:44,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-20 21:20:44,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032307388] [2024-11-20 21:20:44,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:44,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:44,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:44,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:20:44,193 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-20 21:20:44,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:44,210 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2024-11-20 21:20:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:44,211 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-20 21:20:44,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:44,212 INFO L225 Difference]: With dead ends: 81 [2024-11-20 21:20:44,212 INFO L226 Difference]: Without dead ends: 79 [2024-11-20 21:20:44,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:20:44,213 INFO L432 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-20 21:20:44,213 INFO L433 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-20 21:20:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-20 21:20:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-20 21:20:44,217 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-20 21:20:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2024-11-20 21:20:44,217 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 13 [2024-11-20 21:20:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:44,217 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2024-11-20 21:20:44,218 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-20 21:20:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2024-11-20 21:20:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 21:20:44,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:44,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:44,229 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-20 21:20:44,418 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-20 21:20:44,419 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-20 21:20:44,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1891917174, now seen corresponding path program 1 times [2024-11-20 21:20:44,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:44,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827541124] [2024-11-20 21:20:44,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:44,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:44,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-20 21:20:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:44,518 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-20 21:20:44,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:44,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827541124] [2024-11-20 21:20:44,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827541124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:44,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241627655] [2024-11-20 21:20:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:44,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:44,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:44,521 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-20 21:20:44,521 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-20 21:20:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:44,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:44,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:44,733 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-20 21:20:44,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:44,755 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-20 21:20:44,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241627655] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:44,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:44,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-20 21:20:44,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252195782] [2024-11-20 21:20:44,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:44,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 21:20:44,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:44,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 21:20:44,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:44,757 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-20 21:20:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:44,788 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2024-11-20 21:20:44,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:20:44,789 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-20 21:20:44,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:44,789 INFO L225 Difference]: With dead ends: 161 [2024-11-20 21:20:44,789 INFO L226 Difference]: Without dead ends: 88 [2024-11-20 21:20:44,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:44,790 INFO L432 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-20 21:20:44,790 INFO L433 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-20 21:20:44,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-20 21:20:44,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-20 21:20:44,802 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-20 21:20:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2024-11-20 21:20:44,803 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 14 [2024-11-20 21:20:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:44,803 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2024-11-20 21:20:44,803 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-20 21:20:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2024-11-20 21:20:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-20 21:20:44,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:44,804 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:44,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 21:20:45,005 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-20 21:20:45,006 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-20 21:20:45,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:45,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1138585064, now seen corresponding path program 2 times [2024-11-20 21:20:45,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:45,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132791126] [2024-11-20 21:20:45,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:45,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:45,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 21:20:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:45,346 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-20 21:20:45,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:45,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132791126] [2024-11-20 21:20:45,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132791126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586624119] [2024-11-20 21:20:45,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:20:45,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:45,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:45,353 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-20 21:20:45,360 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-20 21:20:45,542 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:20:45,543 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:20:45,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 21:20:45,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:45,584 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-20 21:20:45,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:45,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586624119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:45,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:45,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-20 21:20:45,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719142371] [2024-11-20 21:20:45,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:45,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:20:45,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:45,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:20:45,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:20:45,586 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-20 21:20:45,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:45,623 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2024-11-20 21:20:45,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 21:20:45,624 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-20 21:20:45,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:45,624 INFO L225 Difference]: With dead ends: 88 [2024-11-20 21:20:45,624 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 21:20:45,625 INFO L431 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-20 21:20:45,625 INFO L432 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-20 21:20:45,625 INFO L433 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-20 21:20:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 21:20:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-20 21:20:45,629 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-20 21:20:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2024-11-20 21:20:45,630 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 23 [2024-11-20 21:20:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:45,630 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2024-11-20 21:20:45,630 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-20 21:20:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2024-11-20 21:20:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 21:20:45,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:45,631 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:45,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 21:20:45,834 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-20 21:20:45,835 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-20 21:20:45,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash -649986637, now seen corresponding path program 1 times [2024-11-20 21:20:45,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:45,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77670006] [2024-11-20 21:20:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:45,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:45,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 21:20:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:45,956 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-20 21:20:45,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77670006] [2024-11-20 21:20:45,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77670006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:45,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:45,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:45,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648010379] [2024-11-20 21:20:45,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:45,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:45,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:45,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:45,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:45,959 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-20 21:20:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:45,973 INFO L93 Difference]: Finished difference Result 150 states and 180 transitions. [2024-11-20 21:20:45,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:45,974 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-20 21:20:45,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:45,974 INFO L225 Difference]: With dead ends: 150 [2024-11-20 21:20:45,975 INFO L226 Difference]: Without dead ends: 89 [2024-11-20 21:20:45,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:45,976 INFO L432 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-20 21:20:45,976 INFO L433 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-20 21:20:45,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-20 21:20:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-20 21:20:45,981 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-20 21:20:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2024-11-20 21:20:45,982 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 28 [2024-11-20 21:20:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:45,982 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2024-11-20 21:20:45,982 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-20 21:20:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2024-11-20 21:20:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 21:20:45,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:45,984 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:45,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 21:20:45,984 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-20 21:20:45,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:45,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2039246265, now seen corresponding path program 1 times [2024-11-20 21:20:45,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:45,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451467499] [2024-11-20 21:20:45,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:45,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:46,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 21:20:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:46,125 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-20 21:20:46,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:46,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451467499] [2024-11-20 21:20:46,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451467499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:46,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327498757] [2024-11-20 21:20:46,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:46,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:46,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:46,128 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-20 21:20:46,134 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-20 21:20:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:46,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 21:20:46,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:46,406 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-20 21:20:46,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:46,479 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-20 21:20:46,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327498757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:46,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:46,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2024-11-20 21:20:46,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318251433] [2024-11-20 21:20:46,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:46,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 21:20:46,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:46,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 21:20:46,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-20 21:20:46,481 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-20 21:20:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:46,548 INFO L93 Difference]: Finished difference Result 180 states and 214 transitions. [2024-11-20 21:20:46,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 21:20:46,548 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-20 21:20:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:46,549 INFO L225 Difference]: With dead ends: 180 [2024-11-20 21:20:46,549 INFO L226 Difference]: Without dead ends: 106 [2024-11-20 21:20:46,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-20 21:20:46,550 INFO L432 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-20 21:20:46,550 INFO L433 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-20 21:20:46,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-20 21:20:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-20 21:20:46,554 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-20 21:20:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2024-11-20 21:20:46,554 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 31 [2024-11-20 21:20:46,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:46,555 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2024-11-20 21:20:46,555 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-20 21:20:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2024-11-20 21:20:46,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-20 21:20:46,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:46,556 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:46,567 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-20 21:20:46,756 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-20 21:20:46,757 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-20 21:20:46,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:46,757 INFO L85 PathProgramCache]: Analyzing trace with hash -800434536, now seen corresponding path program 1 times [2024-11-20 21:20:46,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:46,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891276155] [2024-11-20 21:20:46,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:46,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:46,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:46,928 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-20 21:20:46,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:46,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891276155] [2024-11-20 21:20:46,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891276155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:46,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:46,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 21:20:46,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784356365] [2024-11-20 21:20:46,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:46,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:46,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:46,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:46,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:46,929 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-20 21:20:46,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:46,937 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2024-11-20 21:20:46,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:46,938 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-20 21:20:46,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:46,938 INFO L225 Difference]: With dead ends: 124 [2024-11-20 21:20:46,938 INFO L226 Difference]: Without dead ends: 79 [2024-11-20 21:20:46,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:46,939 INFO L432 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-20 21:20:46,939 INFO L433 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-20 21:20:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-20 21:20:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-20 21:20:46,942 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-20 21:20:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2024-11-20 21:20:46,943 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 50 [2024-11-20 21:20:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:46,943 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2024-11-20 21:20:46,943 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-20 21:20:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-11-20 21:20:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-20 21:20:46,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:46,944 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:46,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 21:20:46,944 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-20 21:20:46,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:46,945 INFO L85 PathProgramCache]: Analyzing trace with hash 441966575, now seen corresponding path program 1 times [2024-11-20 21:20:46,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:46,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119190655] [2024-11-20 21:20:46,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:46,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:47,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:47,046 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-20 21:20:47,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:47,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119190655] [2024-11-20 21:20:47,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119190655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:47,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:47,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:47,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810076176] [2024-11-20 21:20:47,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:47,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:47,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:47,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:47,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:47,047 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-20 21:20:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:47,067 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-11-20 21:20:47,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:47,068 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-20 21:20:47,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:47,068 INFO L225 Difference]: With dead ends: 92 [2024-11-20 21:20:47,068 INFO L226 Difference]: Without dead ends: 90 [2024-11-20 21:20:47,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:47,069 INFO L432 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-20 21:20:47,069 INFO L433 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-20 21:20:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-20 21:20:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-20 21:20:47,072 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-20 21:20:47,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2024-11-20 21:20:47,073 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 50 [2024-11-20 21:20:47,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:47,073 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2024-11-20 21:20:47,073 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-20 21:20:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2024-11-20 21:20:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-20 21:20:47,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:47,074 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:47,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 21:20:47,074 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-20 21:20:47,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:47,075 INFO L85 PathProgramCache]: Analyzing trace with hash 441968304, now seen corresponding path program 1 times [2024-11-20 21:20:47,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:47,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107116347] [2024-11-20 21:20:47,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:47,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:47,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:47,173 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-20 21:20:47,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:47,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107116347] [2024-11-20 21:20:47,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107116347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:47,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:47,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:47,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361740538] [2024-11-20 21:20:47,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:47,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:47,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:47,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:47,175 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-20 21:20:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:47,184 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-11-20 21:20:47,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:47,184 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-20 21:20:47,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:47,185 INFO L225 Difference]: With dead ends: 89 [2024-11-20 21:20:47,185 INFO L226 Difference]: Without dead ends: 88 [2024-11-20 21:20:47,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:47,186 INFO L432 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-20 21:20:47,186 INFO L433 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-20 21:20:47,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-20 21:20:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-11-20 21:20:47,189 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-20 21:20:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-11-20 21:20:47,189 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 50 [2024-11-20 21:20:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:47,190 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-11-20 21:20:47,190 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-20 21:20:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-11-20 21:20:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-20 21:20:47,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:47,191 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:47,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 21:20:47,191 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-20 21:20:47,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:47,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1496638887, now seen corresponding path program 1 times [2024-11-20 21:20:47,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:47,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111280654] [2024-11-20 21:20:47,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:47,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:47,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:47,305 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-20 21:20:47,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:47,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111280654] [2024-11-20 21:20:47,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111280654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:47,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:47,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:47,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727914689] [2024-11-20 21:20:47,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:47,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:47,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:47,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:47,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:47,306 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-20 21:20:47,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:47,322 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-11-20 21:20:47,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:47,322 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-20 21:20:47,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:47,323 INFO L225 Difference]: With dead ends: 93 [2024-11-20 21:20:47,323 INFO L226 Difference]: Without dead ends: 87 [2024-11-20 21:20:47,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:47,323 INFO L432 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-20 21:20:47,324 INFO L433 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-20 21:20:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-20 21:20:47,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-20 21:20:47,326 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-20 21:20:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-20 21:20:47,327 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 53 [2024-11-20 21:20:47,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:47,327 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-20 21:20:47,327 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-20 21:20:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-20 21:20:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-20 21:20:47,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:47,328 INFO L215 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-20 21:20:47,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 21:20:47,328 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-20 21:20:47,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash 313800151, now seen corresponding path program 1 times [2024-11-20 21:20:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:47,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528031360] [2024-11-20 21:20:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:47,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:47,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:47,448 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-20 21:20:47,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:47,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528031360] [2024-11-20 21:20:47,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528031360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:47,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642126618] [2024-11-20 21:20:47,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:47,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:47,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:47,454 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-20 21:20:47,455 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-20 21:20:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:47,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:47,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:47,735 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-20 21:20:47,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:47,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642126618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:47,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:47,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-20 21:20:47,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850040147] [2024-11-20 21:20:47,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:47,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 21:20:47,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:47,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 21:20:47,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:20:47,737 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-20 21:20:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:47,750 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-11-20 21:20:47,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 21:20:47,750 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-20 21:20:47,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:47,751 INFO L225 Difference]: With dead ends: 87 [2024-11-20 21:20:47,751 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 21:20:47,751 INFO L431 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-20 21:20:47,751 INFO L432 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-20 21:20:47,752 INFO L433 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-20 21:20:47,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 21:20:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-20 21:20:47,754 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-20 21:20:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2024-11-20 21:20:47,755 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 56 [2024-11-20 21:20:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:47,755 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2024-11-20 21:20:47,755 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-20 21:20:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-11-20 21:20:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 21:20:47,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:47,756 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:47,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-20 21:20:47,956 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-20 21:20:47,957 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-20 21:20:47,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:47,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1137870308, now seen corresponding path program 1 times [2024-11-20 21:20:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:47,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16548433] [2024-11-20 21:20:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:48,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:48,047 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-20 21:20:48,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:48,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16548433] [2024-11-20 21:20:48,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16548433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:48,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:48,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:20:48,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901552928] [2024-11-20 21:20:48,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:48,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:48,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:48,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:48,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:48,048 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-20 21:20:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:48,059 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-20 21:20:48,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:48,060 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-20 21:20:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:48,060 INFO L225 Difference]: With dead ends: 86 [2024-11-20 21:20:48,060 INFO L226 Difference]: Without dead ends: 85 [2024-11-20 21:20:48,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:20:48,061 INFO L432 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-20 21:20:48,061 INFO L433 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-20 21:20:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-20 21:20:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2024-11-20 21:20:48,064 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-20 21:20:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2024-11-20 21:20:48,064 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 57 [2024-11-20 21:20:48,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:48,064 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2024-11-20 21:20:48,064 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-20 21:20:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2024-11-20 21:20:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-20 21:20:48,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:48,065 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:48,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 21:20:48,065 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-20 21:20:48,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash 914187780, now seen corresponding path program 1 times [2024-11-20 21:20:48,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:48,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320038882] [2024-11-20 21:20:48,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:48,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:48,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:48,200 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-20 21:20:48,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:48,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320038882] [2024-11-20 21:20:48,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320038882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:48,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706957292] [2024-11-20 21:20:48,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:48,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:48,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:48,204 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-20 21:20:48,212 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-20 21:20:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:48,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:48,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:48,498 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-20 21:20:48,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:48,517 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-20 21:20:48,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706957292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:48,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:48,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-20 21:20:48,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654939657] [2024-11-20 21:20:48,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:48,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 21:20:48,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:48,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 21:20:48,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:48,518 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-20 21:20:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:48,544 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2024-11-20 21:20:48,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:20:48,544 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-20 21:20:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:48,545 INFO L225 Difference]: With dead ends: 96 [2024-11-20 21:20:48,545 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 21:20:48,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:48,546 INFO L432 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-20 21:20:48,546 INFO L433 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-20 21:20:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 21:20:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-20 21:20:48,551 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-20 21:20:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-11-20 21:20:48,551 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 58 [2024-11-20 21:20:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:48,551 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-11-20 21:20:48,552 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-20 21:20:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-11-20 21:20:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-20 21:20:48,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:48,552 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:48,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-20 21:20:48,752 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-20 21:20:48,753 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-20 21:20:48,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1414632936, now seen corresponding path program 1 times [2024-11-20 21:20:48,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:48,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599638398] [2024-11-20 21:20:48,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:48,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:48,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:48,869 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-20 21:20:48,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:48,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599638398] [2024-11-20 21:20:48,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599638398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:48,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611825401] [2024-11-20 21:20:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:48,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:48,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:48,874 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-20 21:20:48,875 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-20 21:20:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:49,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:49,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:49,170 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-20 21:20:49,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:49,186 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-20 21:20:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611825401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:49,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:49,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-20 21:20:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374322232] [2024-11-20 21:20:49,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:49,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 21:20:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:49,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 21:20:49,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:49,188 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-20 21:20:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:49,208 INFO L93 Difference]: Finished difference Result 154 states and 175 transitions. [2024-11-20 21:20:49,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:20:49,209 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-20 21:20:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:49,209 INFO L225 Difference]: With dead ends: 154 [2024-11-20 21:20:49,210 INFO L226 Difference]: Without dead ends: 110 [2024-11-20 21:20:49,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:49,210 INFO L432 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-20 21:20:49,211 INFO L433 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-20 21:20:49,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-20 21:20:49,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-20 21:20:49,214 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-20 21:20:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2024-11-20 21:20:49,214 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 58 [2024-11-20 21:20:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:49,214 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2024-11-20 21:20:49,214 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-20 21:20:49,214 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2024-11-20 21:20:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 21:20:49,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:49,215 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:49,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-20 21:20:49,418 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-20 21:20:49,419 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-20 21:20:49,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:49,419 INFO L85 PathProgramCache]: Analyzing trace with hash 169510356, now seen corresponding path program 2 times [2024-11-20 21:20:49,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:49,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661993114] [2024-11-20 21:20:49,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:49,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:49,583 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-20 21:20:49,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:49,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661993114] [2024-11-20 21:20:49,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661993114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:49,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203085568] [2024-11-20 21:20:49,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:20:49,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:49,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:49,585 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-20 21:20:49,586 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-20 21:20:49,834 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:20:49,834 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:20:49,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 21:20:49,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:49,882 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-20 21:20:49,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:49,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203085568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:49,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:49,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-20 21:20:49,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902071129] [2024-11-20 21:20:49,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:49,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:20:49,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:49,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:20:49,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-20 21:20:49,884 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-20 21:20:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:49,926 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2024-11-20 21:20:49,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:20:49,926 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-20 21:20:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:49,927 INFO L225 Difference]: With dead ends: 141 [2024-11-20 21:20:49,927 INFO L226 Difference]: Without dead ends: 110 [2024-11-20 21:20:49,927 INFO L431 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-20 21:20:49,927 INFO L432 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-20 21:20:49,928 INFO L433 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-20 21:20:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-20 21:20:49,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-20 21:20:49,931 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-20 21:20:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2024-11-20 21:20:49,931 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 67 [2024-11-20 21:20:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:49,931 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2024-11-20 21:20:49,932 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-20 21:20:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2024-11-20 21:20:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-20 21:20:49,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:49,932 INFO L215 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-20 21:20:49,944 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-20 21:20:50,133 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-20 21:20:50,133 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-20 21:20:50,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:50,134 INFO L85 PathProgramCache]: Analyzing trace with hash -967455130, now seen corresponding path program 2 times [2024-11-20 21:20:50,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:50,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370777105] [2024-11-20 21:20:50,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:50,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:50,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:50,317 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-20 21:20:50,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:50,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370777105] [2024-11-20 21:20:50,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370777105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:50,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52830359] [2024-11-20 21:20:50,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:20:50,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:50,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:50,320 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-20 21:20:50,321 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-20 21:20:50,672 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 21:20:50,672 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:20:50,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 1482 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 21:20:50,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:50,717 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-20 21:20:50,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:50,774 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-20 21:20:50,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52830359] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:50,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:50,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2024-11-20 21:20:50,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270265487] [2024-11-20 21:20:50,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:50,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 21:20:50,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:50,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 21:20:50,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2024-11-20 21:20:50,776 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-20 21:20:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:51,011 INFO L93 Difference]: Finished difference Result 198 states and 225 transitions. [2024-11-20 21:20:51,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-20 21:20:51,011 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-20 21:20:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:51,012 INFO L225 Difference]: With dead ends: 198 [2024-11-20 21:20:51,012 INFO L226 Difference]: Without dead ends: 145 [2024-11-20 21:20:51,013 INFO L431 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-20 21:20:51,013 INFO L432 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-20 21:20:51,014 INFO L433 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-20 21:20:51,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-20 21:20:51,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-20 21:20:51,018 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-20 21:20:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2024-11-20 21:20:51,019 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 76 [2024-11-20 21:20:51,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:51,019 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2024-11-20 21:20:51,019 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-20 21:20:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2024-11-20 21:20:51,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 21:20:51,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:51,020 INFO L215 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-20 21:20:51,029 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-20 21:20:51,220 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-20 21:20:51,220 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-20 21:20:51,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:51,221 INFO L85 PathProgramCache]: Analyzing trace with hash -615859145, now seen corresponding path program 1 times [2024-11-20 21:20:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:51,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077674865] [2024-11-20 21:20:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:51,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:51,501 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-20 21:20:51,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:51,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077674865] [2024-11-20 21:20:51,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077674865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:51,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604388282] [2024-11-20 21:20:51,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:51,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:51,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:51,504 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-20 21:20:51,504 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-20 21:20:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:51,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 21:20:51,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:51,908 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-20 21:20:51,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:51,965 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-20 21:20:51,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604388282] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:51,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:51,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-20 21:20:51,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924904129] [2024-11-20 21:20:51,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:51,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 21:20:51,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:51,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 21:20:51,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-20 21:20:51,967 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-20 21:20:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:52,020 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2024-11-20 21:20:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 21:20:52,021 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-20 21:20:52,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:52,021 INFO L225 Difference]: With dead ends: 167 [2024-11-20 21:20:52,021 INFO L226 Difference]: Without dead ends: 163 [2024-11-20 21:20:52,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-20 21:20:52,022 INFO L432 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.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:52,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 92 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 21:20:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-20 21:20:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-20 21:20:52,029 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-20 21:20:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2024-11-20 21:20:52,030 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 171 transitions. Word has length 102 [2024-11-20 21:20:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:52,030 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 171 transitions. [2024-11-20 21:20:52,030 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-20 21:20:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2024-11-20 21:20:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 21:20:52,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:52,031 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:20:52,040 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-20 21:20:52,231 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-20 21:20:52,232 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-20 21:20:52,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:52,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1015277946, now seen corresponding path program 1 times [2024-11-20 21:20:52,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:52,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87746580] [2024-11-20 21:20:52,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:52,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:52,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:52,424 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-20 21:20:52,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:52,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87746580] [2024-11-20 21:20:52,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87746580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:52,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138534946] [2024-11-20 21:20:52,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:52,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:52,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:52,429 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-20 21:20:52,431 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-20 21:20:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:52,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 1759 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:52,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:52,970 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-20 21:20:52,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:53,042 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-20 21:20:53,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138534946] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:53,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:53,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-20 21:20:53,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668985110] [2024-11-20 21:20:53,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:53,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 21:20:53,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:53,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 21:20:53,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:53,045 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-20 21:20:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:53,088 INFO L93 Difference]: Finished difference Result 269 states and 285 transitions. [2024-11-20 21:20:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:20:53,089 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-20 21:20:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:53,091 INFO L225 Difference]: With dead ends: 269 [2024-11-20 21:20:53,092 INFO L226 Difference]: Without dead ends: 268 [2024-11-20 21:20:53,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:20:53,093 INFO L432 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-20 21:20:53,093 INFO L433 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-20 21:20:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-20 21:20:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-20 21:20:53,102 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-20 21:20:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 282 transitions. [2024-11-20 21:20:53,103 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 282 transitions. Word has length 113 [2024-11-20 21:20:53,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:53,104 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 282 transitions. [2024-11-20 21:20:53,104 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-20 21:20:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 282 transitions. [2024-11-20 21:20:53,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 21:20:53,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:53,105 INFO L215 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-20 21:20:53,114 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-20 21:20:53,305 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-20 21:20:53,305 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-20 21:20:53,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:53,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2026995575, now seen corresponding path program 2 times [2024-11-20 21:20:53,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:53,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43057444] [2024-11-20 21:20:53,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:53,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:53,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:53,688 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-20 21:20:53,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43057444] [2024-11-20 21:20:53,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43057444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794896198] [2024-11-20 21:20:53,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:20:53,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:53,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:53,690 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-20 21:20:53,695 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-20 21:20:54,043 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:20:54,043 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:20:54,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:20:54,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:54,058 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-20 21:20:54,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:20:54,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794896198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:54,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:20:54,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2024-11-20 21:20:54,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132952888] [2024-11-20 21:20:54,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:54,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:20:54,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:54,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:20:54,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-11-20 21:20:54,060 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-20 21:20:54,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:54,072 INFO L93 Difference]: Finished difference Result 306 states and 321 transitions. [2024-11-20 21:20:54,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:20:54,072 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-20 21:20:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:54,073 INFO L225 Difference]: With dead ends: 306 [2024-11-20 21:20:54,073 INFO L226 Difference]: Without dead ends: 269 [2024-11-20 21:20:54,074 INFO L431 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-20 21:20:54,074 INFO L432 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-20 21:20:54,075 INFO L433 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-20 21:20:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-20 21:20:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-20 21:20:54,082 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-20 21:20:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 283 transitions. [2024-11-20 21:20:54,083 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 283 transitions. Word has length 120 [2024-11-20 21:20:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:54,083 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 283 transitions. [2024-11-20 21:20:54,083 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-20 21:20:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 283 transitions. [2024-11-20 21:20:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 21:20:54,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:54,084 INFO L215 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-20 21:20:54,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-20 21:20:54,285 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-20 21:20:54,285 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-20 21:20:54,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash 997636277, now seen corresponding path program 1 times [2024-11-20 21:20:54,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:54,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012306915] [2024-11-20 21:20:54,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:54,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:54,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:54,558 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-20 21:20:54,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:54,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012306915] [2024-11-20 21:20:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012306915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:20:54,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:20:54,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 21:20:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120633099] [2024-11-20 21:20:54,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:20:54,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:20:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:54,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:20:54,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:20:54,560 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-20 21:20:54,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:54,607 INFO L93 Difference]: Finished difference Result 313 states and 329 transitions. [2024-11-20 21:20:54,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 21:20:54,608 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-20 21:20:54,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:54,609 INFO L225 Difference]: With dead ends: 313 [2024-11-20 21:20:54,609 INFO L226 Difference]: Without dead ends: 274 [2024-11-20 21:20:54,610 INFO L431 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-20 21:20:54,610 INFO L432 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-20 21:20:54,610 INFO L433 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-20 21:20:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-20 21:20:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2024-11-20 21:20:54,624 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-20 21:20:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 285 transitions. [2024-11-20 21:20:54,625 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 285 transitions. Word has length 120 [2024-11-20 21:20:54,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:54,626 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 285 transitions. [2024-11-20 21:20:54,626 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-20 21:20:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 285 transitions. [2024-11-20 21:20:54,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-20 21:20:54,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:54,627 INFO L215 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-20 21:20:54,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 21:20:54,627 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-20 21:20:54,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:54,628 INFO L85 PathProgramCache]: Analyzing trace with hash -563744935, now seen corresponding path program 1 times [2024-11-20 21:20:54,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:54,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403017706] [2024-11-20 21:20:54,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:54,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:55,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:55,041 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-20 21:20:55,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:55,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403017706] [2024-11-20 21:20:55,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403017706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:55,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689925218] [2024-11-20 21:20:55,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:55,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:55,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:55,043 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-20 21:20:55,044 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-20 21:20:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:55,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 1747 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 21:20:55,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:55,562 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-20 21:20:55,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:55,729 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-20 21:20:55,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689925218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:55,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:55,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-20 21:20:55,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349248713] [2024-11-20 21:20:55,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:55,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-20 21:20:55,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:55,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-20 21:20:55,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-20 21:20:55,732 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-20 21:20:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:55,819 INFO L93 Difference]: Finished difference Result 311 states and 336 transitions. [2024-11-20 21:20:55,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-20 21:20:55,820 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-20 21:20:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:55,821 INFO L225 Difference]: With dead ends: 311 [2024-11-20 21:20:55,821 INFO L226 Difference]: Without dead ends: 307 [2024-11-20 21:20:55,821 INFO L431 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-20 21:20:55,822 INFO L432 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-20 21:20:55,822 INFO L433 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-20 21:20:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-20 21:20:55,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-20 21:20:55,829 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-20 21:20:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 321 transitions. [2024-11-20 21:20:55,830 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 321 transitions. Word has length 121 [2024-11-20 21:20:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:55,831 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 321 transitions. [2024-11-20 21:20:55,831 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-20 21:20:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 321 transitions. [2024-11-20 21:20:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 21:20:55,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:55,832 INFO L215 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-20 21:20:55,843 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-20 21:20:56,032 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-20 21:20:56,033 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-20 21:20:56,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:56,034 INFO L85 PathProgramCache]: Analyzing trace with hash 284015833, now seen corresponding path program 2 times [2024-11-20 21:20:56,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:56,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953267595] [2024-11-20 21:20:56,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:56,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:56,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 21:20:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:20:56,807 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-20 21:20:56,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:20:56,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953267595] [2024-11-20 21:20:56,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953267595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:20:56,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331017861] [2024-11-20 21:20:56,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:20:56,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:20:56,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:20:56,811 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-20 21:20:56,811 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-20 21:20:57,328 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 21:20:57,328 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:20:57,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 1975 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-20 21:20:57,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:20:57,411 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-20 21:20:57,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:20:57,971 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-20 21:20:57,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331017861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:20:57,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:20:57,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 45 [2024-11-20 21:20:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348003513] [2024-11-20 21:20:57,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:20:57,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-20 21:20:57,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:20:57,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-20 21:20:57,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2024-11-20 21:20:57,974 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-20 21:20:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:20:58,195 INFO L93 Difference]: Finished difference Result 371 states and 404 transitions. [2024-11-20 21:20:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-20 21:20:58,200 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-20 21:20:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:20:58,201 INFO L225 Difference]: With dead ends: 371 [2024-11-20 21:20:58,201 INFO L226 Difference]: Without dead ends: 367 [2024-11-20 21:20:58,202 INFO L431 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-20 21:20:58,203 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-20 21:20:58,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 268 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 21:20:58,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-20 21:20:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2024-11-20 21:20:58,211 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-20 21:20:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 381 transitions. [2024-11-20 21:20:58,212 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 381 transitions. Word has length 157 [2024-11-20 21:20:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:20:58,213 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 381 transitions. [2024-11-20 21:20:58,215 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-20 21:20:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 381 transitions. [2024-11-20 21:20:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-20 21:20:58,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:20:58,217 INFO L215 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-20 21:20:58,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-20 21:20:58,421 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-20 21:20:58,422 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-20 21:20:58,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:20:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash -65465511, now seen corresponding path program 3 times [2024-11-20 21:20:58,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:20:58,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783001631] [2024-11-20 21:20:58,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:20:58,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:20:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 21:20:58,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 21:20:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 21:20:59,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 21:20:59,461 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 21:20:59,462 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONUNSUPPORTED_FEATURE (24 of 25 remaining) [2024-11-20 21:20:59,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2024-11-20 21:20:59,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2024-11-20 21:20:59,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 25 remaining) [2024-11-20 21:20:59,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2024-11-20 21:20:59,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2024-11-20 21:20:59,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2024-11-20 21:20:59,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2024-11-20 21:20:59,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 25 remaining) [2024-11-20 21:20:59,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2024-11-20 21:20:59,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2024-11-20 21:20:59,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 25 remaining) [2024-11-20 21:20:59,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 25 remaining) [2024-11-20 21:20:59,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 25 remaining) [2024-11-20 21:20:59,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 25 remaining) [2024-11-20 21:20:59,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2024-11-20 21:20:59,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2024-11-20 21:20:59,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 25 remaining) [2024-11-20 21:20:59,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2024-11-20 21:20:59,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2024-11-20 21:20:59,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2024-11-20 21:20:59,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2024-11-20 21:20:59,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 25 remaining) [2024-11-20 21:20:59,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2024-11-20 21:20:59,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2024-11-20 21:20:59,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 21:20:59,470 INFO L407 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-20 21:20:59,577 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 21:20:59,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:20:59 BoogieIcfgContainer [2024-11-20 21:20:59,585 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 21:20:59,585 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 21:20:59,585 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 21:20:59,586 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 21:20:59,586 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:20:42" (3/4) ... [2024-11-20 21:20:59,588 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 21:20:59,589 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 21:20:59,590 INFO L158 Benchmark]: Toolchain (without parser) took 18984.59ms. Allocated memory was 159.4MB in the beginning and 664.8MB in the end (delta: 505.4MB). Free memory was 85.7MB in the beginning and 428.2MB in the end (delta: -342.5MB). Peak memory consumption was 164.6MB. Max. memory is 16.1GB. [2024-11-20 21:20:59,590 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 159.4MB. Free memory is still 112.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 21:20:59,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 778.18ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 85.4MB in the beginning and 190.2MB in the end (delta: -104.8MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-11-20 21:20:59,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.59ms. Allocated memory is still 255.9MB. Free memory was 190.2MB in the beginning and 183.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 21:20:59,590 INFO L158 Benchmark]: Boogie Preprocessor took 133.62ms. Allocated memory is still 255.9MB. Free memory was 183.9MB in the beginning and 175.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-20 21:20:59,591 INFO L158 Benchmark]: RCFGBuilder took 745.11ms. Allocated memory is still 255.9MB. Free memory was 175.5MB in the beginning and 114.7MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-11-20 21:20:59,591 INFO L158 Benchmark]: TraceAbstraction took 17243.28ms. Allocated memory was 255.9MB in the beginning and 664.8MB in the end (delta: 408.9MB). Free memory was 113.6MB in the beginning and 428.2MB in the end (delta: -314.6MB). Peak memory consumption was 218.0MB. Max. memory is 16.1GB. [2024-11-20 21:20:59,591 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 664.8MB. Free memory is still 428.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 21:20:59,592 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.09ms. Allocated memory is still 159.4MB. Free memory is still 112.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 778.18ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 85.4MB in the beginning and 190.2MB in the end (delta: -104.8MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.59ms. Allocated memory is still 255.9MB. Free memory was 190.2MB in the beginning and 183.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 133.62ms. Allocated memory is still 255.9MB. Free memory was 183.9MB in the beginning and 175.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 745.11ms. Allocated memory is still 255.9MB. Free memory was 175.5MB in the beginning and 114.7MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17243.28ms. Allocated memory was 255.9MB in the beginning and 664.8MB in the end (delta: 408.9MB). Free memory was 113.6MB in the beginning and 428.2MB in the end (delta: -314.6MB). Peak memory consumption was 218.0MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 664.8MB. Free memory is still 428.2MB. 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-20 21:21:02,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 21:21:02,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 21:21:02,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 21:21:02,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 21:21:02,279 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 21:21:02,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-20 21:21:03,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 21:21:03,862 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 21:21:03,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2024-11-20 21:21:03,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9fe3808/9567bc5f083041f68c2c245d7cae7f82/FLAGeede198a7 [2024-11-20 21:21:03,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce9fe3808/9567bc5f083041f68c2c245d7cae7f82 [2024-11-20 21:21:03,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 21:21:03,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 21:21:03,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 21:21:03,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 21:21:03,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 21:21:03,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:21:03" (1/1) ... [2024-11-20 21:21:03,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3b6fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:03, skipping insertion in model container [2024-11-20 21:21:03,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:21:03" (1/1) ... [2024-11-20 21:21:03,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 21:21:04,396 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-20 21:21:04,416 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-20 21:21:04,418 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-20 21:21:04,434 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-20 21:21:04,441 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-20 21:21:04,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 21:21:04,482 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 21:21:04,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 21:21:04,645 INFO L204 MainTranslator]: Completed translation [2024-11-20 21:21:04,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:04 WrapperNode [2024-11-20 21:21:04,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 21:21:04,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 21:21:04,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 21:21:04,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 21:21:04,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:04" (1/1) ... [2024-11-20 21:21:04,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:04" (1/1) ... [2024-11-20 21:21:04,764 INFO L138 Inliner]: procedures = 351, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 663 [2024-11-20 21:21:04,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 21:21:04,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 21:21:04,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 21:21:04,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 21:21:04,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:04" (1/1) ... [2024-11-20 21:21:04,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:04" (1/1) ... [2024-11-20 21:21:04,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:04" (1/1) ... [2024-11-20 21:21:04,804 INFO L175 MemorySlicer]: Split 450 memory accesses to 15 slices as follows [2, 3, 3, 3, 4, 4, 4, 4, 3, 44, 355, 11, 6, 2, 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, 2, 2, 2, 1]. [2024-11-20 21:21:04,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:04" (1/1) ... [2024-11-20 21:21:04,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:04" (1/1) ... [2024-11-20 21:21:04,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:04" (1/1) ... [2024-11-20 21:21:04,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:04" (1/1) ... [2024-11-20 21:21:04,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:04" (1/1) ... [2024-11-20 21:21:04,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:04" (1/1) ... [2024-11-20 21:21:04,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 21:21:04,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 21:21:04,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 21:21:04,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 21:21:04,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:04" (1/1) ... [2024-11-20 21:21:04,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 21:21:04,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:21:04,879 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-20 21:21:04,888 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-20 21:21:04,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 21:21:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 21:21:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 21:21:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-20 21:21:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-20 21:21:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-20 21:21:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-20 21:21:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-20 21:21:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-20 21:21:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-20 21:21:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-20 21:21:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-20 21:21:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-20 21:21:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-20 21:21:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-20 21:21:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 21:21:04,930 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 21:21:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 21:21:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 21:21:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 21:21:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-20 21:21:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-20 21:21:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-20 21:21:04,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-20 21:21:04,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-20 21:21:04,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-20 21:21:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-20 21:21:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-20 21:21:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-20 21:21:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-20 21:21:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-20 21:21:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-11-20 21:21:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 21:21:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 21:21:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-20 21:21:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-20 21:21:04,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-20 21:21:04,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-20 21:21:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-20 21:21:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-20 21:21:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-20 21:21:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-20 21:21:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-20 21:21:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-20 21:21:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-20 21:21:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-20 21:21:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-20 21:21:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-20 21:21:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-11-20 21:21:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 21:21:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 21:21:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 21:21:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-20 21:21:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-20 21:21:04,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-20 21:21:04,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-20 21:21:04,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-20 21:21:04,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-20 21:21:04,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-20 21:21:04,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-20 21:21:04,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-20 21:21:04,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-20 21:21:04,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-20 21:21:04,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-20 21:21:04,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-20 21:21:04,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-20 21:21:04,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-20 21:21:04,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-20 21:21:04,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-20 21:21:04,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-20 21:21:04,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-20 21:21:04,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-20 21:21:04,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-20 21:21:04,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-20 21:21:04,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-20 21:21:04,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-20 21:21:04,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-20 21:21:04,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-20 21:21:04,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-20 21:21:04,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 21:21:04,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 21:21:04,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 21:21:04,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 21:21:04,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 21:21:04,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-20 21:21:04,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-20 21:21:04,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-20 21:21:04,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-20 21:21:04,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-20 21:21:04,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-20 21:21:04,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-20 21:21:04,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-20 21:21:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-20 21:21:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-20 21:21:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-20 21:21:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-11-20 21:21:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 21:21:04,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 21:21:05,156 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 21:21:05,158 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 21:21:05,862 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-20 21:21:05,862 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 21:21:05,871 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 21:21:05,872 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-20 21:21:05,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:21:05 BoogieIcfgContainer [2024-11-20 21:21:05,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 21:21:05,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 21:21:05,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 21:21:05,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 21:21:05,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:21:03" (1/3) ... [2024-11-20 21:21:05,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab2e2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:21:05, skipping insertion in model container [2024-11-20 21:21:05,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:21:04" (2/3) ... [2024-11-20 21:21:05,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab2e2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:21:05, skipping insertion in model container [2024-11-20 21:21:05,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:21:05" (3/3) ... [2024-11-20 21:21:05,878 INFO L112 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2024-11-20 21:21:05,899 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 21:21:05,899 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-20 21:21:05,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 21:21:05,947 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;@12e9ee13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 21:21:05,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-20 21:21:05,952 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-20 21:21:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 21:21:05,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:05,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 21:21:05,957 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-20 21:21:05,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:05,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1172037, now seen corresponding path program 1 times [2024-11-20 21:21:05,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:05,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995109357] [2024-11-20 21:21:05,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:05,973 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-20 21:21:05,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:05,976 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-20 21:21:05,977 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-20 21:21:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:06,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 21:21:06,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:06,335 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-20 21:21:06,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:06,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:06,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995109357] [2024-11-20 21:21:06,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995109357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:06,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:06,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 21:21:06,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176058687] [2024-11-20 21:21:06,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:06,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 21:21:06,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:06,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 21:21:06,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 21:21:06,359 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-20 21:21:06,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:06,375 INFO L93 Difference]: Finished difference Result 154 states and 214 transitions. [2024-11-20 21:21:06,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 21:21:06,376 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-20 21:21:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:06,393 INFO L225 Difference]: With dead ends: 154 [2024-11-20 21:21:06,393 INFO L226 Difference]: Without dead ends: 67 [2024-11-20 21:21:06,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 21:21:06,398 INFO L432 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-20 21:21:06,399 INFO L433 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-20 21:21:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-20 21:21:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-20 21:21:06,423 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-20 21:21:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2024-11-20 21:21:06,425 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 4 [2024-11-20 21:21:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:06,426 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-11-20 21:21:06,426 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-20 21:21:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2024-11-20 21:21:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 21:21:06,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:06,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 21:21:06,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 21:21:06,627 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-20 21:21:06,628 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-20 21:21:06,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:06,629 INFO L85 PathProgramCache]: Analyzing trace with hash 36333200, now seen corresponding path program 1 times [2024-11-20 21:21:06,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:06,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288459573] [2024-11-20 21:21:06,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:06,630 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-20 21:21:06,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:06,632 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-20 21:21:06,633 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-20 21:21:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:06,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:21:06,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:06,930 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-20 21:21:06,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:06,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:06,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288459573] [2024-11-20 21:21:06,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288459573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:06,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:06,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:21:06,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276025240] [2024-11-20 21:21:06,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:06,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:06,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:06,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:06,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:06,933 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-20 21:21:06,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:06,986 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2024-11-20 21:21:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:06,988 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-20 21:21:06,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:06,989 INFO L225 Difference]: With dead ends: 132 [2024-11-20 21:21:06,989 INFO L226 Difference]: Without dead ends: 70 [2024-11-20 21:21:06,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:06,991 INFO L432 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-20 21:21:06,991 INFO L433 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-20 21:21:06,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-20 21:21:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-20 21:21:07,031 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-20 21:21:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2024-11-20 21:21:07,032 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 5 [2024-11-20 21:21:07,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:07,033 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2024-11-20 21:21:07,033 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-20 21:21:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2024-11-20 21:21:07,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 21:21:07,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:07,033 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2024-11-20 21:21:07,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 21:21:07,234 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-20 21:21:07,235 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-20 21:21:07,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:07,236 INFO L85 PathProgramCache]: Analyzing trace with hash 70650370, now seen corresponding path program 1 times [2024-11-20 21:21:07,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:07,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056439874] [2024-11-20 21:21:07,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:07,237 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-20 21:21:07,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:07,240 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-20 21:21:07,242 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-20 21:21:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:07,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:21:07,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:07,531 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-20 21:21:07,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:07,561 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-20 21:21:07,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:07,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056439874] [2024-11-20 21:21:07,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056439874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:07,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:07,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-20 21:21:07,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091102591] [2024-11-20 21:21:07,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:07,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:21:07,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:07,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:21:07,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:07,563 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-20 21:21:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:07,621 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2024-11-20 21:21:07,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:07,621 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-20 21:21:07,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:07,622 INFO L225 Difference]: With dead ends: 135 [2024-11-20 21:21:07,622 INFO L226 Difference]: Without dead ends: 73 [2024-11-20 21:21:07,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:21:07,623 INFO L432 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-20 21:21:07,624 INFO L433 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-20 21:21:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-20 21:21:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-11-20 21:21:07,628 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-20 21:21:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2024-11-20 21:21:07,629 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 8 [2024-11-20 21:21:07,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:07,629 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2024-11-20 21:21:07,629 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-20 21:21:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2024-11-20 21:21:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 21:21:07,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:07,630 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:07,640 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-20 21:21:07,830 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-20 21:21:07,831 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-20 21:21:07,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:07,832 INFO L85 PathProgramCache]: Analyzing trace with hash 894156632, now seen corresponding path program 1 times [2024-11-20 21:21:07,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:07,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307874277] [2024-11-20 21:21:07,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:07,833 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-20 21:21:07,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:07,837 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-20 21:21:07,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 (5)] Waiting until timeout for monitored process [2024-11-20 21:21:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:08,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 21:21:08,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:08,327 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-20 21:21:08,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:08,380 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-20 21:21:08,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:08,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307874277] [2024-11-20 21:21:08,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307874277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:08,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:08,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 21:21:08,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505459051] [2024-11-20 21:21:08,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:08,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 21:21:08,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:08,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 21:21:08,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 21:21:08,383 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-20 21:21:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:08,564 INFO L93 Difference]: Finished difference Result 143 states and 174 transitions. [2024-11-20 21:21:08,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 21:21:08,565 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-20 21:21:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:08,565 INFO L225 Difference]: With dead ends: 143 [2024-11-20 21:21:08,565 INFO L226 Difference]: Without dead ends: 82 [2024-11-20 21:21:08,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:21:08,567 INFO L432 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-20 21:21:08,567 INFO L433 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-20 21:21:08,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-20 21:21:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-20 21:21:08,571 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-20 21:21:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2024-11-20 21:21:08,572 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 17 [2024-11-20 21:21:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:08,572 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2024-11-20 21:21:08,573 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-20 21:21:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2024-11-20 21:21:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 21:21:08,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:08,573 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:08,585 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-20 21:21:08,774 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-20 21:21:08,774 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-20 21:21:08,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash -742370088, now seen corresponding path program 2 times [2024-11-20 21:21:08,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:08,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561209300] [2024-11-20 21:21:08,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:08,776 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-20 21:21:08,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:08,779 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-20 21:21:08,781 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-20 21:21:09,057 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:21:09,057 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:09,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 21:21:09,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:09,117 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-20 21:21:09,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:09,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:09,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561209300] [2024-11-20 21:21:09,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561209300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:09,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:09,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 21:21:09,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211640032] [2024-11-20 21:21:09,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:09,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:21:09,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:09,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:21:09,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:21:09,119 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-20 21:21:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:09,299 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-11-20 21:21:09,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 21:21:09,300 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-20 21:21:09,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:09,301 INFO L225 Difference]: With dead ends: 82 [2024-11-20 21:21:09,301 INFO L226 Difference]: Without dead ends: 80 [2024-11-20 21:21:09,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:21:09,302 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:09,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 210 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 21:21:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-20 21:21:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-20 21:21:09,306 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-20 21:21:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-20 21:21:09,307 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 29 [2024-11-20 21:21:09,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:09,307 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-20 21:21:09,308 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-20 21:21:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-11-20 21:21:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 21:21:09,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:09,309 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:09,325 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-20 21:21:09,512 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-20 21:21:09,513 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-20 21:21:09,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:09,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1569821756, now seen corresponding path program 1 times [2024-11-20 21:21:09,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:09,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635755819] [2024-11-20 21:21:09,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:09,516 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-20 21:21:09,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:09,517 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-20 21:21:09,518 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-20 21:21:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:09,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 21:21:09,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:09,897 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-20 21:21:09,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:10,035 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-20 21:21:10,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:10,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635755819] [2024-11-20 21:21:10,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635755819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:10,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:10,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-20 21:21:10,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530054582] [2024-11-20 21:21:10,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:10,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 21:21:10,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:10,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 21:21:10,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-20 21:21:10,038 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-20 21:21:10,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:10,305 INFO L93 Difference]: Finished difference Result 151 states and 182 transitions. [2024-11-20 21:21:10,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 21:21:10,308 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-20 21:21:10,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:10,309 INFO L225 Difference]: With dead ends: 151 [2024-11-20 21:21:10,309 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 21:21:10,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 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-20 21:21:10,310 INFO L432 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-20 21:21:10,310 INFO L433 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-20 21:21:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 21:21:10,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-20 21:21:10,315 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-20 21:21:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2024-11-20 21:21:10,316 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 35 [2024-11-20 21:21:10,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:10,316 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2024-11-20 21:21:10,316 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-20 21:21:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2024-11-20 21:21:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-20 21:21:10,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:10,317 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:10,329 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-20 21:21:10,521 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-20 21:21:10,522 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-20 21:21:10,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:10,522 INFO L85 PathProgramCache]: Analyzing trace with hash 200843588, now seen corresponding path program 2 times [2024-11-20 21:21:10,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:10,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430701228] [2024-11-20 21:21:10,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:10,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 21:21:10,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:10,525 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-20 21:21:10,526 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-20 21:21:10,973 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:21:10,973 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:10,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:21:10,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:11,002 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-20 21:21:11,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:11,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:11,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430701228] [2024-11-20 21:21:11,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430701228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:11,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:11,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:21:11,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954531395] [2024-11-20 21:21:11,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:11,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:11,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:11,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:11,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:11,004 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-20 21:21:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:11,045 INFO L93 Difference]: Finished difference Result 144 states and 173 transitions. [2024-11-20 21:21:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:11,046 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-20 21:21:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:11,047 INFO L225 Difference]: With dead ends: 144 [2024-11-20 21:21:11,047 INFO L226 Difference]: Without dead ends: 95 [2024-11-20 21:21:11,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:11,048 INFO L432 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-20 21:21:11,048 INFO L433 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-20 21:21:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-20 21:21:11,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-20 21:21:11,067 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-20 21:21:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2024-11-20 21:21:11,068 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 47 [2024-11-20 21:21:11,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:11,068 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2024-11-20 21:21:11,068 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-20 21:21:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2024-11-20 21:21:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-20 21:21:11,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:11,069 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:11,083 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-20 21:21:11,276 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-20 21:21:11,276 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-20 21:21:11,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:11,277 INFO L85 PathProgramCache]: Analyzing trace with hash 441968304, now seen corresponding path program 1 times [2024-11-20 21:21:11,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:11,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146930591] [2024-11-20 21:21:11,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:11,277 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-20 21:21:11,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:11,280 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-20 21:21:11,290 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-20 21:21:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:11,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:21:11,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-20 21:21:11,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:11,753 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-20 21:21:11,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146930591] [2024-11-20 21:21:11,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146930591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:11,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:11,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-20 21:21:11,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983449199] [2024-11-20 21:21:11,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:11,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:21:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:11,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:21:11,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:11,755 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-20 21:21:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:11,873 INFO L93 Difference]: Finished difference Result 150 states and 181 transitions. [2024-11-20 21:21:11,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:11,873 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-20 21:21:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:11,874 INFO L225 Difference]: With dead ends: 150 [2024-11-20 21:21:11,874 INFO L226 Difference]: Without dead ends: 98 [2024-11-20 21:21:11,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:21:11,875 INFO L432 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-20 21:21:11,875 INFO L433 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-20 21:21:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-20 21:21:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2024-11-20 21:21:11,883 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-20 21:21:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2024-11-20 21:21:11,884 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 50 [2024-11-20 21:21:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:11,884 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2024-11-20 21:21:11,884 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-20 21:21:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2024-11-20 21:21:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-20 21:21:11,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:11,885 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:11,898 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-20 21:21:12,089 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-20 21:21:12,090 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-20 21:21:12,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash -848834540, now seen corresponding path program 1 times [2024-11-20 21:21:12,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:12,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740072205] [2024-11-20 21:21:12,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:12,092 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-20 21:21:12,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:12,094 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-20 21:21:12,095 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-20 21:21:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:12,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:21:12,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:12,431 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-20 21:21:12,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:12,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:12,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740072205] [2024-11-20 21:21:12,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740072205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:12,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:12,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 21:21:12,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110548283] [2024-11-20 21:21:12,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:12,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:12,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:12,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:12,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:12,433 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-20 21:21:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:12,451 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2024-11-20 21:21:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:12,451 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-20 21:21:12,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:12,452 INFO L225 Difference]: With dead ends: 106 [2024-11-20 21:21:12,452 INFO L226 Difference]: Without dead ends: 96 [2024-11-20 21:21:12,452 INFO L431 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-20 21:21:12,453 INFO L432 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-20 21:21:12,453 INFO L433 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-20 21:21:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-20 21:21:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-20 21:21:12,458 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-20 21:21:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2024-11-20 21:21:12,458 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 54 [2024-11-20 21:21:12,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:12,459 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2024-11-20 21:21:12,459 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-20 21:21:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2024-11-20 21:21:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-20 21:21:12,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:12,460 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:12,472 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-20 21:21:12,660 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-20 21:21:12,661 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-20 21:21:12,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash 926172822, now seen corresponding path program 1 times [2024-11-20 21:21:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:12,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142096408] [2024-11-20 21:21:12,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:12,662 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-20 21:21:12,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:12,664 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-20 21:21:12,665 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-20 21:21:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:12,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 21:21:12,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:13,046 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-20 21:21:13,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:13,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:13,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142096408] [2024-11-20 21:21:13,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142096408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:13,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:13,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 21:21:13,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264033636] [2024-11-20 21:21:13,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:13,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:21:13,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:13,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:21:13,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:21:13,048 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-20 21:21:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:13,306 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-11-20 21:21:13,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 21:21:13,307 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-20 21:21:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:13,307 INFO L225 Difference]: With dead ends: 113 [2024-11-20 21:21:13,307 INFO L226 Difference]: Without dead ends: 101 [2024-11-20 21:21:13,308 INFO L431 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-20 21:21:13,308 INFO L432 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-20 21:21:13,309 INFO L433 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-20 21:21:13,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-20 21:21:13,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-20 21:21:13,313 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-20 21:21:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2024-11-20 21:21:13,314 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 54 [2024-11-20 21:21:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:13,314 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2024-11-20 21:21:13,314 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-20 21:21:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2024-11-20 21:21:13,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-20 21:21:13,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:13,315 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:13,328 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-20 21:21:13,519 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-20 21:21:13,520 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-20 21:21:13,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:13,520 INFO L85 PathProgramCache]: Analyzing trace with hash -909455939, now seen corresponding path program 1 times [2024-11-20 21:21:13,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:13,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051713376] [2024-11-20 21:21:13,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:13,521 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-20 21:21:13,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:13,524 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-20 21:21:13,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-20 21:21:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:13,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 21:21:13,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:13,941 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-20 21:21:13,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:13,979 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-20 21:21:13,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:13,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051713376] [2024-11-20 21:21:13,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051713376] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:13,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:13,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 21:21:13,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982880012] [2024-11-20 21:21:13,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:13,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 21:21:13,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 21:21:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 21:21:13,981 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-20 21:21:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:14,262 INFO L93 Difference]: Finished difference Result 165 states and 196 transitions. [2024-11-20 21:21:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 21:21:14,263 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-20 21:21:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:14,264 INFO L225 Difference]: With dead ends: 165 [2024-11-20 21:21:14,264 INFO L226 Difference]: Without dead ends: 110 [2024-11-20 21:21:14,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:21:14,265 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 8 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:14,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 354 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 21:21:14,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-20 21:21:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-20 21:21:14,275 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-20 21:21:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2024-11-20 21:21:14,276 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 54 [2024-11-20 21:21:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:14,277 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2024-11-20 21:21:14,277 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-20 21:21:14,277 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2024-11-20 21:21:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-20 21:21:14,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:14,278 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:14,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-20 21:21:14,478 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-20 21:21:14,479 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-20 21:21:14,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:14,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1726736795, now seen corresponding path program 1 times [2024-11-20 21:21:14,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:14,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973933201] [2024-11-20 21:21:14,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:14,480 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-20 21:21:14,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:14,482 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-20 21:21:14,483 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-20 21:21:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:14,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:21:14,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:14,799 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-20 21:21:14,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:14,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:14,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973933201] [2024-11-20 21:21:14,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973933201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:14,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:14,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 21:21:14,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557749715] [2024-11-20 21:21:14,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:14,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:14,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:14,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:14,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:14,801 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-20 21:21:14,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:14,811 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2024-11-20 21:21:14,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:14,812 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-20 21:21:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:14,812 INFO L225 Difference]: With dead ends: 128 [2024-11-20 21:21:14,812 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 21:21:14,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:14,813 INFO L432 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-20 21:21:14,813 INFO L433 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-20 21:21:14,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 21:21:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-20 21:21:14,818 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-20 21:21:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2024-11-20 21:21:14,818 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 55 [2024-11-20 21:21:14,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:14,819 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2024-11-20 21:21:14,819 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-20 21:21:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2024-11-20 21:21:14,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-20 21:21:14,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:14,820 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:14,831 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-20 21:21:15,020 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-20 21:21:15,020 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-20 21:21:15,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash 84280908, now seen corresponding path program 1 times [2024-11-20 21:21:15,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:15,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351177127] [2024-11-20 21:21:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:15,022 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-20 21:21:15,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:15,024 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-20 21:21:15,025 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-20 21:21:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:15,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:21:15,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:15,384 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-20 21:21:15,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:15,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351177127] [2024-11-20 21:21:15,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351177127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:15,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:15,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:21:15,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525855410] [2024-11-20 21:21:15,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:15,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:15,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:15,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:15,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:15,386 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-20 21:21:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:15,407 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2024-11-20 21:21:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:15,408 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-20 21:21:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:15,408 INFO L225 Difference]: With dead ends: 100 [2024-11-20 21:21:15,409 INFO L226 Difference]: Without dead ends: 95 [2024-11-20 21:21:15,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:15,409 INFO L432 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-20 21:21:15,409 INFO L433 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-20 21:21:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-20 21:21:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-20 21:21:15,413 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-20 21:21:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-20 21:21:15,414 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 55 [2024-11-20 21:21:15,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:15,414 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-20 21:21:15,414 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-20 21:21:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-20 21:21:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-20 21:21:15,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:15,415 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:15,427 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 (14)] Ended with exit code 0 [2024-11-20 21:21:15,619 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-20 21:21:15,620 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-20 21:21:15,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1743125332, now seen corresponding path program 1 times [2024-11-20 21:21:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:15,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452496308] [2024-11-20 21:21:15,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:15,622 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-20 21:21:15,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:15,624 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-20 21:21:15,625 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-20 21:21:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:15,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 21:21:15,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:15,976 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-20 21:21:15,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:16,027 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-20 21:21:16,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:16,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452496308] [2024-11-20 21:21:16,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452496308] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:16,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:16,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-20 21:21:16,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101257597] [2024-11-20 21:21:16,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:16,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:21:16,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:16,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:21:16,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:16,029 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-20 21:21:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:16,079 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2024-11-20 21:21:16,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:16,080 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-20 21:21:16,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:16,080 INFO L225 Difference]: With dead ends: 103 [2024-11-20 21:21:16,080 INFO L226 Difference]: Without dead ends: 98 [2024-11-20 21:21:16,081 INFO L431 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-20 21:21:16,081 INFO L432 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-20 21:21:16,081 INFO L433 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-20 21:21:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-20 21:21:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2024-11-20 21:21:16,087 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-20 21:21:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-20 21:21:16,087 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 58 [2024-11-20 21:21:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:16,088 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-20 21:21:16,088 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-20 21:21:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-20 21:21:16,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-20 21:21:16,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:16,089 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:16,101 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-20 21:21:16,293 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-20 21:21:16,294 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-20 21:21:16,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:16,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1028886172, now seen corresponding path program 1 times [2024-11-20 21:21:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:16,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934746019] [2024-11-20 21:21:16,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:16,295 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-20 21:21:16,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:16,297 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-20 21:21:16,298 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-20 21:21:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:16,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 21:21:16,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:16,719 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-20 21:21:16,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:16,761 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-20 21:21:16,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:16,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934746019] [2024-11-20 21:21:16,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934746019] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:16,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:16,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 21:21:16,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743219734] [2024-11-20 21:21:16,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:16,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 21:21:16,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:16,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 21:21:16,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 21:21:16,763 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-20 21:21:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:16,860 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2024-11-20 21:21:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 21:21:16,861 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-20 21:21:16,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:16,862 INFO L225 Difference]: With dead ends: 111 [2024-11-20 21:21:16,862 INFO L226 Difference]: Without dead ends: 107 [2024-11-20 21:21:16,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:21:16,862 INFO L432 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-20 21:21:16,863 INFO L433 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-20 21:21:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-20 21:21:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-20 21:21:16,867 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-20 21:21:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2024-11-20 21:21:16,868 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 62 [2024-11-20 21:21:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:16,868 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2024-11-20 21:21:16,868 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-20 21:21:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2024-11-20 21:21:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 21:21:16,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:16,869 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:16,883 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-20 21:21:17,069 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-20 21:21:17,070 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-20 21:21:17,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:17,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1421089981, now seen corresponding path program 2 times [2024-11-20 21:21:17,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:17,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720240119] [2024-11-20 21:21:17,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:17,071 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-20 21:21:17,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:17,073 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-20 21:21:17,074 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-20 21:21:17,385 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:21:17,386 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:17,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 21:21:17,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:17,429 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-20 21:21:17,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:17,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:17,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720240119] [2024-11-20 21:21:17,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720240119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:17,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:17,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:21:17,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554556550] [2024-11-20 21:21:17,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:17,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:17,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:17,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:17,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:17,431 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-20 21:21:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:17,572 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2024-11-20 21:21:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:17,572 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-20 21:21:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:17,573 INFO L225 Difference]: With dead ends: 131 [2024-11-20 21:21:17,574 INFO L226 Difference]: Without dead ends: 130 [2024-11-20 21:21:17,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:21:17,575 INFO L432 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-20 21:21:17,576 INFO L433 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-20 21:21:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-20 21:21:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-20 21:21:17,580 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-20 21:21:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2024-11-20 21:21:17,581 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 66 [2024-11-20 21:21:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:17,581 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2024-11-20 21:21:17,581 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-20 21:21:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2024-11-20 21:21:17,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 21:21:17,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:17,582 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:17,593 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 (17)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:17,786 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-20 21:21:17,787 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-20 21:21:17,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:17,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1336424804, now seen corresponding path program 2 times [2024-11-20 21:21:17,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:17,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403154898] [2024-11-20 21:21:17,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:17,788 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-20 21:21:17,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:17,793 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-20 21:21:17,794 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-20 21:21:18,085 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:21:18,085 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:18,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 21:21:18,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:18,142 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-20 21:21:18,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:21:18,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:18,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403154898] [2024-11-20 21:21:18,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403154898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:21:18,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:21:18,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 21:21:18,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549258026] [2024-11-20 21:21:18,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:18,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 21:21:18,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:18,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 21:21:18,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:21:18,143 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-20 21:21:18,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:18,424 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2024-11-20 21:21:18,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:21:18,424 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-20 21:21:18,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:18,425 INFO L225 Difference]: With dead ends: 170 [2024-11-20 21:21:18,425 INFO L226 Difference]: Without dead ends: 130 [2024-11-20 21:21:18,425 INFO L431 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-20 21:21:18,426 INFO L432 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.3s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:18,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 156 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 21:21:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-20 21:21:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-20 21:21:18,430 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-20 21:21:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2024-11-20 21:21:18,431 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 74 [2024-11-20 21:21:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:18,431 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2024-11-20 21:21:18,431 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-20 21:21:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2024-11-20 21:21:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 21:21:18,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:18,432 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:18,442 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-20 21:21:18,632 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-20 21:21:18,633 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-20 21:21:18,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1905935110, now seen corresponding path program 1 times [2024-11-20 21:21:18,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:18,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110024922] [2024-11-20 21:21:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:18,634 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-20 21:21:18,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:18,637 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-20 21:21:18,637 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-20 21:21:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:19,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 21:21:19,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:19,221 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-20 21:21:19,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:19,339 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-20 21:21:19,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110024922] [2024-11-20 21:21:19,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110024922] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:19,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-20 21:21:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459401016] [2024-11-20 21:21:19,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:19,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 21:21:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 21:21:19,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-20 21:21:19,341 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-20 21:21:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:19,856 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2024-11-20 21:21:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 21:21:19,857 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-20 21:21:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:19,858 INFO L225 Difference]: With dead ends: 221 [2024-11-20 21:21:19,858 INFO L226 Difference]: Without dead ends: 154 [2024-11-20 21:21:19,858 INFO L431 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-20 21:21:19,858 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:19,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 356 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 21:21:19,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-20 21:21:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-20 21:21:19,864 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-20 21:21:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2024-11-20 21:21:19,865 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 89 [2024-11-20 21:21:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:19,865 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2024-11-20 21:21:19,865 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-20 21:21:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2024-11-20 21:21:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 21:21:19,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:19,866 INFO L215 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-20 21:21:19,882 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-20 21:21:20,066 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-20 21:21:20,067 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-20 21:21:20,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:20,067 INFO L85 PathProgramCache]: Analyzing trace with hash -726455591, now seen corresponding path program 1 times [2024-11-20 21:21:20,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:20,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616066772] [2024-11-20 21:21:20,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:21:20,068 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-20 21:21:20,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:20,071 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-20 21:21:20,072 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-20 21:21:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:21:20,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 21:21:20,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:20,849 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-20 21:21:20,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:20,982 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-20 21:21:20,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:20,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616066772] [2024-11-20 21:21:20,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616066772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:20,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:20,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-20 21:21:20,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830707030] [2024-11-20 21:21:20,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:20,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 21:21:20,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:20,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 21:21:20,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-20 21:21:20,985 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-20 21:21:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:21,370 INFO L93 Difference]: Finished difference Result 182 states and 197 transitions. [2024-11-20 21:21:21,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 21:21:21,370 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-20 21:21:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:21,371 INFO L225 Difference]: With dead ends: 182 [2024-11-20 21:21:21,371 INFO L226 Difference]: Without dead ends: 178 [2024-11-20 21:21:21,372 INFO L431 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-20 21:21:21,372 INFO L432 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-20 21:21:21,372 INFO L433 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-20 21:21:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-20 21:21:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-20 21:21:21,379 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-20 21:21:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 186 transitions. [2024-11-20 21:21:21,380 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 186 transitions. Word has length 109 [2024-11-20 21:21:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:21,380 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 186 transitions. [2024-11-20 21:21:21,381 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-20 21:21:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 186 transitions. [2024-11-20 21:21:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-20 21:21:21,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:21,381 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 21:21:21,399 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-20 21:21:21,582 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-20 21:21:21,582 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-20 21:21:21,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:21,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1015277946, now seen corresponding path program 2 times [2024-11-20 21:21:21,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:21,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295856441] [2024-11-20 21:21:21,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:21,584 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-20 21:21:21,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:21,586 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-20 21:21:21,588 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-20 21:21:21,937 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-20 21:21:21,937 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:21,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 21:21:21,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:22,128 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-20 21:21:22,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:22,200 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-20 21:21:22,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:22,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295856441] [2024-11-20 21:21:22,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295856441] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 21:21:22,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:21:22,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-20 21:21:22,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917657850] [2024-11-20 21:21:22,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:21:22,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:21:22,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:22,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:21:22,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:21:22,202 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-20 21:21:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:22,263 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2024-11-20 21:21:22,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:21:22,264 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-20 21:21:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:22,264 INFO L225 Difference]: With dead ends: 178 [2024-11-20 21:21:22,264 INFO L226 Difference]: Without dead ends: 177 [2024-11-20 21:21:22,265 INFO L431 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-20 21:21:22,265 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-20 21:21:22,265 INFO L433 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-20 21:21:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-20 21:21:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 143. [2024-11-20 21:21:22,271 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-20 21:21:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2024-11-20 21:21:22,271 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 113 [2024-11-20 21:21:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:22,272 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2024-11-20 21:21:22,272 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-20 21:21:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2024-11-20 21:21:22,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-20 21:21:22,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:22,273 INFO L215 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-20 21:21:22,284 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-20 21:21:22,476 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-20 21:21:22,477 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-20 21:21:22,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:22,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2140533721, now seen corresponding path program 2 times [2024-11-20 21:21:22,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:22,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959292729] [2024-11-20 21:21:22,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 21:21:22,478 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-20 21:21:22,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:22,480 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-20 21:21:22,482 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-20 21:21:26,568 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 21:21:26,568 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 21:21:26,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 21:21:26,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:21:26,777 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-20 21:21:26,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:21:27,288 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-20 21:21:27,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 21:21:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959292729] [2024-11-20 21:21:27,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959292729] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:21:27,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 21:21:27,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2024-11-20 21:21:27,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686567608] [2024-11-20 21:21:27,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 21:21:27,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-20 21:21:27,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 21:21:27,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-20 21:21:27,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2024-11-20 21:21:27,290 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-20 21:21:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:21:29,266 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2024-11-20 21:21:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-20 21:21:29,266 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-20 21:21:29,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:21:29,267 INFO L225 Difference]: With dead ends: 195 [2024-11-20 21:21:29,268 INFO L226 Difference]: Without dead ends: 191 [2024-11-20 21:21:29,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2024-11-20 21:21:29,269 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2024-11-20 21:21:29,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 821 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 21:21:29,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-20 21:21:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-20 21:21:29,281 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-20 21:21:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 198 transitions. [2024-11-20 21:21:29,282 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 198 transitions. Word has length 133 [2024-11-20 21:21:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:21:29,282 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 198 transitions. [2024-11-20 21:21:29,282 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-20 21:21:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 198 transitions. [2024-11-20 21:21:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-20 21:21:29,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:21:29,284 INFO L215 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-20 21:21:29,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-20 21:21:29,484 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-20 21:21:29,485 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-20 21:21:29,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:21:29,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1178958375, now seen corresponding path program 3 times [2024-11-20 21:21:29,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 21:21:29,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832934506] [2024-11-20 21:21:29,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 21:21:29,486 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-20 21:21:29,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 21:21:29,494 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-20 21:21:29,495 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