./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash d5cca3532c956cbfb3f8d24df68dd431ff61516e63bcc0106c0529c479d6a4ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:35:24,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:35:24,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:35:24,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:35:24,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:35:24,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:35:24,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:35:24,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:35:24,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:35:24,517 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:35:24,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:35:24,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:35:24,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:35:24,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:35:24,519 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:35:24,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:35:24,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:35:24,519 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:35:24,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:35:24,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:35:24,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:35:24,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:35:24,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:35:24,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:35:24,520 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:35:24,520 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:35:24,520 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:35:24,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:35:24,520 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:35:24,520 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:35:24,521 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:35:24,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:35:24,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:35:24,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:35:24,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:24,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:35:24,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:35:24,521 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:35:24,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:35:24,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:35:24,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:35:24,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:35:24,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:35:24,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:35:24,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:35:24,522 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d5cca3532c956cbfb3f8d24df68dd431ff61516e63bcc0106c0529c479d6a4ef [2025-03-04 11:35:24,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:35:24,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:35:24,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:35:24,735 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:35:24,735 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:35:24,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i [2025-03-04 11:35:25,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd88e2308/d83074a2ee64409898495adfe1c4845b/FLAGc36c17520 [2025-03-04 11:35:26,091 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:35:26,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i [2025-03-04 11:35:26,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd88e2308/d83074a2ee64409898495adfe1c4845b/FLAGc36c17520 [2025-03-04 11:35:26,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd88e2308/d83074a2ee64409898495adfe1c4845b [2025-03-04 11:35:26,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:35:26,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:35:26,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:26,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:35:26,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:35:26,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:26" (1/1) ... [2025-03-04 11:35:26,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4478fc83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26, skipping insertion in model container [2025-03-04 11:35:26,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:26" (1/1) ... [2025-03-04 11:35:26,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:35:26,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:26,729 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:35:26,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:26,822 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:35:26,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26 WrapperNode [2025-03-04 11:35:26,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:26,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:26,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:35:26,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:35:26,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26" (1/1) ... [2025-03-04 11:35:26,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26" (1/1) ... [2025-03-04 11:35:26,892 INFO L138 Inliner]: procedures = 145, calls = 327, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 535 [2025-03-04 11:35:26,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:26,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:35:26,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:35:26,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:35:26,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26" (1/1) ... [2025-03-04 11:35:26,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26" (1/1) ... [2025-03-04 11:35:26,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26" (1/1) ... [2025-03-04 11:35:26,934 INFO L175 MemorySlicer]: Split 173 memory accesses to 19 slices as follows [2, 13, 8, 8, 8, 29, 21, 17, 7, 8, 8, 5, 13, 6, 5, 5, 5, 5, 0]. 17 percent of accesses are in the largest equivalence class. The 46 initializations are split as follows [2, 0, 3, 3, 3, 9, 9, 6, 3, 3, 3, 0, 0, 2, 0, 0, 0, 0, 0]. The 43 writes are split as follows [0, 1, 2, 2, 2, 11, 6, 5, 2, 2, 2, 1, 1, 2, 1, 1, 1, 1, 0]. [2025-03-04 11:35:26,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26" (1/1) ... [2025-03-04 11:35:26,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26" (1/1) ... [2025-03-04 11:35:26,969 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26" (1/1) ... [2025-03-04 11:35:26,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26" (1/1) ... [2025-03-04 11:35:26,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26" (1/1) ... [2025-03-04 11:35:26,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26" (1/1) ... [2025-03-04 11:35:26,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:35:26,999 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:35:26,999 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:35:26,999 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:35:27,000 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26" (1/1) ... [2025-03-04 11:35:27,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:27,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:27,026 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) [2025-03-04 11:35:27,029 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 [2025-03-04 11:35:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 11:35:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 11:35:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 11:35:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 11:35:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 11:35:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 11:35:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 11:35:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 11:35:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 11:35:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 11:35:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 11:35:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 11:35:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 11:35:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 11:35:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 11:35:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 11:35:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 11:35:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 11:35:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 11:35:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 11:35:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 11:35:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 11:35:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 11:35:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 11:35:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 11:35:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 11:35:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 11:35:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 11:35:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 11:35:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 11:35:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 11:35:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 11:35:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 11:35:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 11:35:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 11:35:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 11:35:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 11:35:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 11:35:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 11:35:27,053 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 11:35:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:35:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 11:35:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 11:35:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 11:35:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 11:35:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 11:35:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 11:35:27,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 11:35:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 11:35:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 11:35:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 11:35:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 11:35:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 11:35:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 11:35:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 11:35:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 11:35:27,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 11:35:27,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 11:35:27,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 11:35:27,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 11:35:27,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 11:35:27,055 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2025-03-04 11:35:27,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2025-03-04 11:35:27,055 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-04 11:35:27,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-04 11:35:27,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 11:35:27,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 11:35:27,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 11:35:27,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 11:35:27,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 11:35:27,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 11:35:27,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 11:35:27,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 11:35:27,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-04 11:35:27,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-04 11:35:27,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 11:35:27,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-04 11:35:27,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 11:35:27,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 11:35:27,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 11:35:27,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 11:35:27,061 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_destroy [2025-03-04 11:35:27,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_destroy [2025-03-04 11:35:27,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:35:27,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:35:27,274 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:35:27,276 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:35:31,830 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2025-03-04 11:35:31,830 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:35:31,841 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:35:31,842 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:35:31,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:31 BoogieIcfgContainer [2025-03-04 11:35:31,842 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:35:31,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:35:31,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:35:31,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:35:31,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:35:26" (1/3) ... [2025-03-04 11:35:31,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568782e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:31, skipping insertion in model container [2025-03-04 11:35:31,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:26" (2/3) ... [2025-03-04 11:35:31,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568782e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:31, skipping insertion in model container [2025-03-04 11:35:31,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:31" (3/3) ... [2025-03-04 11:35:31,848 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_time_var_mutex.i [2025-03-04 11:35:31,858 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:35:31,860 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_time_var_mutex.i that has 8 procedures, 159 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-04 11:35:31,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:35:31,912 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;@7af7c8d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:35:31,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 11:35:31,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 106 states have internal predecessors, (135), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 11:35:31,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 11:35:31,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:31,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 11:35:31,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:31,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:31,923 INFO L85 PathProgramCache]: Analyzing trace with hash 224229706, now seen corresponding path program 1 times [2025-03-04 11:35:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:31,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085391680] [2025-03-04 11:35:31,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:31,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:32,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 11:35:32,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 11:35:32,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:32,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:35:32,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:32,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085391680] [2025-03-04 11:35:32,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085391680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:32,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:32,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:32,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722659287] [2025-03-04 11:35:32,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:32,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:32,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:32,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:32,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:32,263 INFO L87 Difference]: Start difference. First operand has 159 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 106 states have internal predecessors, (135), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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) [2025-03-04 11:35:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:32,323 INFO L93 Difference]: Finished difference Result 312 states and 488 transitions. [2025-03-04 11:35:32,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:32,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) 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 [2025-03-04 11:35:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:32,328 INFO L225 Difference]: With dead ends: 312 [2025-03-04 11:35:32,328 INFO L226 Difference]: Without dead ends: 13 [2025-03-04 11:35:32,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:32,336 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 0 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:32,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 427 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-04 11:35:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-04 11:35:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 12 states have internal predecessors, (14), 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) [2025-03-04 11:35:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-03-04 11:35:32,363 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 5 [2025-03-04 11:35:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:32,363 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-03-04 11:35:32,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) 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) [2025-03-04 11:35:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-03-04 11:35:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 11:35:32,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:32,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 11:35:32,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:35:32,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:32,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash 224229866, now seen corresponding path program 1 times [2025-03-04 11:35:32,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477508228] [2025-03-04 11:35:32,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:32,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 11:35:32,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 11:35:32,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:32,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:35:32,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:32,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477508228] [2025-03-04 11:35:32,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477508228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:32,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:32,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:32,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414185702] [2025-03-04 11:35:32,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:32,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:32,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:32,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:32,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:32,580 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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) [2025-03-04 11:35:32,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:32,612 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-03-04 11:35:32,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:32,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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 [2025-03-04 11:35:32,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:32,613 INFO L225 Difference]: With dead ends: 17 [2025-03-04 11:35:32,613 INFO L226 Difference]: Without dead ends: 15 [2025-03-04 11:35:32,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:32,614 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 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 [2025-03-04 11:35:32,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-04 11:35:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-04 11:35:32,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 14 states have internal predecessors, (16), 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) [2025-03-04 11:35:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-03-04 11:35:32,619 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 5 [2025-03-04 11:35:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:32,619 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-03-04 11:35:32,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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) [2025-03-04 11:35:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-03-04 11:35:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:35:32,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:32,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:32,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:35:32,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:32,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1357959516, now seen corresponding path program 1 times [2025-03-04 11:35:32,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:32,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724210849] [2025-03-04 11:35:32,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:32,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:32,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:35:32,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:35:32,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:32,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:35:32,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:32,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724210849] [2025-03-04 11:35:32,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724210849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:32,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673915440] [2025-03-04 11:35:32,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:32,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:32,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:32,765 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) [2025-03-04 11:35:32,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:35:32,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:35:32,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:35:32,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:32,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:32,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:35:32,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:35:33,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:35:33,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673915440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:33,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:33,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:35:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363965614] [2025-03-04 11:35:33,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:33,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:35:33,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:33,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:35:33,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:33,061 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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) [2025-03-04 11:35:33,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:33,105 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-04 11:35:33,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:35:33,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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 [2025-03-04 11:35:33,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:33,106 INFO L225 Difference]: With dead ends: 32 [2025-03-04 11:35:33,106 INFO L226 Difference]: Without dead ends: 19 [2025-03-04 11:35:33,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:33,106 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:33,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-04 11:35:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-04 11:35:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 18 states have internal predecessors, (21), 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) [2025-03-04 11:35:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2025-03-04 11:35:33,108 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 8 [2025-03-04 11:35:33,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:33,109 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2025-03-04 11:35:33,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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) [2025-03-04 11:35:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2025-03-04 11:35:33,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:35:33,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:33,109 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:33,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:35:33,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:33,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:33,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:33,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1357959676, now seen corresponding path program 1 times [2025-03-04 11:35:33,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:33,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946139646] [2025-03-04 11:35:33,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:33,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:33,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:35:33,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:35:33,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:33,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:35:33,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:33,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946139646] [2025-03-04 11:35:33,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946139646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:33,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389199803] [2025-03-04 11:35:33,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:33,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:33,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:33,459 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) [2025-03-04 11:35:33,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:35:33,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:35:33,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:35:33,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:33,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:33,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:35:33,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:35:33,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:33,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389199803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:33,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:33,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 11:35:33,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282197733] [2025-03-04 11:35:33,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:33,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:33,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:33,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:33,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:33,692 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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) [2025-03-04 11:35:33,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:33,734 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2025-03-04 11:35:33,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:33,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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 [2025-03-04 11:35:33,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:33,735 INFO L225 Difference]: With dead ends: 19 [2025-03-04 11:35:33,735 INFO L226 Difference]: Without dead ends: 18 [2025-03-04 11:35:33,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:33,737 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:33,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-04 11:35:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-04 11:35:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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) [2025-03-04 11:35:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-03-04 11:35:33,739 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 8 [2025-03-04 11:35:33,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:33,739 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-03-04 11:35:33,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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) [2025-03-04 11:35:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-03-04 11:35:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 11:35:33,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:33,742 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2025-03-04 11:35:33,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:33,942 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 [2025-03-04 11:35:33,943 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:33,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:33,943 INFO L85 PathProgramCache]: Analyzing trace with hash -397513410, now seen corresponding path program 1 times [2025-03-04 11:35:33,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:33,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920873851] [2025-03-04 11:35:33,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:33,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:33,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 11:35:33,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 11:35:33,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:33,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:35:34,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:34,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920873851] [2025-03-04 11:35:34,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920873851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:34,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:34,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:35:34,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253482704] [2025-03-04 11:35:34,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:34,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:34,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:34,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:34,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:34,045 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-03-04 11:35:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:34,057 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-03-04 11:35:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:34,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 12 [2025-03-04 11:35:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:34,058 INFO L225 Difference]: With dead ends: 18 [2025-03-04 11:35:34,058 INFO L226 Difference]: Without dead ends: 17 [2025-03-04 11:35:34,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:34,058 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 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 [2025-03-04 11:35:34,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-04 11:35:34,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-04 11:35:34,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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) [2025-03-04 11:35:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-03-04 11:35:34,060 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2025-03-04 11:35:34,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:34,060 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-03-04 11:35:34,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2025-03-04 11:35:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2025-03-04 11:35:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 11:35:34,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:34,064 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 11:35:34,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:35:34,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:34,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash 241707676, now seen corresponding path program 2 times [2025-03-04 11:35:34,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:34,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865252342] [2025-03-04 11:35:34,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:35:34,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:34,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 11:35:34,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 14 statements. [2025-03-04 11:35:34,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:35:34,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:35:34,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:34,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865252342] [2025-03-04 11:35:34,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865252342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:34,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:34,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:34,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736548997] [2025-03-04 11:35:34,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:34,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:34,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:34,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:34,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:34,152 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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) [2025-03-04 11:35:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:34,196 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-03-04 11:35:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:34,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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 14 [2025-03-04 11:35:34,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:34,196 INFO L225 Difference]: With dead ends: 32 [2025-03-04 11:35:34,196 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 11:35:34,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:34,197 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:34,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 11:35:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 11:35:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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) [2025-03-04 11:35:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2025-03-04 11:35:34,199 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 14 [2025-03-04 11:35:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:34,202 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2025-03-04 11:35:34,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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) [2025-03-04 11:35:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2025-03-04 11:35:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 11:35:34,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:34,202 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 11:35:34,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:35:34,202 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:34,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1430662594, now seen corresponding path program 1 times [2025-03-04 11:35:34,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:34,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110878438] [2025-03-04 11:35:34,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:34,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:34,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 11:35:34,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:35:34,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:34,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:35:34,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:34,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110878438] [2025-03-04 11:35:34,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110878438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:34,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159308432] [2025-03-04 11:35:34,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:34,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:34,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:34,417 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) [2025-03-04 11:35:34,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:35:34,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 11:35:34,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 11:35:34,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:34,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:34,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:35:34,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:35:34,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:34,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159308432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:34,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:34,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 11:35:34,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873610100] [2025-03-04 11:35:34,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:34,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:34,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:34,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:34,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:34,744 INFO L87 Difference]: Start difference. First operand 30 states and 32 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) [2025-03-04 11:35:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:34,806 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-04 11:35:34,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:34,806 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 27 [2025-03-04 11:35:34,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:34,807 INFO L225 Difference]: With dead ends: 30 [2025-03-04 11:35:34,807 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 11:35:34,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:34,808 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 15 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:34,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 15 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 11:35:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-04 11:35:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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) [2025-03-04 11:35:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2025-03-04 11:35:34,810 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2025-03-04 11:35:34,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:34,811 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2025-03-04 11:35:34,811 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) [2025-03-04 11:35:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2025-03-04 11:35:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:35:34,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:34,812 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 11:35:34,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:35,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:35,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 11:35:35,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:35,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1400867617, now seen corresponding path program 1 times [2025-03-04 11:35:35,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:35,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045888777] [2025-03-04 11:35:35,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:35,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:35,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:35:35,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:35:35,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:35,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 11:35:35,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:35,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045888777] [2025-03-04 11:35:35,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045888777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:35,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:35,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:35,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677924714] [2025-03-04 11:35:35,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:35,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:35,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:35,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:35,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:35,138 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-03-04 11:35:35,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:35,167 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-03-04 11:35:35,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:35,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 28 [2025-03-04 11:35:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:35,168 INFO L225 Difference]: With dead ends: 29 [2025-03-04 11:35:35,168 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:35:35,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:35,168 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 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 [2025-03-04 11:35:35,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:35:35,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:35:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2025-03-04 11:35:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:35:35,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-03-04 11:35:35,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:35,169 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:35:35,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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) [2025-03-04 11:35:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:35:35,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:35:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 11:35:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 11:35:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 11:35:35,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __CS_csErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 11:35:35,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 11:35:35,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 11:35:35,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 11:35:35,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 11:35:35,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:35:35,174 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:35,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:35:35,280 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:35:35,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:35:35 BoogieIcfgContainer [2025-03-04 11:35:35,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:35:35,291 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:35:35,291 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:35:35,291 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:35:35,294 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:31" (3/4) ... [2025-03-04 11:35:35,298 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:35:35,302 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_destroy [2025-03-04 11:35:35,302 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2025-03-04 11:35:35,302 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-04 11:35:35,302 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2025-03-04 11:35:35,302 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 11:35:35,302 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2025-03-04 11:35:35,302 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_init [2025-03-04 11:35:35,314 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2025-03-04 11:35:35,314 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 11:35:35,315 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 11:35:35,316 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 11:35:35,316 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:35:35,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:35:35,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:35:35,419 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:35:35,420 INFO L158 Benchmark]: Toolchain (without parser) took 9022.39ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 58.6MB in the end (delta: 45.7MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2025-03-04 11:35:35,420 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:35:35,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.93ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 77.6MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:35:35,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.45ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 72.6MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:35:35,421 INFO L158 Benchmark]: Boogie Preprocessor took 106.29ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 65.3MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:35:35,422 INFO L158 Benchmark]: IcfgBuilder took 4842.88ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 68.1MB in the end (delta: -2.8MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2025-03-04 11:35:35,422 INFO L158 Benchmark]: TraceAbstraction took 3446.98ms. Allocated memory is still 142.6MB. Free memory was 67.4MB in the beginning and 71.4MB in the end (delta: -4.0MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2025-03-04 11:35:35,422 INFO L158 Benchmark]: Witness Printer took 128.16ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 58.6MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:35:35,423 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.43ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.93ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 77.6MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.45ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 72.6MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.29ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 65.3MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 4842.88ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 68.1MB in the end (delta: -2.8MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3446.98ms. Allocated memory is still 142.6MB. Free memory was 67.4MB in the beginning and 71.4MB in the end (delta: -4.0MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * Witness Printer took 128.16ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 58.6MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 787]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 787]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 793]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 793]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 159 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 563 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 267 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=0, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 150 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 348 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1569 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 168/209 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 787]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 793]: Location Invariant Derived location invariant: (((((i == 0) && (j == 0)) || ((i == 0) && (1 <= j))) || (((1 <= i) && (i <= 2)) && (j == 0))) || (((1 <= i) && (i <= 2)) && (1 <= j))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:35:35,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE