./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/systemc/token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:38:21,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:38:21,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:38:22,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:38:22,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:38:22,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:38:22,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:38:22,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:38:22,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:38:22,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:38:22,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:38:22,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:38:22,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:38:22,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:38:22,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:38:22,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:38:22,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:38:22,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:38:22,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:38:22,025 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-jdk21/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 -> 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd [2025-01-10 02:38:22,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:38:22,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:38:22,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:38:22,269 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:38:22,270 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:38:22,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2025-01-10 02:38:23,359 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/854a01f39/89006c64b55c48199a1b04dc708f9622/FLAGe74cbe150 [2025-01-10 02:38:23,668 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:38:23,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2025-01-10 02:38:23,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/854a01f39/89006c64b55c48199a1b04dc708f9622/FLAGe74cbe150 [2025-01-10 02:38:23,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/854a01f39/89006c64b55c48199a1b04dc708f9622 [2025-01-10 02:38:23,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:38:23,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:38:23,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:38:23,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:38:23,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:38:23,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:38:23" (1/1) ... [2025-01-10 02:38:23,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d08bdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:23, skipping insertion in model container [2025-01-10 02:38:23,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:38:23" (1/1) ... [2025-01-10 02:38:23,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:38:24,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:38:24,096 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:38:24,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:38:24,133 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:38:24,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24 WrapperNode [2025-01-10 02:38:24,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:38:24,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:38:24,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:38:24,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:38:24,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24" (1/1) ... [2025-01-10 02:38:24,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24" (1/1) ... [2025-01-10 02:38:24,155 INFO L138 Inliner]: procedures = 32, calls = 38, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 271 [2025-01-10 02:38:24,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:38:24,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:38:24,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:38:24,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:38:24,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24" (1/1) ... [2025-01-10 02:38:24,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24" (1/1) ... [2025-01-10 02:38:24,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24" (1/1) ... [2025-01-10 02:38:24,169 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 02:38:24,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24" (1/1) ... [2025-01-10 02:38:24,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24" (1/1) ... [2025-01-10 02:38:24,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24" (1/1) ... [2025-01-10 02:38:24,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24" (1/1) ... [2025-01-10 02:38:24,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24" (1/1) ... [2025-01-10 02:38:24,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24" (1/1) ... [2025-01-10 02:38:24,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24" (1/1) ... [2025-01-10 02:38:24,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:38:24,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:38:24,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:38:24,178 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:38:24,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24" (1/1) ... [2025-01-10 02:38:24,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:38:24,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:38:24,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 02:38:24,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 02:38:24,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:38:24,222 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-10 02:38:24,222 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-10 02:38:24,222 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-10 02:38:24,223 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-10 02:38:24,223 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-10 02:38:24,223 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-10 02:38:24,223 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-10 02:38:24,223 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-10 02:38:24,223 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-10 02:38:24,223 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-10 02:38:24,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:38:24,223 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-10 02:38:24,223 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-10 02:38:24,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:38:24,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:38:24,282 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:38:24,284 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:38:24,589 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-10 02:38:24,589 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:38:24,605 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:38:24,605 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-10 02:38:24,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:38:24 BoogieIcfgContainer [2025-01-10 02:38:24,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:38:24,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:38:24,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:38:24,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:38:24,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:38:23" (1/3) ... [2025-01-10 02:38:24,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548879ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:38:24, skipping insertion in model container [2025-01-10 02:38:24,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:38:24" (2/3) ... [2025-01-10 02:38:24,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548879ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:38:24, skipping insertion in model container [2025-01-10 02:38:24,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:38:24" (3/3) ... [2025-01-10 02:38:24,615 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2025-01-10 02:38:24,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:38:24,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.02.cil-1.c that has 7 procedures, 140 locations, 1 initial locations, 5 loop locations, and 6 error locations. [2025-01-10 02:38:24,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:38:24,672 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;@4c90563c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:38:24,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 02:38:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 112 states have (on average 1.5357142857142858) internal successors, (172), 118 states have internal predecessors, (172), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 02:38:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 02:38:24,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:24,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:24,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:24,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1179011079, now seen corresponding path program 1 times [2025-01-10 02:38:24,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:24,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666117323] [2025-01-10 02:38:24,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:24,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:24,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 02:38:24,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:38:24,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:24,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:24,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:24,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666117323] [2025-01-10 02:38:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666117323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:24,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:24,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:24,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828591664] [2025-01-10 02:38:24,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:24,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:38:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:24,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:38:24,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:38:24,899 INFO L87 Difference]: Start difference. First operand has 140 states, 112 states have (on average 1.5357142857142858) internal successors, (172), 118 states have internal predecessors, (172), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:24,942 INFO L93 Difference]: Finished difference Result 272 states and 398 transitions. [2025-01-10 02:38:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:38:24,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2025-01-10 02:38:24,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:24,950 INFO L225 Difference]: With dead ends: 272 [2025-01-10 02:38:24,950 INFO L226 Difference]: Without dead ends: 133 [2025-01-10 02:38:24,955 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-01-10 02:38:24,957 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 190 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:24,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 194 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-10 02:38:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-01-10 02:38:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 105 states have (on average 1.5047619047619047) internal successors, (158), 111 states have internal predecessors, (158), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 02:38:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 190 transitions. [2025-01-10 02:38:24,993 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 190 transitions. Word has length 64 [2025-01-10 02:38:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:24,994 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 190 transitions. [2025-01-10 02:38:24,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 190 transitions. [2025-01-10 02:38:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 02:38:24,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:24,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:24,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:38:24,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:24,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash -81906171, now seen corresponding path program 1 times [2025-01-10 02:38:24,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:24,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931381080] [2025-01-10 02:38:24,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:24,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:25,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 02:38:25,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:38:25,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:25,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:25,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:25,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931381080] [2025-01-10 02:38:25,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931381080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:25,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:25,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:38:25,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057767753] [2025-01-10 02:38:25,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:25,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:25,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:25,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:25,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:25,143 INFO L87 Difference]: Start difference. First operand 133 states and 190 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:25,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:25,419 INFO L93 Difference]: Finished difference Result 387 states and 560 transitions. [2025-01-10 02:38:25,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:38:25,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2025-01-10 02:38:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:25,423 INFO L225 Difference]: With dead ends: 387 [2025-01-10 02:38:25,423 INFO L226 Difference]: Without dead ends: 264 [2025-01-10 02:38:25,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:38:25,426 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 307 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:25,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 536 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:38:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-10 02:38:25,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 251. [2025-01-10 02:38:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 205 states have (on average 1.5170731707317073) internal successors, (311), 212 states have internal predecessors, (311), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2025-01-10 02:38:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 366 transitions. [2025-01-10 02:38:25,452 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 366 transitions. Word has length 64 [2025-01-10 02:38:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:25,452 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 366 transitions. [2025-01-10 02:38:25,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 366 transitions. [2025-01-10 02:38:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 02:38:25,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:25,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:25,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:38:25,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:25,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:25,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1675288577, now seen corresponding path program 1 times [2025-01-10 02:38:25,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:25,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014518153] [2025-01-10 02:38:25,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:25,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:25,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 02:38:25,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:38:25,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:25,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:25,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:25,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014518153] [2025-01-10 02:38:25,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014518153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:25,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:25,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:38:25,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753717966] [2025-01-10 02:38:25,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:25,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:38:25,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:25,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:38:25,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:38:25,600 INFO L87 Difference]: Start difference. First operand 251 states and 366 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:25,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:25,951 INFO L93 Difference]: Finished difference Result 640 states and 937 transitions. [2025-01-10 02:38:25,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:38:25,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2025-01-10 02:38:25,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:25,954 INFO L225 Difference]: With dead ends: 640 [2025-01-10 02:38:25,954 INFO L226 Difference]: Without dead ends: 399 [2025-01-10 02:38:25,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:38:25,955 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 297 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:25,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 932 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:38:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-01-10 02:38:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 362. [2025-01-10 02:38:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 298 states have (on average 1.5100671140939597) internal successors, (450), 306 states have internal predecessors, (450), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (42), 39 states have call predecessors, (42), 38 states have call successors, (42) [2025-01-10 02:38:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 530 transitions. [2025-01-10 02:38:26,008 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 530 transitions. Word has length 64 [2025-01-10 02:38:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:26,008 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 530 transitions. [2025-01-10 02:38:26,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 530 transitions. [2025-01-10 02:38:26,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 02:38:26,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:26,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:26,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:38:26,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:26,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash -353297533, now seen corresponding path program 1 times [2025-01-10 02:38:26,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:26,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031724650] [2025-01-10 02:38:26,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:26,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:26,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 02:38:26,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:38:26,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:26,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:26,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:26,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031724650] [2025-01-10 02:38:26,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031724650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:26,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:26,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:38:26,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359105176] [2025-01-10 02:38:26,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:26,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:38:26,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:26,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:38:26,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:38:26,107 INFO L87 Difference]: Start difference. First operand 362 states and 530 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:26,412 INFO L93 Difference]: Finished difference Result 983 states and 1448 transitions. [2025-01-10 02:38:26,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:38:26,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2025-01-10 02:38:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:26,415 INFO L225 Difference]: With dead ends: 983 [2025-01-10 02:38:26,415 INFO L226 Difference]: Without dead ends: 631 [2025-01-10 02:38:26,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:38:26,416 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 304 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:26,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 633 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:38:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-01-10 02:38:26,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 593. [2025-01-10 02:38:26,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 491 states have (on average 1.505091649694501) internal successors, (739), 503 states have internal predecessors, (739), 60 states have call successors, (60), 30 states have call predecessors, (60), 36 states have return successors, (76), 63 states have call predecessors, (76), 60 states have call successors, (76) [2025-01-10 02:38:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 875 transitions. [2025-01-10 02:38:26,450 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 875 transitions. Word has length 64 [2025-01-10 02:38:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:26,450 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 875 transitions. [2025-01-10 02:38:26,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 875 transitions. [2025-01-10 02:38:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 02:38:26,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:26,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:26,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:38:26,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:26,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:26,453 INFO L85 PathProgramCache]: Analyzing trace with hash -834377791, now seen corresponding path program 1 times [2025-01-10 02:38:26,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:26,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050239975] [2025-01-10 02:38:26,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:26,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:26,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 02:38:26,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:38:26,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:26,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:26,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:26,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050239975] [2025-01-10 02:38:26,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050239975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:26,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:26,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:38:26,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107999919] [2025-01-10 02:38:26,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:26,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:38:26,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:26,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:38:26,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:38:26,585 INFO L87 Difference]: Start difference. First operand 593 states and 875 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:27,019 INFO L93 Difference]: Finished difference Result 1728 states and 2568 transitions. [2025-01-10 02:38:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:38:27,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2025-01-10 02:38:27,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:27,029 INFO L225 Difference]: With dead ends: 1728 [2025-01-10 02:38:27,033 INFO L226 Difference]: Without dead ends: 1145 [2025-01-10 02:38:27,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:38:27,036 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 296 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:27,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 873 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:38:27,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-01-10 02:38:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1031. [2025-01-10 02:38:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 851 states have (on average 1.4958871915393654) internal successors, (1273), 877 states have internal predecessors, (1273), 100 states have call successors, (100), 54 states have call predecessors, (100), 74 states have return successors, (164), 107 states have call predecessors, (164), 100 states have call successors, (164) [2025-01-10 02:38:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1537 transitions. [2025-01-10 02:38:27,147 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1537 transitions. Word has length 64 [2025-01-10 02:38:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:27,147 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1537 transitions. [2025-01-10 02:38:27,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1537 transitions. [2025-01-10 02:38:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 02:38:27,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:27,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:27,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:38:27,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:27,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1104784255, now seen corresponding path program 1 times [2025-01-10 02:38:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:27,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333753051] [2025-01-10 02:38:27,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:27,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 02:38:27,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:38:27,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:27,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:27,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:27,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333753051] [2025-01-10 02:38:27,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333753051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:27,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:27,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:38:27,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365488274] [2025-01-10 02:38:27,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:27,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:38:27,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:27,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:38:27,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:38:27,233 INFO L87 Difference]: Start difference. First operand 1031 states and 1537 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:27,614 INFO L93 Difference]: Finished difference Result 3066 states and 4636 transitions. [2025-01-10 02:38:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:38:27,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2025-01-10 02:38:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:27,623 INFO L225 Difference]: With dead ends: 3066 [2025-01-10 02:38:27,624 INFO L226 Difference]: Without dead ends: 2045 [2025-01-10 02:38:27,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:38:27,627 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 293 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:27,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 865 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:38:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2025-01-10 02:38:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1938. [2025-01-10 02:38:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1588 states have (on average 1.4767002518891688) internal successors, (2345), 1660 states have internal predecessors, (2345), 176 states have call successors, (176), 102 states have call predecessors, (176), 168 states have return successors, (432), 191 states have call predecessors, (432), 176 states have call successors, (432) [2025-01-10 02:38:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2953 transitions. [2025-01-10 02:38:27,830 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2953 transitions. Word has length 64 [2025-01-10 02:38:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:27,831 INFO L471 AbstractCegarLoop]: Abstraction has 1938 states and 2953 transitions. [2025-01-10 02:38:27,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2953 transitions. [2025-01-10 02:38:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 02:38:27,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:27,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:27,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:38:27,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:27,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash 751695873, now seen corresponding path program 1 times [2025-01-10 02:38:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:27,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362427900] [2025-01-10 02:38:27,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:27,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 02:38:27,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:38:27,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:27,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:27,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362427900] [2025-01-10 02:38:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362427900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:27,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:27,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:27,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384588570] [2025-01-10 02:38:27,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:27,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:38:27,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:27,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:38:27,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:27,884 INFO L87 Difference]: Start difference. First operand 1938 states and 2953 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:28,112 INFO L93 Difference]: Finished difference Result 4903 states and 7546 transitions. [2025-01-10 02:38:28,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:38:28,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2025-01-10 02:38:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:28,125 INFO L225 Difference]: With dead ends: 4903 [2025-01-10 02:38:28,125 INFO L226 Difference]: Without dead ends: 2976 [2025-01-10 02:38:28,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-01-10 02:38:28,130 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 317 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:28,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 625 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2025-01-10 02:38:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2891. [2025-01-10 02:38:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2891 states, 2371 states have (on average 1.4550822437789963) internal successors, (3450), 2472 states have internal predecessors, (3450), 272 states have call successors, (272), 156 states have call predecessors, (272), 242 states have return successors, (585), 278 states have call predecessors, (585), 272 states have call successors, (585) [2025-01-10 02:38:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 4307 transitions. [2025-01-10 02:38:28,279 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 4307 transitions. Word has length 64 [2025-01-10 02:38:28,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:28,280 INFO L471 AbstractCegarLoop]: Abstraction has 2891 states and 4307 transitions. [2025-01-10 02:38:28,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4307 transitions. [2025-01-10 02:38:28,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 02:38:28,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:28,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:28,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:38:28,282 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:28,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:28,283 INFO L85 PathProgramCache]: Analyzing trace with hash 852199193, now seen corresponding path program 1 times [2025-01-10 02:38:28,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:28,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171236657] [2025-01-10 02:38:28,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:28,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:28,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 02:38:28,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 02:38:28,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:28,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:28,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:28,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171236657] [2025-01-10 02:38:28,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171236657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:28,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:28,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:38:28,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545877336] [2025-01-10 02:38:28,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:28,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:28,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:28,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:28,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:28,367 INFO L87 Difference]: Start difference. First operand 2891 states and 4307 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:28,565 INFO L93 Difference]: Finished difference Result 5798 states and 8747 transitions. [2025-01-10 02:38:28,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:28,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-01-10 02:38:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:28,583 INFO L225 Difference]: With dead ends: 5798 [2025-01-10 02:38:28,584 INFO L226 Difference]: Without dead ends: 2918 [2025-01-10 02:38:28,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:28,592 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:28,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 738 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2025-01-10 02:38:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 2918. [2025-01-10 02:38:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2918 states, 2398 states have (on average 1.4428690575479566) internal successors, (3460), 2499 states have internal predecessors, (3460), 272 states have call successors, (272), 156 states have call predecessors, (272), 242 states have return successors, (585), 278 states have call predecessors, (585), 272 states have call successors, (585) [2025-01-10 02:38:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 4317 transitions. [2025-01-10 02:38:28,755 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 4317 transitions. Word has length 65 [2025-01-10 02:38:28,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:28,755 INFO L471 AbstractCegarLoop]: Abstraction has 2918 states and 4317 transitions. [2025-01-10 02:38:28,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 4317 transitions. [2025-01-10 02:38:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 02:38:28,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:28,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:28,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:38:28,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:28,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:28,758 INFO L85 PathProgramCache]: Analyzing trace with hash -993167973, now seen corresponding path program 1 times [2025-01-10 02:38:28,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:28,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450400179] [2025-01-10 02:38:28,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:28,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:28,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 02:38:28,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 02:38:28,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:28,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:28,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:28,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450400179] [2025-01-10 02:38:28,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450400179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:28,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:28,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:38:28,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687408894] [2025-01-10 02:38:28,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:28,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:28,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:28,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:28,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:28,795 INFO L87 Difference]: Start difference. First operand 2918 states and 4317 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:28,882 INFO L93 Difference]: Finished difference Result 5903 states and 8835 transitions. [2025-01-10 02:38:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:28,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-01-10 02:38:28,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:28,895 INFO L225 Difference]: With dead ends: 5903 [2025-01-10 02:38:28,895 INFO L226 Difference]: Without dead ends: 2996 [2025-01-10 02:38:28,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:28,901 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:28,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 738 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:28,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2025-01-10 02:38:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2996. [2025-01-10 02:38:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2996 states, 2476 states have (on average 1.4289176090468498) internal successors, (3538), 2577 states have internal predecessors, (3538), 272 states have call successors, (272), 156 states have call predecessors, (272), 242 states have return successors, (585), 278 states have call predecessors, (585), 272 states have call successors, (585) [2025-01-10 02:38:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 4395 transitions. [2025-01-10 02:38:29,028 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 4395 transitions. Word has length 65 [2025-01-10 02:38:29,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:29,029 INFO L471 AbstractCegarLoop]: Abstraction has 2996 states and 4395 transitions. [2025-01-10 02:38:29,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 4395 transitions. [2025-01-10 02:38:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 02:38:29,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:29,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:29,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:38:29,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:29,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1065554531, now seen corresponding path program 1 times [2025-01-10 02:38:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:29,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476634605] [2025-01-10 02:38:29,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:29,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:29,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 02:38:29,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 02:38:29,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:29,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:29,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476634605] [2025-01-10 02:38:29,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476634605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:29,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:29,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:38:29,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031433948] [2025-01-10 02:38:29,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:29,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:29,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:29,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:29,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:29,075 INFO L87 Difference]: Start difference. First operand 2996 states and 4395 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:29,460 INFO L93 Difference]: Finished difference Result 9645 states and 14181 transitions. [2025-01-10 02:38:29,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:29,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-01-10 02:38:29,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:29,486 INFO L225 Difference]: With dead ends: 9645 [2025-01-10 02:38:29,486 INFO L226 Difference]: Without dead ends: 6464 [2025-01-10 02:38:29,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:38:29,495 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 649 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:29,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 740 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6464 states. [2025-01-10 02:38:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6464 to 5922. [2025-01-10 02:38:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5922 states, 4904 states have (on average 1.4200652528548123) internal successors, (6964), 5106 states have internal predecessors, (6964), 515 states have call successors, (515), 311 states have call predecessors, (515), 497 states have return successors, (1155), 520 states have call predecessors, (1155), 515 states have call successors, (1155) [2025-01-10 02:38:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5922 states to 5922 states and 8634 transitions. [2025-01-10 02:38:29,909 INFO L78 Accepts]: Start accepts. Automaton has 5922 states and 8634 transitions. Word has length 65 [2025-01-10 02:38:29,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:29,909 INFO L471 AbstractCegarLoop]: Abstraction has 5922 states and 8634 transitions. [2025-01-10 02:38:29,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand 5922 states and 8634 transitions. [2025-01-10 02:38:29,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 02:38:29,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:29,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:29,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:38:29,911 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:29,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:29,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1457941790, now seen corresponding path program 1 times [2025-01-10 02:38:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:29,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387359968] [2025-01-10 02:38:29,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:29,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:29,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 02:38:29,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 02:38:29,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:29,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:29,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387359968] [2025-01-10 02:38:29,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387359968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:29,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:29,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:38:29,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935527375] [2025-01-10 02:38:29,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:29,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:38:29,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:29,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:38:29,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:29,950 INFO L87 Difference]: Start difference. First operand 5922 states and 8634 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:30,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:30,133 INFO L93 Difference]: Finished difference Result 11938 states and 17616 transitions. [2025-01-10 02:38:30,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:30,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-01-10 02:38:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:30,159 INFO L225 Difference]: With dead ends: 11938 [2025-01-10 02:38:30,160 INFO L226 Difference]: Without dead ends: 6027 [2025-01-10 02:38:30,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:30,175 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:30,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 738 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2025-01-10 02:38:30,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 6027. [2025-01-10 02:38:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6027 states, 5009 states have (on average 1.4060690756638052) internal successors, (7043), 5211 states have internal predecessors, (7043), 515 states have call successors, (515), 311 states have call predecessors, (515), 497 states have return successors, (1155), 520 states have call predecessors, (1155), 515 states have call successors, (1155) [2025-01-10 02:38:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6027 states to 6027 states and 8713 transitions. [2025-01-10 02:38:30,456 INFO L78 Accepts]: Start accepts. Automaton has 6027 states and 8713 transitions. Word has length 65 [2025-01-10 02:38:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:30,456 INFO L471 AbstractCegarLoop]: Abstraction has 6027 states and 8713 transitions. [2025-01-10 02:38:30,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 6027 states and 8713 transitions. [2025-01-10 02:38:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 02:38:30,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:30,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:30,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 02:38:30,459 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:30,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:30,460 INFO L85 PathProgramCache]: Analyzing trace with hash -913797472, now seen corresponding path program 1 times [2025-01-10 02:38:30,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:30,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866530279] [2025-01-10 02:38:30,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:30,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:30,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 02:38:30,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 02:38:30,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:30,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:30,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:30,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866530279] [2025-01-10 02:38:30,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866530279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:30,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:30,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:38:30,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631669071] [2025-01-10 02:38:30,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:30,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:38:30,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:30,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:38:30,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:38:30,565 INFO L87 Difference]: Start difference. First operand 6027 states and 8713 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:30,904 INFO L93 Difference]: Finished difference Result 7363 states and 10628 transitions. [2025-01-10 02:38:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:38:30,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-01-10 02:38:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:30,924 INFO L225 Difference]: With dead ends: 7363 [2025-01-10 02:38:30,925 INFO L226 Difference]: Without dead ends: 3914 [2025-01-10 02:38:30,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:38:30,934 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 292 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:30,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 664 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:38:30,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2025-01-10 02:38:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3610. [2025-01-10 02:38:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3610 states, 3020 states have (on average 1.3913907284768212) internal successors, (4202), 3093 states have internal predecessors, (4202), 328 states have call successors, (328), 194 states have call predecessors, (328), 256 states have return successors, (496), 330 states have call predecessors, (496), 328 states have call successors, (496) [2025-01-10 02:38:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 5026 transitions. [2025-01-10 02:38:31,128 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 5026 transitions. Word has length 65 [2025-01-10 02:38:31,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:31,130 INFO L471 AbstractCegarLoop]: Abstraction has 3610 states and 5026 transitions. [2025-01-10 02:38:31,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 5026 transitions. [2025-01-10 02:38:31,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 02:38:31,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:31,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:31,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 02:38:31,132 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:31,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:31,133 INFO L85 PathProgramCache]: Analyzing trace with hash -694942754, now seen corresponding path program 1 times [2025-01-10 02:38:31,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:31,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259618329] [2025-01-10 02:38:31,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:31,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:31,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 02:38:31,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 02:38:31,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:31,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:31,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:31,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:31,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259618329] [2025-01-10 02:38:31,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259618329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:31,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:31,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:38:31,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358907578] [2025-01-10 02:38:31,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:31,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:38:31,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:31,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:38:31,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:38:31,236 INFO L87 Difference]: Start difference. First operand 3610 states and 5026 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:31,881 INFO L93 Difference]: Finished difference Result 10459 states and 14787 transitions. [2025-01-10 02:38:31,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:38:31,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-01-10 02:38:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:31,909 INFO L225 Difference]: With dead ends: 10459 [2025-01-10 02:38:31,910 INFO L226 Difference]: Without dead ends: 6861 [2025-01-10 02:38:31,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:38:31,922 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 304 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:31,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 626 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:38:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6861 states. [2025-01-10 02:38:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6861 to 6229. [2025-01-10 02:38:32,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6229 states, 5201 states have (on average 1.3724283791578542) internal successors, (7138), 5358 states have internal predecessors, (7138), 547 states have call successors, (547), 335 states have call predecessors, (547), 475 states have return successors, (919), 551 states have call predecessors, (919), 547 states have call successors, (919) [2025-01-10 02:38:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6229 states to 6229 states and 8604 transitions. [2025-01-10 02:38:32,284 INFO L78 Accepts]: Start accepts. Automaton has 6229 states and 8604 transitions. Word has length 65 [2025-01-10 02:38:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:32,285 INFO L471 AbstractCegarLoop]: Abstraction has 6229 states and 8604 transitions. [2025-01-10 02:38:32,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 6229 states and 8604 transitions. [2025-01-10 02:38:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 02:38:32,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:32,287 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:32,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 02:38:32,287 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:32,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:32,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1512591204, now seen corresponding path program 1 times [2025-01-10 02:38:32,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:32,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564899303] [2025-01-10 02:38:32,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:32,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:32,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 02:38:32,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 02:38:32,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:32,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:32,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:32,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564899303] [2025-01-10 02:38:32,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564899303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:32,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:32,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:38:32,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031410161] [2025-01-10 02:38:32,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:32,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:38:32,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:32,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:38:32,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:38:32,377 INFO L87 Difference]: Start difference. First operand 6229 states and 8604 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:32,779 INFO L93 Difference]: Finished difference Result 10173 states and 13895 transitions. [2025-01-10 02:38:32,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:38:32,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-01-10 02:38:32,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:32,793 INFO L225 Difference]: With dead ends: 10173 [2025-01-10 02:38:32,793 INFO L226 Difference]: Without dead ends: 5524 [2025-01-10 02:38:32,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:38:32,802 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 270 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:32,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 609 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:38:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2025-01-10 02:38:33,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 5013. [2025-01-10 02:38:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5013 states, 4237 states have (on average 1.3495397687042718) internal successors, (5718), 4330 states have internal predecessors, (5718), 423 states have call successors, (423), 271 states have call predecessors, (423), 347 states have return successors, (595), 419 states have call predecessors, (595), 423 states have call successors, (595) [2025-01-10 02:38:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5013 states to 5013 states and 6736 transitions. [2025-01-10 02:38:33,025 INFO L78 Accepts]: Start accepts. Automaton has 5013 states and 6736 transitions. Word has length 65 [2025-01-10 02:38:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:33,025 INFO L471 AbstractCegarLoop]: Abstraction has 5013 states and 6736 transitions. [2025-01-10 02:38:33,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5013 states and 6736 transitions. [2025-01-10 02:38:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 02:38:33,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:33,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:33,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 02:38:33,028 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:33,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1093432350, now seen corresponding path program 1 times [2025-01-10 02:38:33,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:33,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578881032] [2025-01-10 02:38:33,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:33,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:33,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 02:38:33,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 02:38:33,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:33,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:33,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:33,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578881032] [2025-01-10 02:38:33,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578881032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:33,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:33,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:38:33,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639813681] [2025-01-10 02:38:33,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:33,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:38:33,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:33,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:38:33,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:38:33,104 INFO L87 Difference]: Start difference. First operand 5013 states and 6736 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:33,477 INFO L93 Difference]: Finished difference Result 8431 states and 11351 transitions. [2025-01-10 02:38:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:38:33,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-01-10 02:38:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:33,491 INFO L225 Difference]: With dead ends: 8431 [2025-01-10 02:38:33,491 INFO L226 Difference]: Without dead ends: 5342 [2025-01-10 02:38:33,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:38:33,497 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 274 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:33,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 601 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:38:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5342 states. [2025-01-10 02:38:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5342 to 4983. [2025-01-10 02:38:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4983 states, 4227 states have (on average 1.345871776673764) internal successors, (5689), 4296 states have internal predecessors, (5689), 425 states have call successors, (425), 273 states have call predecessors, (425), 325 states have return successors, (529), 417 states have call predecessors, (529), 425 states have call successors, (529) [2025-01-10 02:38:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 6643 transitions. [2025-01-10 02:38:33,669 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 6643 transitions. Word has length 65 [2025-01-10 02:38:33,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:33,669 INFO L471 AbstractCegarLoop]: Abstraction has 4983 states and 6643 transitions. [2025-01-10 02:38:33,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 6643 transitions. [2025-01-10 02:38:33,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 02:38:33,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:33,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:33,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 02:38:33,671 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:33,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:33,672 INFO L85 PathProgramCache]: Analyzing trace with hash -900712356, now seen corresponding path program 1 times [2025-01-10 02:38:33,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:33,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58289342] [2025-01-10 02:38:33,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:33,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:33,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 02:38:33,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 02:38:33,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:33,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:33,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:33,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58289342] [2025-01-10 02:38:33,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58289342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:33,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:33,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:33,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187556692] [2025-01-10 02:38:33,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:33,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:38:33,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:33,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:38:33,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:33,706 INFO L87 Difference]: Start difference. First operand 4983 states and 6643 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:34,036 INFO L93 Difference]: Finished difference Result 12799 states and 17224 transitions. [2025-01-10 02:38:34,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:34,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-01-10 02:38:34,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:34,055 INFO L225 Difference]: With dead ends: 12799 [2025-01-10 02:38:34,055 INFO L226 Difference]: Without dead ends: 7830 [2025-01-10 02:38:34,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:34,064 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 255 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:34,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 370 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7830 states. [2025-01-10 02:38:34,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7830 to 7800. [2025-01-10 02:38:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7800 states, 6644 states have (on average 1.327212522576761) internal successors, (8818), 6768 states have internal predecessors, (8818), 612 states have call successors, (612), 402 states have call predecessors, (612), 538 states have return successors, (943), 633 states have call predecessors, (943), 612 states have call successors, (943) [2025-01-10 02:38:34,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7800 states to 7800 states and 10373 transitions. [2025-01-10 02:38:34,394 INFO L78 Accepts]: Start accepts. Automaton has 7800 states and 10373 transitions. Word has length 65 [2025-01-10 02:38:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:34,395 INFO L471 AbstractCegarLoop]: Abstraction has 7800 states and 10373 transitions. [2025-01-10 02:38:34,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 7800 states and 10373 transitions. [2025-01-10 02:38:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-10 02:38:34,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:34,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:34,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 02:38:34,396 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:34,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:34,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1172915882, now seen corresponding path program 1 times [2025-01-10 02:38:34,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:34,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174326884] [2025-01-10 02:38:34,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:34,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:34,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 02:38:34,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 02:38:34,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:34,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:34,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:34,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174326884] [2025-01-10 02:38:34,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174326884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:34,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:34,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:34,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350074804] [2025-01-10 02:38:34,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:34,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:38:34,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:34,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:38:34,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:38:34,425 INFO L87 Difference]: Start difference. First operand 7800 states and 10373 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 02:38:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:34,952 INFO L93 Difference]: Finished difference Result 19916 states and 26583 transitions. [2025-01-10 02:38:34,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:38:34,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2025-01-10 02:38:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:34,989 INFO L225 Difference]: With dead ends: 19916 [2025-01-10 02:38:34,989 INFO L226 Difference]: Without dead ends: 12128 [2025-01-10 02:38:35,004 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-01-10 02:38:35,006 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 152 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:35,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 352 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12128 states. [2025-01-10 02:38:35,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12128 to 12048. [2025-01-10 02:38:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12048 states, 10254 states have (on average 1.314023795591964) internal successors, (13474), 10446 states have internal predecessors, (13474), 952 states have call successors, (952), 636 states have call predecessors, (952), 836 states have return successors, (1443), 969 states have call predecessors, (1443), 952 states have call successors, (1443) [2025-01-10 02:38:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12048 states to 12048 states and 15869 transitions. [2025-01-10 02:38:35,460 INFO L78 Accepts]: Start accepts. Automaton has 12048 states and 15869 transitions. Word has length 67 [2025-01-10 02:38:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:35,461 INFO L471 AbstractCegarLoop]: Abstraction has 12048 states and 15869 transitions. [2025-01-10 02:38:35,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-10 02:38:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 12048 states and 15869 transitions. [2025-01-10 02:38:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 02:38:35,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:35,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:35,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 02:38:35,465 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:35,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:35,465 INFO L85 PathProgramCache]: Analyzing trace with hash 276689589, now seen corresponding path program 1 times [2025-01-10 02:38:35,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:35,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560868205] [2025-01-10 02:38:35,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:35,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:35,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 02:38:35,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 02:38:35,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:35,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:38:35,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:35,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560868205] [2025-01-10 02:38:35,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560868205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:35,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:35,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:35,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612604462] [2025-01-10 02:38:35,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:35,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:38:35,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:35,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:38:35,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:35,528 INFO L87 Difference]: Start difference. First operand 12048 states and 15869 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 02:38:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:36,332 INFO L93 Difference]: Finished difference Result 36018 states and 47448 transitions. [2025-01-10 02:38:36,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:36,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 85 [2025-01-10 02:38:36,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:36,399 INFO L225 Difference]: With dead ends: 36018 [2025-01-10 02:38:36,399 INFO L226 Difference]: Without dead ends: 23984 [2025-01-10 02:38:36,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:36,420 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 226 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:36,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 389 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:38:36,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23984 states. [2025-01-10 02:38:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23984 to 23882. [2025-01-10 02:38:37,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23882 states, 20149 states have (on average 1.295697056925902) internal successors, (26107), 20656 states have internal predecessors, (26107), 1861 states have call successors, (1861), 1260 states have call predecessors, (1861), 1866 states have return successors, (3301), 1973 states have call predecessors, (3301), 1861 states have call successors, (3301) [2025-01-10 02:38:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23882 states to 23882 states and 31269 transitions. [2025-01-10 02:38:37,500 INFO L78 Accepts]: Start accepts. Automaton has 23882 states and 31269 transitions. Word has length 85 [2025-01-10 02:38:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:37,500 INFO L471 AbstractCegarLoop]: Abstraction has 23882 states and 31269 transitions. [2025-01-10 02:38:37,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 02:38:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 23882 states and 31269 transitions. [2025-01-10 02:38:37,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-10 02:38:37,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:37,504 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:37,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 02:38:37,505 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:37,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:37,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1800647309, now seen corresponding path program 1 times [2025-01-10 02:38:37,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:37,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289859843] [2025-01-10 02:38:37,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:37,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:37,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-10 02:38:37,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-10 02:38:37,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:37,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 02:38:37,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:37,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289859843] [2025-01-10 02:38:37,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289859843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:37,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:37,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:37,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727641463] [2025-01-10 02:38:37,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:37,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:38:37,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:37,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:38:37,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:38:37,541 INFO L87 Difference]: Start difference. First operand 23882 states and 31269 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:38,744 INFO L93 Difference]: Finished difference Result 41724 states and 54630 transitions. [2025-01-10 02:38:38,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:38:38,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 85 [2025-01-10 02:38:38,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:38,799 INFO L225 Difference]: With dead ends: 41724 [2025-01-10 02:38:38,799 INFO L226 Difference]: Without dead ends: 17856 [2025-01-10 02:38:38,836 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-01-10 02:38:38,836 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:38,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 187 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17856 states. [2025-01-10 02:38:39,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17856 to 17856. [2025-01-10 02:38:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17856 states, 15118 states have (on average 1.2995105172641883) internal successors, (19646), 15464 states have internal predecessors, (19646), 1392 states have call successors, (1392), 940 states have call predecessors, (1392), 1340 states have return successors, (2347), 1455 states have call predecessors, (2347), 1392 states have call successors, (2347) [2025-01-10 02:38:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17856 states to 17856 states and 23385 transitions. [2025-01-10 02:38:39,574 INFO L78 Accepts]: Start accepts. Automaton has 17856 states and 23385 transitions. Word has length 85 [2025-01-10 02:38:39,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:39,574 INFO L471 AbstractCegarLoop]: Abstraction has 17856 states and 23385 transitions. [2025-01-10 02:38:39,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 17856 states and 23385 transitions. [2025-01-10 02:38:39,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-10 02:38:39,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:39,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:39,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 02:38:39,577 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:39,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash -222284040, now seen corresponding path program 1 times [2025-01-10 02:38:39,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:39,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586121059] [2025-01-10 02:38:39,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:39,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:39,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-10 02:38:39,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 02:38:39,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:39,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 02:38:39,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:39,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586121059] [2025-01-10 02:38:39,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586121059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:39,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:39,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:38:39,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332928636] [2025-01-10 02:38:39,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:39,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:38:39,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:39,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:38:39,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:38:39,634 INFO L87 Difference]: Start difference. First operand 17856 states and 23385 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 02:38:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:40,994 INFO L93 Difference]: Finished difference Result 54993 states and 71964 transitions. [2025-01-10 02:38:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:38:40,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 86 [2025-01-10 02:38:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:41,094 INFO L225 Difference]: With dead ends: 54993 [2025-01-10 02:38:41,094 INFO L226 Difference]: Without dead ends: 37151 [2025-01-10 02:38:41,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:38:41,128 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 237 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:41,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 422 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:38:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37151 states. [2025-01-10 02:38:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37151 to 36885. [2025-01-10 02:38:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36885 states, 31202 states have (on average 1.28116787385424) internal successors, (39975), 32121 states have internal predecessors, (39975), 2701 states have call successors, (2701), 1852 states have call predecessors, (2701), 2976 states have return successors, (5258), 2919 states have call predecessors, (5258), 2701 states have call successors, (5258) [2025-01-10 02:38:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 47934 transitions. [2025-01-10 02:38:42,819 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 47934 transitions. Word has length 86 [2025-01-10 02:38:42,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:42,821 INFO L471 AbstractCegarLoop]: Abstraction has 36885 states and 47934 transitions. [2025-01-10 02:38:42,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 02:38:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 47934 transitions. [2025-01-10 02:38:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-10 02:38:42,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:42,833 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:42,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 02:38:42,833 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:42,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:42,833 INFO L85 PathProgramCache]: Analyzing trace with hash 616749622, now seen corresponding path program 1 times [2025-01-10 02:38:42,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:42,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503403164] [2025-01-10 02:38:42,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:42,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:42,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-10 02:38:42,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 02:38:42,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:42,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 02:38:42,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:42,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503403164] [2025-01-10 02:38:42,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503403164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:42,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:42,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:42,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952134840] [2025-01-10 02:38:42,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:42,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:38:42,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:42,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:38:42,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:38:42,881 INFO L87 Difference]: Start difference. First operand 36885 states and 47934 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:44,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:44,927 INFO L93 Difference]: Finished difference Result 67644 states and 87936 transitions. [2025-01-10 02:38:44,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:38:44,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 86 [2025-01-10 02:38:44,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:45,146 INFO L225 Difference]: With dead ends: 67644 [2025-01-10 02:38:45,150 INFO L226 Difference]: Without dead ends: 30773 [2025-01-10 02:38:45,281 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-01-10 02:38:45,281 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:45,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 186 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:45,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30773 states. [2025-01-10 02:38:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30773 to 30773. [2025-01-10 02:38:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30773 states, 26065 states have (on average 1.283061576827163) internal successors, (33443), 26858 states have internal predecessors, (33443), 2201 states have call successors, (2201), 1508 states have call predecessors, (2201), 2501 states have return successors, (4381), 2410 states have call predecessors, (4381), 2201 states have call successors, (4381) [2025-01-10 02:38:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30773 states to 30773 states and 40025 transitions. [2025-01-10 02:38:46,698 INFO L78 Accepts]: Start accepts. Automaton has 30773 states and 40025 transitions. Word has length 86 [2025-01-10 02:38:46,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:46,698 INFO L471 AbstractCegarLoop]: Abstraction has 30773 states and 40025 transitions. [2025-01-10 02:38:46,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:38:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 30773 states and 40025 transitions. [2025-01-10 02:38:46,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 02:38:46,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:46,701 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:46,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 02:38:46,701 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:46,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:46,702 INFO L85 PathProgramCache]: Analyzing trace with hash 744384691, now seen corresponding path program 1 times [2025-01-10 02:38:46,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:46,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389974717] [2025-01-10 02:38:46,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:46,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:46,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 02:38:46,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 02:38:46,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:46,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:38:46,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:46,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389974717] [2025-01-10 02:38:46,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389974717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:46,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:46,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:38:46,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068549475] [2025-01-10 02:38:46,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:46,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:38:46,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:46,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:38:46,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:38:46,753 INFO L87 Difference]: Start difference. First operand 30773 states and 40025 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 02:38:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:48,178 INFO L93 Difference]: Finished difference Result 56056 states and 73146 transitions. [2025-01-10 02:38:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 02:38:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 87 [2025-01-10 02:38:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:48,276 INFO L225 Difference]: With dead ends: 56056 [2025-01-10 02:38:48,277 INFO L226 Difference]: Without dead ends: 31556 [2025-01-10 02:38:48,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:38:48,318 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 646 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:48,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1065 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:38:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31556 states. [2025-01-10 02:38:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31556 to 30773. [2025-01-10 02:38:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30773 states, 26065 states have (on average 1.2782275081526953) internal successors, (33317), 26858 states have internal predecessors, (33317), 2201 states have call successors, (2201), 1508 states have call predecessors, (2201), 2501 states have return successors, (4287), 2410 states have call predecessors, (4287), 2201 states have call successors, (4287) [2025-01-10 02:38:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30773 states to 30773 states and 39805 transitions. [2025-01-10 02:38:49,653 INFO L78 Accepts]: Start accepts. Automaton has 30773 states and 39805 transitions. Word has length 87 [2025-01-10 02:38:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:49,653 INFO L471 AbstractCegarLoop]: Abstraction has 30773 states and 39805 transitions. [2025-01-10 02:38:49,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 02:38:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 30773 states and 39805 transitions. [2025-01-10 02:38:49,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 02:38:49,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:49,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:49,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 02:38:49,655 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:49,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash 457953596, now seen corresponding path program 1 times [2025-01-10 02:38:49,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:49,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444700455] [2025-01-10 02:38:49,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:49,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:49,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 02:38:49,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 02:38:49,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:49,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 02:38:49,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:49,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444700455] [2025-01-10 02:38:49,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444700455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:49,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:49,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:38:49,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123234685] [2025-01-10 02:38:49,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:49,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:38:49,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:49,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:38:49,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:38:49,702 INFO L87 Difference]: Start difference. First operand 30773 states and 39805 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 02:38:51,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:51,810 INFO L93 Difference]: Finished difference Result 51832 states and 67223 transitions. [2025-01-10 02:38:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 02:38:51,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 90 [2025-01-10 02:38:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:51,915 INFO L225 Difference]: With dead ends: 51832 [2025-01-10 02:38:51,915 INFO L226 Difference]: Without dead ends: 31366 [2025-01-10 02:38:51,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:38:51,954 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 642 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:51,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1072 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:38:51,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31366 states. [2025-01-10 02:38:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31366 to 30690. [2025-01-10 02:38:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30690 states, 25990 states have (on average 1.2746825702193152) internal successors, (33129), 26783 states have internal predecessors, (33129), 2197 states have call successors, (2197), 1504 states have call predecessors, (2197), 2497 states have return successors, (4250), 2406 states have call predecessors, (4250), 2197 states have call successors, (4250) [2025-01-10 02:38:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30690 states to 30690 states and 39576 transitions. [2025-01-10 02:38:53,266 INFO L78 Accepts]: Start accepts. Automaton has 30690 states and 39576 transitions. Word has length 90 [2025-01-10 02:38:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:53,267 INFO L471 AbstractCegarLoop]: Abstraction has 30690 states and 39576 transitions. [2025-01-10 02:38:53,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 02:38:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand 30690 states and 39576 transitions. [2025-01-10 02:38:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 02:38:53,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:53,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:53,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 02:38:53,273 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:53,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:53,274 INFO L85 PathProgramCache]: Analyzing trace with hash -289536987, now seen corresponding path program 1 times [2025-01-10 02:38:53,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:53,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323978261] [2025-01-10 02:38:53,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:53,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:53,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 02:38:53,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 02:38:53,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:53,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-10 02:38:53,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:53,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323978261] [2025-01-10 02:38:53,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323978261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:53,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:53,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:38:53,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571778919] [2025-01-10 02:38:53,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:53,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:38:53,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:53,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:38:53,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:38:53,322 INFO L87 Difference]: Start difference. First operand 30690 states and 39576 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-10 02:38:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:54,601 INFO L93 Difference]: Finished difference Result 56568 states and 73388 transitions. [2025-01-10 02:38:54,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:38:54,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 98 [2025-01-10 02:38:54,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:54,709 INFO L225 Difference]: With dead ends: 56568 [2025-01-10 02:38:54,709 INFO L226 Difference]: Without dead ends: 34665 [2025-01-10 02:38:54,754 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-01-10 02:38:54,755 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 140 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:54,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 383 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:38:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34665 states. [2025-01-10 02:38:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34665 to 28913. [2025-01-10 02:38:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28913 states, 24443 states have (on average 1.2654747780550668) internal successors, (30932), 25142 states have internal predecessors, (30932), 2145 states have call successors, (2145), 1464 states have call predecessors, (2145), 2319 states have return successors, (3930), 2310 states have call predecessors, (3930), 2145 states have call successors, (3930) [2025-01-10 02:38:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28913 states to 28913 states and 37007 transitions. [2025-01-10 02:38:56,258 INFO L78 Accepts]: Start accepts. Automaton has 28913 states and 37007 transitions. Word has length 98 [2025-01-10 02:38:56,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:56,258 INFO L471 AbstractCegarLoop]: Abstraction has 28913 states and 37007 transitions. [2025-01-10 02:38:56,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-10 02:38:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 28913 states and 37007 transitions. [2025-01-10 02:38:56,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-10 02:38:56,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:56,262 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:38:56,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 02:38:56,262 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:38:56,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:56,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1304032594, now seen corresponding path program 1 times [2025-01-10 02:38:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:56,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320902676] [2025-01-10 02:38:56,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:56,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:56,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-10 02:38:56,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 02:38:56,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:56,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 02:38:56,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:56,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320902676] [2025-01-10 02:38:56,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320902676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:38:56,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:38:56,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 02:38:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587769799] [2025-01-10 02:38:56,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:38:56,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:38:56,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:56,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:38:56,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:38:56,323 INFO L87 Difference]: Start difference. First operand 28913 states and 37007 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-10 02:38:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:57,937 INFO L93 Difference]: Finished difference Result 47826 states and 61809 transitions. [2025-01-10 02:38:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:38:57,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 109 [2025-01-10 02:38:57,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:58,031 INFO L225 Difference]: With dead ends: 47826 [2025-01-10 02:38:58,031 INFO L226 Difference]: Without dead ends: 29330 [2025-01-10 02:38:58,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:38:58,060 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 1184 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:58,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 1175 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:38:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29330 states. [2025-01-10 02:39:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29330 to 28913. [2025-01-10 02:39:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28913 states, 24443 states have (on average 1.2590925827435258) internal successors, (30776), 25142 states have internal predecessors, (30776), 2145 states have call successors, (2145), 1464 states have call predecessors, (2145), 2319 states have return successors, (3696), 2310 states have call predecessors, (3696), 2145 states have call successors, (3696) [2025-01-10 02:39:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28913 states to 28913 states and 36617 transitions. [2025-01-10 02:39:00,248 INFO L78 Accepts]: Start accepts. Automaton has 28913 states and 36617 transitions. Word has length 109 [2025-01-10 02:39:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:00,249 INFO L471 AbstractCegarLoop]: Abstraction has 28913 states and 36617 transitions. [2025-01-10 02:39:00,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-10 02:39:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 28913 states and 36617 transitions. [2025-01-10 02:39:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-10 02:39:00,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:00,253 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:00,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 02:39:00,253 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:00,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:00,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1494566834, now seen corresponding path program 1 times [2025-01-10 02:39:00,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:00,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727434555] [2025-01-10 02:39:00,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:00,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:00,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-10 02:39:00,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-10 02:39:00,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:00,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-10 02:39:00,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:00,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727434555] [2025-01-10 02:39:00,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727434555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:00,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:00,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:39:00,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457644386] [2025-01-10 02:39:00,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:00,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:39:00,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:00,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:39:00,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:39:00,308 INFO L87 Difference]: Start difference. First operand 28913 states and 36617 transitions. Second operand has 3 states, 2 states have (on average 38.0) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-10 02:39:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:01,456 INFO L93 Difference]: Finished difference Result 28913 states and 36617 transitions. [2025-01-10 02:39:01,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:39:01,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 38.0) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2025-01-10 02:39:01,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:01,541 INFO L225 Difference]: With dead ends: 28913 [2025-01-10 02:39:01,541 INFO L226 Difference]: Without dead ends: 28911 [2025-01-10 02:39:01,551 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-01-10 02:39:01,552 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 173 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:01,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28911 states. [2025-01-10 02:39:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28911 to 28911. [2025-01-10 02:39:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28911 states, 24443 states have (on average 1.2549196088859795) internal successors, (30674), 25140 states have internal predecessors, (30674), 2145 states have call successors, (2145), 1464 states have call predecessors, (2145), 2319 states have return successors, (3696), 2310 states have call predecessors, (3696), 2145 states have call successors, (3696) [2025-01-10 02:39:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28911 states to 28911 states and 36515 transitions. [2025-01-10 02:39:02,867 INFO L78 Accepts]: Start accepts. Automaton has 28911 states and 36515 transitions. Word has length 115 [2025-01-10 02:39:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:02,868 INFO L471 AbstractCegarLoop]: Abstraction has 28911 states and 36515 transitions. [2025-01-10 02:39:02,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 38.0) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-10 02:39:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 28911 states and 36515 transitions. [2025-01-10 02:39:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-10 02:39:02,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:02,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:02,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 02:39:02,872 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:02,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:02,873 INFO L85 PathProgramCache]: Analyzing trace with hash 913068722, now seen corresponding path program 1 times [2025-01-10 02:39:02,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:02,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666426913] [2025-01-10 02:39:02,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:02,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:02,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-10 02:39:02,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-10 02:39:02,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:02,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 02:39:02,886 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 02:39:02,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-10 02:39:02,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-10 02:39:02,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:02,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 02:39:02,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 02:39:02,926 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 02:39:02,927 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-01-10 02:39:02,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 02:39:02,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 02:39:02,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 02:39:02,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 02:39:02,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-01-10 02:39:02,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 02:39:02,932 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:03,020 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:39:03,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:39:03 BoogieIcfgContainer [2025-01-10 02:39:03,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:39:03,027 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:39:03,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:39:03,027 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:39:03,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:38:24" (3/4) ... [2025-01-10 02:39:03,028 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-10 02:39:03,114 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 84. [2025-01-10 02:39:03,185 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:39:03,185 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:39:03,185 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:39:03,186 INFO L158 Benchmark]: Toolchain (without parser) took 39235.17ms. Allocated memory was 167.8MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 132.6MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2025-01-10 02:39:03,186 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:39:03,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.83ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 118.7MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 02:39:03,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.73ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 117.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:39:03,186 INFO L158 Benchmark]: Boogie Preprocessor took 22.31ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 115.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:39:03,187 INFO L158 Benchmark]: RCFGBuilder took 427.59ms. Allocated memory is still 167.8MB. Free memory was 115.2MB in the beginning and 92.6MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 02:39:03,187 INFO L158 Benchmark]: TraceAbstraction took 38419.17ms. Allocated memory was 167.8MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 92.1MB in the beginning and 3.6GB in the end (delta: -3.6GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2025-01-10 02:39:03,187 INFO L158 Benchmark]: Witness Printer took 158.59ms. Allocated memory is still 6.9GB. Free memory was 3.6GB in the beginning and 3.6GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 02:39:03,187 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.18ms. Allocated memory is still 226.5MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.83ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 118.7MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.73ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 117.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.31ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 115.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 427.59ms. Allocated memory is still 167.8MB. Free memory was 115.2MB in the beginning and 92.6MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 38419.17ms. Allocated memory was 167.8MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 92.1MB in the beginning and 3.6GB in the end (delta: -3.6GB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. * Witness Printer took 158.59ms. Allocated memory is still 6.9GB. Free memory was 3.6GB in the beginning and 3.6GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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 - CounterExampleResult [Line: 113]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L598] int __retres1 ; [L602] CALL init_model() [L512] m_i = 1 [L513] t1_i = 1 [L514] t2_i = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L602] RET init_model() [L603] CALL start_simulation() [L539] int kernel_st ; [L540] int tmp ; [L541] int tmp___0 ; [L545] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L546] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L547] CALL init_threads() [L231] COND TRUE m_i == 1 [L232] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L236] COND TRUE t1_i == 1 [L237] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L241] COND TRUE t2_i == 1 [L242] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L547] RET init_threads() [L548] CALL fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L344] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L349] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L354] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L359] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L364] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L369] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L548] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] CALL activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L417] int tmp ; [L418] int tmp___0 ; [L419] int tmp___1 ; [L423] CALL, EXPR is_master_triggered() [L163] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L166] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L176] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L423] RET, EXPR is_master_triggered() [L423] tmp = is_master_triggered() [L425] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L431] CALL, EXPR is_transmit1_triggered() [L182] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L185] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L195] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L431] RET, EXPR is_transmit1_triggered() [L431] tmp___0 = is_transmit1_triggered() [L433] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L439] CALL, EXPR is_transmit2_triggered() [L201] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L204] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L214] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L439] RET, EXPR is_transmit2_triggered() [L439] tmp___1 = is_transmit2_triggered() [L441] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L549] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] CALL reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L382] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L387] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L392] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L397] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L402] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L407] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L550] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L556] kernel_st = 1 [L557] CALL eval() [L277] int tmp ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L254] COND TRUE m_st == 0 [L255] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L272] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] tmp = exists_runnable_thread() [L286] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L291] COND TRUE m_st == 0 [L292] int tmp_ndt_1; [L293] tmp_ndt_1 = __VERIFIER_nondet_int() [L294] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L305] COND TRUE t1_st == 0 [L306] int tmp_ndt_2; [L307] tmp_ndt_2 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp_ndt_2) [L310] t1_st = 1 [L311] CALL transmit1() [L94] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=0] [L107] t1_pc = 1 [L108] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L311] RET transmit1() [L319] COND TRUE t2_st == 0 [L320] int tmp_ndt_3; [L321] tmp_ndt_3 = __VERIFIER_nondet_int() [L322] COND FALSE !(\read(tmp_ndt_3)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L254] COND TRUE m_st == 0 [L255] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L272] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L284] tmp = exists_runnable_thread() [L286] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L291] COND TRUE m_st == 0 [L292] int tmp_ndt_1; [L293] tmp_ndt_1 = __VERIFIER_nondet_int() [L294] COND TRUE \read(tmp_ndt_1) [L296] m_st = 1 [L297] CALL master() [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] CALL immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L455] CALL activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L417] int tmp ; [L418] int tmp___0 ; [L419] int tmp___1 ; [L423] CALL, EXPR is_master_triggered() [L163] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L166] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L176] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L178] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L423] RET, EXPR is_master_triggered() [L423] tmp = is_master_triggered() [L425] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L431] CALL, EXPR is_transmit1_triggered() [L182] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L185] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L186] COND TRUE E_1 == 1 [L187] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L197] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L431] RET, EXPR is_transmit1_triggered() [L431] tmp___0 = is_transmit1_triggered() [L433] COND TRUE \read(tmp___0) [L434] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L439] CALL, EXPR is_transmit2_triggered() [L201] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L204] COND FALSE !(t2_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L214] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L216] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, \result=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L439] RET, EXPR is_transmit2_triggered() [L439] tmp___1 = is_transmit2_triggered() [L441] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L455] RET activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L297] RET master() [L305] COND TRUE t1_st == 0 [L306] int tmp_ndt_2; [L307] tmp_ndt_2 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp_ndt_2) [L310] t1_st = 1 [L311] CALL transmit1() [L94] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L97] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L113] token += 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 149]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 149]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 38.3s, OverallIterations: 27, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7958 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7810 mSDsluCounter, 15891 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10637 mSDsCounter, 934 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5687 IncrementalHoareTripleChecker+Invalid, 6621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 934 mSolverCounterUnsat, 5254 mSDtfsCounter, 5687 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36885occurred in iteration=20, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 10848 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2057 NumberOfCodeBlocks, 2057 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1915 ConstructedInterpolants, 0 QuantifiedInterpolants, 3363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 173/173 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 RESULT: Ultimate proved your program to be incorrect! [2025-01-10 02:39:03,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)