./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:34:45,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:34:45,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:34:45,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:34:45,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:34:45,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:34:45,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:34:45,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:34:45,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:34:45,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:34:45,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:34:45,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:34:45,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:34:45,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:34:45,093 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:34:45,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:34:45,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:34:45,094 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:34:45,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:34:45,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:34:45,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:34:45,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:34:45,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:34:45,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:34:45,094 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:34:45,094 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:34:45,094 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:34:45,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:34:45,094 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:34:45,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:34:45,094 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:34:45,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:34:45,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:34:45,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:34:45,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:34:45,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:34:45,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:34:45,095 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:34:45,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:34:45,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:34:45,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:34:45,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:34:45,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:34:45,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:34:45,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:34:45,095 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd [2025-03-04 11:34:45,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:34:45,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:34:45,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:34:45,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:34:45,314 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:34:45,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2025-03-04 11:34:46,422 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8595c5cc/7bacb9a9f1eb413b9549a341b700b9c6/FLAGcaaa054cb [2025-03-04 11:34:46,615 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:34:46,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2025-03-04 11:34:46,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8595c5cc/7bacb9a9f1eb413b9549a341b700b9c6/FLAGcaaa054cb [2025-03-04 11:34:46,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8595c5cc/7bacb9a9f1eb413b9549a341b700b9c6 [2025-03-04 11:34:46,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:34:46,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:34:46,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:34:46,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:34:46,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:34:46,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:34:46" (1/1) ... [2025-03-04 11:34:46,648 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 04.03 11:34:46, skipping insertion in model container [2025-03-04 11:34:46,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:34:46" (1/1) ... [2025-03-04 11:34:46,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:34:46,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:34:46,816 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:34:46,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:34:46,865 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:34:46,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:46 WrapperNode [2025-03-04 11:34:46,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:34:46,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:34:46,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:34:46,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:34:46,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:46" (1/1) ... [2025-03-04 11:34:46,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:46" (1/1) ... [2025-03-04 11:34:46,897 INFO L138 Inliner]: procedures = 32, calls = 38, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 271 [2025-03-04 11:34:46,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:34:46,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:34:46,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:34:46,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:34:46,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:46" (1/1) ... [2025-03-04 11:34:46,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:46" (1/1) ... [2025-03-04 11:34:46,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:46" (1/1) ... [2025-03-04 11:34:46,923 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-03-04 11:34:46,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:46" (1/1) ... [2025-03-04 11:34:46,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:46" (1/1) ... [2025-03-04 11:34:46,926 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:46" (1/1) ... [2025-03-04 11:34:46,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:46" (1/1) ... [2025-03-04 11:34:46,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:46" (1/1) ... [2025-03-04 11:34:46,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:46" (1/1) ... [2025-03-04 11:34:46,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:34:46,932 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:34:46,932 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:34:46,932 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:34:46,933 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:46" (1/1) ... [2025-03-04 11:34:46,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:34:46,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:34:46,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:34:46,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:34:46,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:34:46,975 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-04 11:34:46,975 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-04 11:34:46,975 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-04 11:34:46,975 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-04 11:34:46,975 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-04 11:34:46,975 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-04 11:34:46,976 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-04 11:34:46,976 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-04 11:34:46,976 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-04 11:34:46,976 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-04 11:34:46,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:34:46,976 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-04 11:34:46,976 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-04 11:34:46,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:34:46,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:34:47,026 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:34:47,027 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:34:47,368 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-04 11:34:47,368 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:34:47,380 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:34:47,380 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:34:47,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:34:47 BoogieIcfgContainer [2025-03-04 11:34:47,380 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:34:47,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:34:47,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:34:47,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:34:47,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:34:46" (1/3) ... [2025-03-04 11:34:47,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd5b639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:34:47, skipping insertion in model container [2025-03-04 11:34:47,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:34:46" (2/3) ... [2025-03-04 11:34:47,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd5b639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:34:47, skipping insertion in model container [2025-03-04 11:34:47,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:34:47" (3/3) ... [2025-03-04 11:34:47,387 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2025-03-04 11:34:47,400 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:34:47,401 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.02.cil-1.c that has 7 procedures, 148 locations, 1 initial locations, 5 loop locations, and 6 error locations. [2025-03-04 11:34:47,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:34:47,457 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;@1e005fcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:34:47,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:34:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 119 states have (on average 1.5126050420168067) internal successors, (180), 126 states have internal predecessors, (180), 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-03-04 11:34:47,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:34:47,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:47,466 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] [2025-03-04 11:34:47,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:47,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:47,470 INFO L85 PathProgramCache]: Analyzing trace with hash -88829312, now seen corresponding path program 1 times [2025-03-04 11:34:47,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:47,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389069287] [2025-03-04 11:34:47,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:47,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:47,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:34:47,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:34:47,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:47,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:47,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389069287] [2025-03-04 11:34:47,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389069287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:47,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:47,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:47,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051941992] [2025-03-04 11:34:47,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:47,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:47,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:47,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:47,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:47,836 INFO L87 Difference]: Start difference. First operand has 148 states, 119 states have (on average 1.5126050420168067) internal successors, (180), 126 states have internal predecessors, (180), 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 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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-03-04 11:34:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:48,300 INFO L93 Difference]: Finished difference Result 436 states and 639 transitions. [2025-03-04 11:34:48,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:34:48,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-04 11:34:48,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:48,314 INFO L225 Difference]: With dead ends: 436 [2025-03-04 11:34:48,314 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 11:34:48,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:34:48,320 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 311 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:48,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1097 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:34:48,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 11:34:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 270. [2025-03-04 11:34:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 221 states have (on average 1.48868778280543) internal successors, (329), 229 states have internal predecessors, (329), 29 states have call successors, (29), 12 states have call predecessors, (29), 14 states have return successors, (36), 30 states have call predecessors, (36), 29 states have call successors, (36) [2025-03-04 11:34:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 394 transitions. [2025-03-04 11:34:48,374 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 394 transitions. Word has length 66 [2025-03-04 11:34:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:48,374 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 394 transitions. [2025-03-04 11:34:48,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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-03-04 11:34:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 394 transitions. [2025-03-04 11:34:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:34:48,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:48,377 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] [2025-03-04 11:34:48,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:34:48,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:48,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:48,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2014362623, now seen corresponding path program 1 times [2025-03-04 11:34:48,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:48,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528993355] [2025-03-04 11:34:48,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:48,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:48,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:34:48,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:34:48,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:48,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:48,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:48,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528993355] [2025-03-04 11:34:48,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528993355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:48,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:48,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:48,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269144330] [2025-03-04 11:34:48,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:48,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:48,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:48,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:48,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:48,505 INFO L87 Difference]: Start difference. First operand 270 states and 394 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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-03-04 11:34:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:48,852 INFO L93 Difference]: Finished difference Result 797 states and 1172 transitions. [2025-03-04 11:34:48,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:34:48,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-04 11:34:48,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:48,856 INFO L225 Difference]: With dead ends: 797 [2025-03-04 11:34:48,856 INFO L226 Difference]: Without dead ends: 539 [2025-03-04 11:34:48,857 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-03-04 11:34:48,857 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 302 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:48,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 963 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:34:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-04 11:34:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 518. [2025-03-04 11:34:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 431 states have (on average 1.4849187935034802) internal successors, (640), 443 states have internal predecessors, (640), 51 states have call successors, (51), 24 states have call predecessors, (51), 30 states have return successors, (74), 54 states have call predecessors, (74), 51 states have call successors, (74) [2025-03-04 11:34:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 765 transitions. [2025-03-04 11:34:48,905 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 765 transitions. Word has length 66 [2025-03-04 11:34:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:48,905 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 765 transitions. [2025-03-04 11:34:48,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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-03-04 11:34:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 765 transitions. [2025-03-04 11:34:48,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:34:48,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:48,907 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] [2025-03-04 11:34:48,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:34:48,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:48,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1245192608, now seen corresponding path program 1 times [2025-03-04 11:34:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:48,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115913383] [2025-03-04 11:34:48,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:48,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:48,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:34:48,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:34:48,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:48,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:49,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:49,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115913383] [2025-03-04 11:34:49,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115913383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:49,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:49,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:49,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569166305] [2025-03-04 11:34:49,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:49,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:49,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:49,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:49,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:49,013 INFO L87 Difference]: Start difference. First operand 518 states and 765 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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-03-04 11:34:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:49,349 INFO L93 Difference]: Finished difference Result 1642 states and 2450 transitions. [2025-03-04 11:34:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:34:49,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-04 11:34:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:49,357 INFO L225 Difference]: With dead ends: 1642 [2025-03-04 11:34:49,357 INFO L226 Difference]: Without dead ends: 1136 [2025-03-04 11:34:49,359 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-03-04 11:34:49,361 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 372 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:49,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 934 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:34:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-03-04 11:34:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1018. [2025-03-04 11:34:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 853 states have (on average 1.4794841735052755) internal successors, (1262), 879 states have internal predecessors, (1262), 91 states have call successors, (91), 48 states have call predecessors, (91), 68 states have return successors, (170), 98 states have call predecessors, (170), 91 states have call successors, (170) [2025-03-04 11:34:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1523 transitions. [2025-03-04 11:34:49,430 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1523 transitions. Word has length 66 [2025-03-04 11:34:49,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:49,430 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1523 transitions. [2025-03-04 11:34:49,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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-03-04 11:34:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1523 transitions. [2025-03-04 11:34:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:34:49,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:49,434 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] [2025-03-04 11:34:49,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:34:49,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:49,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:49,436 INFO L85 PathProgramCache]: Analyzing trace with hash -112002015, now seen corresponding path program 1 times [2025-03-04 11:34:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:49,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693636581] [2025-03-04 11:34:49,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:49,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:49,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:34:49,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:34:49,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:49,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:49,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:49,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693636581] [2025-03-04 11:34:49,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693636581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:49,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:49,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:49,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752789115] [2025-03-04 11:34:49,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:49,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:49,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:49,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:49,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:49,517 INFO L87 Difference]: Start difference. First operand 1018 states and 1523 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-03-04 11:34:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:49,684 INFO L93 Difference]: Finished difference Result 2107 states and 3209 transitions. [2025-03-04 11:34:49,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:34:49,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-04 11:34:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:49,693 INFO L225 Difference]: With dead ends: 2107 [2025-03-04 11:34:49,693 INFO L226 Difference]: Without dead ends: 1099 [2025-03-04 11:34:49,696 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-03-04 11:34:49,696 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 233 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:49,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 360 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-03-04 11:34:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1018. [2025-03-04 11:34:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 853 states have (on average 1.4689331770222742) internal successors, (1253), 879 states have internal predecessors, (1253), 91 states have call successors, (91), 48 states have call predecessors, (91), 68 states have return successors, (170), 98 states have call predecessors, (170), 91 states have call successors, (170) [2025-03-04 11:34:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1514 transitions. [2025-03-04 11:34:49,781 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1514 transitions. Word has length 66 [2025-03-04 11:34:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:49,781 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1514 transitions. [2025-03-04 11:34:49,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-03-04 11:34:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1514 transitions. [2025-03-04 11:34:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:34:49,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:49,782 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] [2025-03-04 11:34:49,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:34:49,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:49,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:49,783 INFO L85 PathProgramCache]: Analyzing trace with hash -352542144, now seen corresponding path program 1 times [2025-03-04 11:34:49,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:49,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441090443] [2025-03-04 11:34:49,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:49,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:34:49,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:34:49,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:49,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:49,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:49,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441090443] [2025-03-04 11:34:49,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441090443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:49,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:49,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:49,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476802955] [2025-03-04 11:34:49,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:49,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:49,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:49,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:49,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:49,869 INFO L87 Difference]: Start difference. First operand 1018 states and 1514 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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-03-04 11:34:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:50,230 INFO L93 Difference]: Finished difference Result 3122 states and 4716 transitions. [2025-03-04 11:34:50,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:34:50,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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 66 [2025-03-04 11:34:50,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:50,239 INFO L225 Difference]: With dead ends: 3122 [2025-03-04 11:34:50,240 INFO L226 Difference]: Without dead ends: 2116 [2025-03-04 11:34:50,242 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-03-04 11:34:50,243 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 299 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:50,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 898 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:34:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2025-03-04 11:34:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 2020. [2025-03-04 11:34:50,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 1685 states have (on average 1.4522255192878337) internal successors, (2447), 1757 states have internal predecessors, (2447), 167 states have call successors, (167), 96 states have call predecessors, (167), 162 states have return successors, (454), 182 states have call predecessors, (454), 167 states have call successors, (454) [2025-03-04 11:34:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 3068 transitions. [2025-03-04 11:34:50,379 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 3068 transitions. Word has length 66 [2025-03-04 11:34:50,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:50,380 INFO L471 AbstractCegarLoop]: Abstraction has 2020 states and 3068 transitions. [2025-03-04 11:34:50,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 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-03-04 11:34:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 3068 transitions. [2025-03-04 11:34:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:34:50,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:50,384 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] [2025-03-04 11:34:50,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:34:50,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:50,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:50,385 INFO L85 PathProgramCache]: Analyzing trace with hash -360301503, now seen corresponding path program 1 times [2025-03-04 11:34:50,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:50,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121674527] [2025-03-04 11:34:50,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:50,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:50,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:34:50,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:34:50,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:50,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:50,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:50,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121674527] [2025-03-04 11:34:50,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121674527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:50,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:50,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:34:50,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432816484] [2025-03-04 11:34:50,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:50,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:34:50,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:50,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:34:50,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:34:50,446 INFO L87 Difference]: Start difference. First operand 2020 states and 3068 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-03-04 11:34:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:50,693 INFO L93 Difference]: Finished difference Result 5920 states and 9086 transitions. [2025-03-04 11:34:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:34:50,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 66 [2025-03-04 11:34:50,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:50,713 INFO L225 Difference]: With dead ends: 5920 [2025-03-04 11:34:50,713 INFO L226 Difference]: Without dead ends: 3912 [2025-03-04 11:34:50,720 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-03-04 11:34:50,721 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 331 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 653 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-03-04 11:34:50,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 653 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2025-03-04 11:34:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3892. [2025-03-04 11:34:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3892 states, 3234 states have (on average 1.4257884972170687) internal successors, (4611), 3388 states have internal predecessors, (4611), 328 states have call successors, (328), 192 states have call predecessors, (328), 324 states have return successors, (871), 327 states have call predecessors, (871), 328 states have call successors, (871) [2025-03-04 11:34:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5810 transitions. [2025-03-04 11:34:50,933 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5810 transitions. Word has length 66 [2025-03-04 11:34:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:50,933 INFO L471 AbstractCegarLoop]: Abstraction has 3892 states and 5810 transitions. [2025-03-04 11:34:50,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-03-04 11:34:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5810 transitions. [2025-03-04 11:34:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 11:34:50,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:50,935 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-03-04 11:34:50,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:34:50,935 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:50,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:50,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2066082874, now seen corresponding path program 1 times [2025-03-04 11:34:50,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:50,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456691074] [2025-03-04 11:34:50,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:50,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:50,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 11:34:50,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 11:34:50,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:50,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:50,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:50,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456691074] [2025-03-04 11:34:50,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456691074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:50,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:50,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:50,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601921998] [2025-03-04 11:34:50,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:50,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:50,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:50,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:50,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:50,977 INFO L87 Difference]: Start difference. First operand 3892 states and 5810 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-03-04 11:34:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:51,137 INFO L93 Difference]: Finished difference Result 7820 states and 11796 transitions. [2025-03-04 11:34:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:51,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 67 [2025-03-04 11:34:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:51,157 INFO L225 Difference]: With dead ends: 7820 [2025-03-04 11:34:51,157 INFO L226 Difference]: Without dead ends: 3940 [2025-03-04 11:34:51,167 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-03-04 11:34:51,167 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 770 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-03-04 11:34:51,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 770 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:51,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2025-03-04 11:34:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 3940. [2025-03-04 11:34:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3940 states, 3282 states have (on average 1.4146861669713588) internal successors, (4643), 3436 states have internal predecessors, (4643), 328 states have call successors, (328), 192 states have call predecessors, (328), 324 states have return successors, (871), 327 states have call predecessors, (871), 328 states have call successors, (871) [2025-03-04 11:34:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 5842 transitions. [2025-03-04 11:34:51,406 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 5842 transitions. Word has length 67 [2025-03-04 11:34:51,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:51,407 INFO L471 AbstractCegarLoop]: Abstraction has 3940 states and 5842 transitions. [2025-03-04 11:34:51,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-03-04 11:34:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 5842 transitions. [2025-03-04 11:34:51,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 11:34:51,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:51,409 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-03-04 11:34:51,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:34:51,409 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:51,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash 130422587, now seen corresponding path program 1 times [2025-03-04 11:34:51,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:51,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195851831] [2025-03-04 11:34:51,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:51,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:51,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 11:34:51,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 11:34:51,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:51,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:51,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:51,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195851831] [2025-03-04 11:34:51,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195851831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:51,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:51,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:34:51,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289349578] [2025-03-04 11:34:51,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:51,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:34:51,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:51,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:34:51,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:34:51,447 INFO L87 Difference]: Start difference. First operand 3940 states and 5842 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-03-04 11:34:51,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:51,822 INFO L93 Difference]: Finished difference Result 11664 states and 17360 transitions. [2025-03-04 11:34:51,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:34:51,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 67 [2025-03-04 11:34:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:51,851 INFO L225 Difference]: With dead ends: 11664 [2025-03-04 11:34:51,852 INFO L226 Difference]: Without dead ends: 7736 [2025-03-04 11:34:51,860 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-03-04 11:34:51,860 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 338 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:51,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 649 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:34:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7736 states. [2025-03-04 11:34:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7736 to 7636. [2025-03-04 11:34:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7636 states, 6348 states have (on average 1.4031190926275992) internal successors, (8907), 6650 states have internal predecessors, (8907), 634 states have call successors, (634), 384 states have call predecessors, (634), 648 states have return successors, (1689), 617 states have call predecessors, (1689), 634 states have call successors, (1689) [2025-03-04 11:34:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7636 states to 7636 states and 11230 transitions. [2025-03-04 11:34:52,203 INFO L78 Accepts]: Start accepts. Automaton has 7636 states and 11230 transitions. Word has length 67 [2025-03-04 11:34:52,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:52,204 INFO L471 AbstractCegarLoop]: Abstraction has 7636 states and 11230 transitions. [2025-03-04 11:34:52,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-03-04 11:34:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 7636 states and 11230 transitions. [2025-03-04 11:34:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 11:34:52,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:52,207 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, 1] [2025-03-04 11:34:52,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:34:52,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:52,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:52,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1232281276, now seen corresponding path program 1 times [2025-03-04 11:34:52,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:52,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005143360] [2025-03-04 11:34:52,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:52,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:52,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 11:34:52,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:34:52,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:52,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:52,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:52,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005143360] [2025-03-04 11:34:52,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005143360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:52,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:52,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:52,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128250085] [2025-03-04 11:34:52,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:52,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:52,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:52,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:52,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:52,246 INFO L87 Difference]: Start difference. First operand 7636 states and 11230 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-04 11:34:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:52,613 INFO L93 Difference]: Finished difference Result 15356 states and 22814 transitions. [2025-03-04 11:34:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:52,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-04 11:34:52,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:52,659 INFO L225 Difference]: With dead ends: 15356 [2025-03-04 11:34:52,659 INFO L226 Difference]: Without dead ends: 7732 [2025-03-04 11:34:52,686 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-03-04 11:34:52,689 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 770 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-03-04 11:34:52,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 770 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:52,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7732 states. [2025-03-04 11:34:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7732 to 7732. [2025-03-04 11:34:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7732 states, 6444 states have (on average 1.3921477343265052) internal successors, (8971), 6746 states have internal predecessors, (8971), 634 states have call successors, (634), 384 states have call predecessors, (634), 648 states have return successors, (1689), 617 states have call predecessors, (1689), 634 states have call successors, (1689) [2025-03-04 11:34:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7732 states to 7732 states and 11294 transitions. [2025-03-04 11:34:53,174 INFO L78 Accepts]: Start accepts. Automaton has 7732 states and 11294 transitions. Word has length 68 [2025-03-04 11:34:53,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:53,174 INFO L471 AbstractCegarLoop]: Abstraction has 7732 states and 11294 transitions. [2025-03-04 11:34:53,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-04 11:34:53,175 INFO L276 IsEmpty]: Start isEmpty. Operand 7732 states and 11294 transitions. [2025-03-04 11:34:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 11:34:53,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:53,178 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, 1] [2025-03-04 11:34:53,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:34:53,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:53,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:53,179 INFO L85 PathProgramCache]: Analyzing trace with hash 718018979, now seen corresponding path program 1 times [2025-03-04 11:34:53,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:53,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655195622] [2025-03-04 11:34:53,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:53,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:53,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 11:34:53,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:34:53,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:53,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:34:53,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:53,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655195622] [2025-03-04 11:34:53,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655195622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:53,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:53,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44120254] [2025-03-04 11:34:53,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:53,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:53,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:53,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:53,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:53,223 INFO L87 Difference]: Start difference. First operand 7732 states and 11294 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-04 11:34:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:53,806 INFO L93 Difference]: Finished difference Result 26122 states and 38386 transitions. [2025-03-04 11:34:53,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:53,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-03-04 11:34:53,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:53,869 INFO L225 Difference]: With dead ends: 26122 [2025-03-04 11:34:53,869 INFO L226 Difference]: Without dead ends: 17732 [2025-03-04 11:34:53,889 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-03-04 11:34:53,890 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 685 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:53,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 775 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:34:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17732 states. [2025-03-04 11:34:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17732 to 15359. [2025-03-04 11:34:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15359 states, 12775 states have (on average 1.3892759295499022) internal successors, (17748), 13400 states have internal predecessors, (17748), 1238 states have call successors, (1238), 772 states have call predecessors, (1238), 1340 states have return successors, (3399), 1202 states have call predecessors, (3399), 1238 states have call successors, (3399) [2025-03-04 11:34:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15359 states to 15359 states and 22385 transitions. [2025-03-04 11:34:54,640 INFO L78 Accepts]: Start accepts. Automaton has 15359 states and 22385 transitions. Word has length 68 [2025-03-04 11:34:54,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:54,641 INFO L471 AbstractCegarLoop]: Abstraction has 15359 states and 22385 transitions. [2025-03-04 11:34:54,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-03-04 11:34:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 15359 states and 22385 transitions. [2025-03-04 11:34:54,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:34:54,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:54,648 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 11:34:54,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 11:34:54,648 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:54,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:54,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1741356792, now seen corresponding path program 1 times [2025-03-04 11:34:54,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:54,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535138507] [2025-03-04 11:34:54,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:54,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:54,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:34:54,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:34:54,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:54,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 11:34:54,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:54,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535138507] [2025-03-04 11:34:54,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535138507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:54,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:54,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:54,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537686622] [2025-03-04 11:34:54,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:54,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:54,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:54,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:54,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:54,701 INFO L87 Difference]: Start difference. First operand 15359 states and 22385 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-03-04 11:34:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:55,466 INFO L93 Difference]: Finished difference Result 30994 states and 45674 transitions. [2025-03-04 11:34:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:34:55,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 86 [2025-03-04 11:34:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:55,541 INFO L225 Difference]: With dead ends: 30994 [2025-03-04 11:34:55,541 INFO L226 Difference]: Without dead ends: 15647 [2025-03-04 11:34:55,581 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-03-04 11:34:55,581 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 770 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-03-04 11:34:55,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 770 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:34:55,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15647 states. [2025-03-04 11:34:56,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15647 to 15647. [2025-03-04 11:34:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15647 states, 13063 states have (on average 1.3757942279721351) internal successors, (17972), 13688 states have internal predecessors, (17972), 1238 states have call successors, (1238), 772 states have call predecessors, (1238), 1340 states have return successors, (3399), 1202 states have call predecessors, (3399), 1238 states have call successors, (3399) [2025-03-04 11:34:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15647 states to 15647 states and 22609 transitions. [2025-03-04 11:34:56,270 INFO L78 Accepts]: Start accepts. Automaton has 15647 states and 22609 transitions. Word has length 86 [2025-03-04 11:34:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:56,271 INFO L471 AbstractCegarLoop]: Abstraction has 15647 states and 22609 transitions. [2025-03-04 11:34:56,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-03-04 11:34:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 15647 states and 22609 transitions. [2025-03-04 11:34:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:34:56,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:56,278 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 11:34:56,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:34:56,279 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:56,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash -771775769, now seen corresponding path program 1 times [2025-03-04 11:34:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390112799] [2025-03-04 11:34:56,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:56,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:34:56,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:34:56,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:56,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 11:34:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:56,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390112799] [2025-03-04 11:34:56,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390112799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:56,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:56,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:34:56,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329093384] [2025-03-04 11:34:56,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:56,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:34:56,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:56,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:34:56,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:34:56,341 INFO L87 Difference]: Start difference. First operand 15647 states and 22609 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-03-04 11:34:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:57,030 INFO L93 Difference]: Finished difference Result 18639 states and 26908 transitions. [2025-03-04 11:34:57,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:34:57,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 86 [2025-03-04 11:34:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:57,084 INFO L225 Difference]: With dead ends: 18639 [2025-03-04 11:34:57,085 INFO L226 Difference]: Without dead ends: 17090 [2025-03-04 11:34:57,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-03-04 11:34:57,096 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 297 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:57,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 517 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:34:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17090 states. [2025-03-04 11:34:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17090 to 16529. [2025-03-04 11:34:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16529 states, 13812 states have (on average 1.3575876049811757) internal successors, (18751), 14443 states have internal predecessors, (18751), 1318 states have call successors, (1318), 822 states have call predecessors, (1318), 1393 states have return successors, (3349), 1279 states have call predecessors, (3349), 1318 states have call successors, (3349) [2025-03-04 11:34:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16529 states to 16529 states and 23418 transitions. [2025-03-04 11:34:57,720 INFO L78 Accepts]: Start accepts. Automaton has 16529 states and 23418 transitions. Word has length 86 [2025-03-04 11:34:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:57,721 INFO L471 AbstractCegarLoop]: Abstraction has 16529 states and 23418 transitions. [2025-03-04 11:34:57,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-03-04 11:34:57,722 INFO L276 IsEmpty]: Start isEmpty. Operand 16529 states and 23418 transitions. [2025-03-04 11:34:57,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:34:57,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:57,727 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 11:34:57,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 11:34:57,727 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:57,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:57,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1796469690, now seen corresponding path program 1 times [2025-03-04 11:34:57,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:57,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437708242] [2025-03-04 11:34:57,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:57,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:57,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:34:57,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:34:57,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:57,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 11:34:57,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:57,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437708242] [2025-03-04 11:34:57,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437708242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:57,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:57,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:57,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272021672] [2025-03-04 11:34:57,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:57,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:57,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:57,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:57,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:57,824 INFO L87 Difference]: Start difference. First operand 16529 states and 23418 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03-04 11:34:58,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:58,378 INFO L93 Difference]: Finished difference Result 19311 states and 27304 transitions. [2025-03-04 11:34:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:34:58,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 86 [2025-03-04 11:34:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:58,413 INFO L225 Difference]: With dead ends: 19311 [2025-03-04 11:34:58,413 INFO L226 Difference]: Without dead ends: 10018 [2025-03-04 11:34:58,427 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-03-04 11:34:58,428 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 297 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:58,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 669 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:34:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10018 states. [2025-03-04 11:34:58,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10018 to 9301. [2025-03-04 11:34:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9301 states, 7829 states have (on average 1.3370800868565589) internal successors, (10468), 8050 states have internal predecessors, (10468), 792 states have call successors, (792), 488 states have call predecessors, (792), 674 states have return successors, (1309), 770 states have call predecessors, (1309), 792 states have call successors, (1309) [2025-03-04 11:34:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9301 states to 9301 states and 12569 transitions. [2025-03-04 11:34:58,984 INFO L78 Accepts]: Start accepts. Automaton has 9301 states and 12569 transitions. Word has length 86 [2025-03-04 11:34:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:34:58,985 INFO L471 AbstractCegarLoop]: Abstraction has 9301 states and 12569 transitions. [2025-03-04 11:34:58,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03-04 11:34:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 9301 states and 12569 transitions. [2025-03-04 11:34:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:34:58,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:34:58,990 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 11:34:58,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 11:34:58,991 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:34:58,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:34:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2049800967, now seen corresponding path program 1 times [2025-03-04 11:34:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:34:58,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540663057] [2025-03-04 11:34:58,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:34:58,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:34:58,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:34:59,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:34:59,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:34:59,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:34:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 11:34:59,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:34:59,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540663057] [2025-03-04 11:34:59,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540663057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:34:59,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:34:59,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:34:59,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071252120] [2025-03-04 11:34:59,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:34:59,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:34:59,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:34:59,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:34:59,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:34:59,107 INFO L87 Difference]: Start difference. First operand 9301 states and 12569 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03-04 11:34:59,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:34:59,672 INFO L93 Difference]: Finished difference Result 11711 states and 15933 transitions. [2025-03-04 11:34:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:34:59,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 86 [2025-03-04 11:34:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:34:59,699 INFO L225 Difference]: With dead ends: 11711 [2025-03-04 11:34:59,699 INFO L226 Difference]: Without dead ends: 5898 [2025-03-04 11:34:59,710 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-03-04 11:34:59,711 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 289 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:34:59,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 661 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:34:59,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5898 states. [2025-03-04 11:35:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5898 to 5553. [2025-03-04 11:35:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5553 states, 4699 states have (on average 1.333049585018089) internal successors, (6264), 4784 states have internal predecessors, (6264), 488 states have call successors, (488), 296 states have call predecessors, (488), 360 states have return successors, (629), 476 states have call predecessors, (629), 488 states have call successors, (629) [2025-03-04 11:35:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5553 states to 5553 states and 7381 transitions. [2025-03-04 11:35:00,036 INFO L78 Accepts]: Start accepts. Automaton has 5553 states and 7381 transitions. Word has length 86 [2025-03-04 11:35:00,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:00,036 INFO L471 AbstractCegarLoop]: Abstraction has 5553 states and 7381 transitions. [2025-03-04 11:35:00,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03-04 11:35:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5553 states and 7381 transitions. [2025-03-04 11:35:00,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:35:00,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:00,039 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 11:35:00,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:35:00,041 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:00,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2121093082, now seen corresponding path program 1 times [2025-03-04 11:35:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:00,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746717932] [2025-03-04 11:35:00,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:00,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:00,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:35:00,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:35:00,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:00,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 11:35:00,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:00,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746717932] [2025-03-04 11:35:00,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746717932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:00,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:00,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:35:00,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132702416] [2025-03-04 11:35:00,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:00,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:00,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:00,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:00,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:35:00,146 INFO L87 Difference]: Start difference. First operand 5553 states and 7381 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03-04 11:35:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:00,711 INFO L93 Difference]: Finished difference Result 9101 states and 12202 transitions. [2025-03-04 11:35:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:35:00,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 86 [2025-03-04 11:35:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:00,741 INFO L225 Difference]: With dead ends: 9101 [2025-03-04 11:35:00,741 INFO L226 Difference]: Without dead ends: 5242 [2025-03-04 11:35:00,751 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-03-04 11:35:00,751 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 304 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:00,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 648 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2025-03-04 11:35:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 4643. [2025-03-04 11:35:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4643 states, 3944 states have (on average 1.3344320486815415) internal successors, (5263), 3993 states have internal predecessors, (5263), 414 states have call successors, (414), 248 states have call predecessors, (414), 279 states have return successors, (471), 403 states have call predecessors, (471), 414 states have call successors, (471) [2025-03-04 11:35:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4643 states to 4643 states and 6148 transitions. [2025-03-04 11:35:01,031 INFO L78 Accepts]: Start accepts. Automaton has 4643 states and 6148 transitions. Word has length 86 [2025-03-04 11:35:01,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:01,032 INFO L471 AbstractCegarLoop]: Abstraction has 4643 states and 6148 transitions. [2025-03-04 11:35:01,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03-04 11:35:01,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4643 states and 6148 transitions. [2025-03-04 11:35:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:35:01,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:01,033 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 11:35:01,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:35:01,033 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:01,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:01,034 INFO L85 PathProgramCache]: Analyzing trace with hash 238213927, now seen corresponding path program 1 times [2025-03-04 11:35:01,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:01,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055103803] [2025-03-04 11:35:01,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:01,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:01,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:35:01,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:35:01,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:01,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 11:35:01,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:01,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055103803] [2025-03-04 11:35:01,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055103803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:01,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:01,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:35:01,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305372202] [2025-03-04 11:35:01,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:01,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:35:01,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:01,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:35:01,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:01,101 INFO L87 Difference]: Start difference. First operand 4643 states and 6148 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-03-04 11:35:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:01,506 INFO L93 Difference]: Finished difference Result 10740 states and 14114 transitions. [2025-03-04 11:35:01,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:01,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 86 [2025-03-04 11:35:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:01,526 INFO L225 Difference]: With dead ends: 10740 [2025-03-04 11:35:01,526 INFO L226 Difference]: Without dead ends: 6109 [2025-03-04 11:35:01,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-03-04 11:35:01,531 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 255 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:01,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 350 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6109 states. [2025-03-04 11:35:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6109 to 5587. [2025-03-04 11:35:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5587 states, 4816 states have (on average 1.2855066445182723) internal successors, (6191), 4861 states have internal predecessors, (6191), 430 states have call successors, (430), 304 states have call predecessors, (430), 335 states have return successors, (522), 423 states have call predecessors, (522), 430 states have call successors, (522) [2025-03-04 11:35:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5587 states to 5587 states and 7143 transitions. [2025-03-04 11:35:01,699 INFO L78 Accepts]: Start accepts. Automaton has 5587 states and 7143 transitions. Word has length 86 [2025-03-04 11:35:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:01,700 INFO L471 AbstractCegarLoop]: Abstraction has 5587 states and 7143 transitions. [2025-03-04 11:35:01,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-03-04 11:35:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 5587 states and 7143 transitions. [2025-03-04 11:35:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:35:01,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:01,701 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 11:35:01,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 11:35:01,701 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:01,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:01,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1699793926, now seen corresponding path program 1 times [2025-03-04 11:35:01,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:01,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485955759] [2025-03-04 11:35:01,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:01,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:01,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:35:01,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:35:01,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:01,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 11:35:01,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:01,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485955759] [2025-03-04 11:35:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485955759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:01,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:35:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592577025] [2025-03-04 11:35:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:01,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:01,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:01,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:01,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:35:01,782 INFO L87 Difference]: Start difference. First operand 5587 states and 7143 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03-04 11:35:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:02,153 INFO L93 Difference]: Finished difference Result 9288 states and 11950 transitions. [2025-03-04 11:35:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:35:02,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 86 [2025-03-04 11:35:02,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:02,176 INFO L225 Difference]: With dead ends: 9288 [2025-03-04 11:35:02,176 INFO L226 Difference]: Without dead ends: 5254 [2025-03-04 11:35:02,181 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-03-04 11:35:02,182 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 271 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:02,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 626 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2025-03-04 11:35:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 4848. [2025-03-04 11:35:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4848 states, 4186 states have (on average 1.2895365504061156) internal successors, (5398), 4216 states have internal predecessors, (5398), 375 states have call successors, (375), 263 states have call predecessors, (375), 281 states have return successors, (441), 369 states have call predecessors, (441), 375 states have call successors, (441) [2025-03-04 11:35:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4848 states to 4848 states and 6214 transitions. [2025-03-04 11:35:02,332 INFO L78 Accepts]: Start accepts. Automaton has 4848 states and 6214 transitions. Word has length 86 [2025-03-04 11:35:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:02,332 INFO L471 AbstractCegarLoop]: Abstraction has 4848 states and 6214 transitions. [2025-03-04 11:35:02,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03-04 11:35:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 4848 states and 6214 transitions. [2025-03-04 11:35:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:35:02,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:02,333 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 11:35:02,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 11:35:02,333 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:02,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:02,333 INFO L85 PathProgramCache]: Analyzing trace with hash 777110343, now seen corresponding path program 1 times [2025-03-04 11:35:02,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:02,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23175878] [2025-03-04 11:35:02,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:02,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:02,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:35:02,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:35:02,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:02,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:35:02,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:02,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23175878] [2025-03-04 11:35:02,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23175878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:02,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:02,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:35:02,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063365837] [2025-03-04 11:35:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:02,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:02,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:02,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:02,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:02,370 INFO L87 Difference]: Start difference. First operand 4848 states and 6214 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-03-04 11:35:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:02,704 INFO L93 Difference]: Finished difference Result 13937 states and 18088 transitions. [2025-03-04 11:35:02,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:02,705 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-03-04 11:35:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:02,731 INFO L225 Difference]: With dead ends: 13937 [2025-03-04 11:35:02,731 INFO L226 Difference]: Without dead ends: 9101 [2025-03-04 11:35:02,740 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-03-04 11:35:02,741 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 246 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:02,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 485 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:02,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9101 states. [2025-03-04 11:35:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9101 to 8793. [2025-03-04 11:35:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8793 states, 7562 states have (on average 1.282464956360751) internal successors, (9698), 7627 states have internal predecessors, (9698), 687 states have call successors, (687), 464 states have call predecessors, (687), 538 states have return successors, (970), 703 states have call predecessors, (970), 687 states have call successors, (970) [2025-03-04 11:35:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8793 states to 8793 states and 11355 transitions. [2025-03-04 11:35:03,021 INFO L78 Accepts]: Start accepts. Automaton has 8793 states and 11355 transitions. Word has length 86 [2025-03-04 11:35:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:03,021 INFO L471 AbstractCegarLoop]: Abstraction has 8793 states and 11355 transitions. [2025-03-04 11:35:03,021 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-03-04 11:35:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 8793 states and 11355 transitions. [2025-03-04 11:35:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 11:35:03,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:03,022 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, 1] [2025-03-04 11:35:03,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 11:35:03,022 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:03,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:03,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1870824270, now seen corresponding path program 1 times [2025-03-04 11:35:03,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:03,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398848856] [2025-03-04 11:35:03,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:03,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:03,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 11:35:03,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 11:35:03,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:03,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 11:35:03,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:03,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398848856] [2025-03-04 11:35:03,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398848856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:03,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:03,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:03,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890382702] [2025-03-04 11:35:03,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:03,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:03,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:03,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:03,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:03,045 INFO L87 Difference]: Start difference. First operand 8793 states and 11355 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, (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-03-04 11:35:03,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:03,275 INFO L93 Difference]: Finished difference Result 16091 states and 20665 transitions. [2025-03-04 11:35:03,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:03,275 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, (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 88 [2025-03-04 11:35:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:03,301 INFO L225 Difference]: With dead ends: 16091 [2025-03-04 11:35:03,301 INFO L226 Difference]: Without dead ends: 7310 [2025-03-04 11:35:03,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:03,312 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 193 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-03-04 11:35:03,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 193 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:03,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7310 states. [2025-03-04 11:35:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7310 to 7150. [2025-03-04 11:35:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7150 states, 6170 states have (on average 1.2752025931928688) internal successors, (7868), 6230 states have internal predecessors, (7868), 536 states have call successors, (536), 368 states have call predecessors, (536), 438 states have return successors, (746), 552 states have call predecessors, (746), 536 states have call successors, (746) [2025-03-04 11:35:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7150 states to 7150 states and 9150 transitions. [2025-03-04 11:35:03,538 INFO L78 Accepts]: Start accepts. Automaton has 7150 states and 9150 transitions. Word has length 88 [2025-03-04 11:35:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:03,540 INFO L471 AbstractCegarLoop]: Abstraction has 7150 states and 9150 transitions. [2025-03-04 11:35:03,540 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, (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-03-04 11:35:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 7150 states and 9150 transitions. [2025-03-04 11:35:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 11:35:03,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:03,542 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, 1, 1, 1, 1] [2025-03-04 11:35:03,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 11:35:03,542 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:03,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1232014279, now seen corresponding path program 1 times [2025-03-04 11:35:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:03,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003632599] [2025-03-04 11:35:03,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:03,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:03,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 11:35:03,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:35:03,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:03,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:35:03,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:03,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003632599] [2025-03-04 11:35:03,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003632599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:03,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:03,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:35:03,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315525609] [2025-03-04 11:35:03,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:03,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:03,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:03,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:03,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:03,582 INFO L87 Difference]: Start difference. First operand 7150 states and 9150 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 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-03-04 11:35:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:04,077 INFO L93 Difference]: Finished difference Result 21343 states and 27322 transitions. [2025-03-04 11:35:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:04,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 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-03-04 11:35:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:04,125 INFO L225 Difference]: With dead ends: 21343 [2025-03-04 11:35:04,125 INFO L226 Difference]: Without dead ends: 14205 [2025-03-04 11:35:04,140 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-03-04 11:35:04,142 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 219 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:04,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 416 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:04,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14205 states. [2025-03-04 11:35:04,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14205 to 14104. [2025-03-04 11:35:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14104 states, 12064 states have (on average 1.2584549071618036) internal successors, (15182), 12264 states have internal predecessors, (15182), 1038 states have call successors, (1038), 724 states have call predecessors, (1038), 996 states have return successors, (1741), 1117 states have call predecessors, (1741), 1038 states have call successors, (1741) [2025-03-04 11:35:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14104 states to 14104 states and 17961 transitions. [2025-03-04 11:35:04,678 INFO L78 Accepts]: Start accepts. Automaton has 14104 states and 17961 transitions. Word has length 90 [2025-03-04 11:35:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:04,678 INFO L471 AbstractCegarLoop]: Abstraction has 14104 states and 17961 transitions. [2025-03-04 11:35:04,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 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-03-04 11:35:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 14104 states and 17961 transitions. [2025-03-04 11:35:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 11:35:04,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:04,679 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, 1, 1, 1, 1] [2025-03-04 11:35:04,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 11:35:04,679 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:04,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:04,680 INFO L85 PathProgramCache]: Analyzing trace with hash 703095240, now seen corresponding path program 1 times [2025-03-04 11:35:04,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:04,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598030978] [2025-03-04 11:35:04,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:04,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:04,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 11:35:04,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 11:35:04,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:04,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 11:35:04,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:04,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598030978] [2025-03-04 11:35:04,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598030978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:04,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:04,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:04,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569991647] [2025-03-04 11:35:04,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:04,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:04,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:04,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:04,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:04,696 INFO L87 Difference]: Start difference. First operand 14104 states and 17961 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-03-04 11:35:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:05,026 INFO L93 Difference]: Finished difference Result 25284 states and 32169 transitions. [2025-03-04 11:35:05,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:05,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 90 [2025-03-04 11:35:05,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:05,065 INFO L225 Difference]: With dead ends: 25284 [2025-03-04 11:35:05,066 INFO L226 Difference]: Without dead ends: 11192 [2025-03-04 11:35:05,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:05,086 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 192 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-03-04 11:35:05,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 192 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:05,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11192 states. [2025-03-04 11:35:05,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11192 to 11192. [2025-03-04 11:35:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11192 states, 9604 states have (on average 1.2591628488129947) internal successors, (12093), 9750 states have internal predecessors, (12093), 820 states have call successors, (820), 574 states have call predecessors, (820), 762 states have return successors, (1312), 868 states have call predecessors, (1312), 820 states have call successors, (1312) [2025-03-04 11:35:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11192 states to 11192 states and 14225 transitions. [2025-03-04 11:35:05,489 INFO L78 Accepts]: Start accepts. Automaton has 11192 states and 14225 transitions. Word has length 90 [2025-03-04 11:35:05,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:05,489 INFO L471 AbstractCegarLoop]: Abstraction has 11192 states and 14225 transitions. [2025-03-04 11:35:05,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-03-04 11:35:05,489 INFO L276 IsEmpty]: Start isEmpty. Operand 11192 states and 14225 transitions. [2025-03-04 11:35:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 11:35:05,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:05,491 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 11:35:05,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:35:05,491 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:05,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:05,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1747964417, now seen corresponding path program 1 times [2025-03-04 11:35:05,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:05,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625730283] [2025-03-04 11:35:05,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:05,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:05,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 11:35:05,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 11:35:05,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:05,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:35:05,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:05,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625730283] [2025-03-04 11:35:05,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625730283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:05,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:05,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:35:05,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091822172] [2025-03-04 11:35:05,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:05,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:05,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:05,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:05,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:05,531 INFO L87 Difference]: Start difference. First operand 11192 states and 14225 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-03-04 11:35:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:06,332 INFO L93 Difference]: Finished difference Result 33290 states and 42296 transitions. [2025-03-04 11:35:06,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:35:06,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 91 [2025-03-04 11:35:06,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:06,395 INFO L225 Difference]: With dead ends: 33290 [2025-03-04 11:35:06,395 INFO L226 Difference]: Without dead ends: 22110 [2025-03-04 11:35:06,417 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-03-04 11:35:06,421 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 229 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:06,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 498 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22110 states. [2025-03-04 11:35:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22110 to 22044. [2025-03-04 11:35:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22044 states, 18895 states have (on average 1.2478433448002118) internal successors, (23578), 19228 states have internal predecessors, (23578), 1582 states have call successors, (1582), 1124 states have call predecessors, (1582), 1561 states have return successors, (2624), 1693 states have call predecessors, (2624), 1582 states have call successors, (2624) [2025-03-04 11:35:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22044 states to 22044 states and 27784 transitions. [2025-03-04 11:35:07,312 INFO L78 Accepts]: Start accepts. Automaton has 22044 states and 27784 transitions. Word has length 91 [2025-03-04 11:35:07,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:07,312 INFO L471 AbstractCegarLoop]: Abstraction has 22044 states and 27784 transitions. [2025-03-04 11:35:07,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-03-04 11:35:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 22044 states and 27784 transitions. [2025-03-04 11:35:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 11:35:07,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:07,313 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 11:35:07,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 11:35:07,313 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:07,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:07,313 INFO L85 PathProgramCache]: Analyzing trace with hash 262908866, now seen corresponding path program 1 times [2025-03-04 11:35:07,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:07,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952172140] [2025-03-04 11:35:07,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:07,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:07,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 11:35:07,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 11:35:07,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:07,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:35:07,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:07,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952172140] [2025-03-04 11:35:07,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952172140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:07,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:07,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:07,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156830158] [2025-03-04 11:35:07,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:07,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:07,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:07,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:07,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:07,330 INFO L87 Difference]: Start difference. First operand 22044 states and 27784 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-03-04 11:35:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:07,897 INFO L93 Difference]: Finished difference Result 39964 states and 50368 transitions. [2025-03-04 11:35:07,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:07,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 91 [2025-03-04 11:35:07,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:07,953 INFO L225 Difference]: With dead ends: 39964 [2025-03-04 11:35:07,953 INFO L226 Difference]: Without dead ends: 17932 [2025-03-04 11:35:07,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:07,985 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 191 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-03-04 11:35:07,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 191 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17932 states. [2025-03-04 11:35:08,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17932 to 17932. [2025-03-04 11:35:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17932 states, 15382 states have (on average 1.2479521518658172) internal successors, (19196), 15657 states have internal predecessors, (19196), 1269 states have call successors, (1269), 902 states have call predecessors, (1269), 1275 states have return successors, (2135), 1373 states have call predecessors, (2135), 1269 states have call successors, (2135) [2025-03-04 11:35:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17932 states to 17932 states and 22600 transitions. [2025-03-04 11:35:08,733 INFO L78 Accepts]: Start accepts. Automaton has 17932 states and 22600 transitions. Word has length 91 [2025-03-04 11:35:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:08,734 INFO L471 AbstractCegarLoop]: Abstraction has 17932 states and 22600 transitions. [2025-03-04 11:35:08,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-03-04 11:35:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 17932 states and 22600 transitions. [2025-03-04 11:35:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 11:35:08,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:08,735 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, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:08,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 11:35:08,735 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:08,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2062408483, now seen corresponding path program 1 times [2025-03-04 11:35:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:08,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039175448] [2025-03-04 11:35:08,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:08,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 11:35:08,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 11:35:08,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:08,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:35:08,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:08,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039175448] [2025-03-04 11:35:08,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039175448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:08,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:08,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:35:08,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047842533] [2025-03-04 11:35:08,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:08,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:08,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:08,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:08,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:35:08,781 INFO L87 Difference]: Start difference. First operand 17932 states and 22600 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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-03-04 11:35:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:09,577 INFO L93 Difference]: Finished difference Result 29170 states and 37046 transitions. [2025-03-04 11:35:09,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:35:09,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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 92 [2025-03-04 11:35:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:09,694 INFO L225 Difference]: With dead ends: 29170 [2025-03-04 11:35:09,695 INFO L226 Difference]: Without dead ends: 15492 [2025-03-04 11:35:09,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:35:09,712 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 754 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:09,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 814 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15492 states. [2025-03-04 11:35:10,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15492 to 14876. [2025-03-04 11:35:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14876 states, 12788 states have (on average 1.2489834219580858) internal successors, (15972), 13013 states have internal predecessors, (15972), 1030 states have call successors, (1030), 728 states have call predecessors, (1030), 1052 states have return successors, (1778), 1135 states have call predecessors, (1778), 1030 states have call successors, (1778) [2025-03-04 11:35:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14876 states to 14876 states and 18780 transitions. [2025-03-04 11:35:10,748 INFO L78 Accepts]: Start accepts. Automaton has 14876 states and 18780 transitions. Word has length 92 [2025-03-04 11:35:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:10,748 INFO L471 AbstractCegarLoop]: Abstraction has 14876 states and 18780 transitions. [2025-03-04 11:35:10,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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-03-04 11:35:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 14876 states and 18780 transitions. [2025-03-04 11:35:10,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 11:35:10,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:10,749 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-04 11:35:10,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 11:35:10,750 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:10,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:10,750 INFO L85 PathProgramCache]: Analyzing trace with hash 910520769, now seen corresponding path program 1 times [2025-03-04 11:35:10,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:10,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114113171] [2025-03-04 11:35:10,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:10,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:10,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 11:35:10,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 11:35:10,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:10,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:35:10,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:10,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114113171] [2025-03-04 11:35:10,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114113171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:10,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:10,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:35:10,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289179261] [2025-03-04 11:35:10,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:10,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:35:10,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:10,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:35:10,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:35:10,800 INFO L87 Difference]: Start difference. First operand 14876 states and 18780 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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-03-04 11:35:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:11,842 INFO L93 Difference]: Finished difference Result 26734 states and 33747 transitions. [2025-03-04 11:35:11,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:35:11,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 95 [2025-03-04 11:35:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:11,895 INFO L225 Difference]: With dead ends: 26734 [2025-03-04 11:35:11,895 INFO L226 Difference]: Without dead ends: 15426 [2025-03-04 11:35:11,915 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-03-04 11:35:11,916 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 681 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:11,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 950 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:11,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15426 states. [2025-03-04 11:35:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15426 to 14775. [2025-03-04 11:35:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14775 states, 12695 states have (on average 1.245214651437574) internal successors, (15808), 12920 states have internal predecessors, (15808), 1026 states have call successors, (1026), 724 states have call predecessors, (1026), 1048 states have return successors, (1753), 1131 states have call predecessors, (1753), 1026 states have call successors, (1753) [2025-03-04 11:35:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14775 states to 14775 states and 18587 transitions. [2025-03-04 11:35:12,573 INFO L78 Accepts]: Start accepts. Automaton has 14775 states and 18587 transitions. Word has length 95 [2025-03-04 11:35:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:12,573 INFO L471 AbstractCegarLoop]: Abstraction has 14775 states and 18587 transitions. [2025-03-04 11:35:12,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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-03-04 11:35:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 14775 states and 18587 transitions. [2025-03-04 11:35:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 11:35:12,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:12,574 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, 1, 1, 1, 1] [2025-03-04 11:35:12,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 11:35:12,575 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:12,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash 395490444, now seen corresponding path program 1 times [2025-03-04 11:35:12,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:12,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668393091] [2025-03-04 11:35:12,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:12,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:12,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 11:35:12,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 11:35:12,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:12,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 11:35:12,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:12,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668393091] [2025-03-04 11:35:12,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668393091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:12,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:12,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:12,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897880283] [2025-03-04 11:35:12,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:12,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:12,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:12,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:12,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:12,600 INFO L87 Difference]: Start difference. First operand 14775 states and 18587 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-03-04 11:35:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:13,137 INFO L93 Difference]: Finished difference Result 28496 states and 35875 transitions. [2025-03-04 11:35:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:13,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 102 [2025-03-04 11:35:13,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:13,194 INFO L225 Difference]: With dead ends: 28496 [2025-03-04 11:35:13,194 INFO L226 Difference]: Without dead ends: 16697 [2025-03-04 11:35:13,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:13,224 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 141 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 397 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-03-04 11:35:13,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 397 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:13,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16697 states. [2025-03-04 11:35:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16697 to 14245. [2025-03-04 11:35:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14245 states, 12231 states have (on average 1.2345679012345678) internal successors, (15100), 12443 states have internal predecessors, (15100), 1008 states have call successors, (1008), 714 states have call predecessors, (1008), 1000 states have return successors, (1654), 1088 states have call predecessors, (1654), 1008 states have call successors, (1654) [2025-03-04 11:35:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14245 states to 14245 states and 17762 transitions. [2025-03-04 11:35:13,844 INFO L78 Accepts]: Start accepts. Automaton has 14245 states and 17762 transitions. Word has length 102 [2025-03-04 11:35:13,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:13,844 INFO L471 AbstractCegarLoop]: Abstraction has 14245 states and 17762 transitions. [2025-03-04 11:35:13,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-03-04 11:35:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 14245 states and 17762 transitions. [2025-03-04 11:35:13,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 11:35:13,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:13,846 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, 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] [2025-03-04 11:35:13,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 11:35:13,846 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:13,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1881507533, now seen corresponding path program 1 times [2025-03-04 11:35:13,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:13,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098387898] [2025-03-04 11:35:13,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:13,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 11:35:13,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 11:35:13,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:13,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 11:35:13,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:13,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098387898] [2025-03-04 11:35:13,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098387898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:13,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:13,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:35:13,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003442464] [2025-03-04 11:35:13,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:13,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:35:13,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:13,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:35:13,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:35:13,909 INFO L87 Difference]: Start difference. First operand 14245 states and 17762 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 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-03-04 11:35:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:14,942 INFO L93 Difference]: Finished difference Result 26933 states and 33635 transitions. [2025-03-04 11:35:14,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:35:14,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 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 114 [2025-03-04 11:35:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:14,988 INFO L225 Difference]: With dead ends: 26933 [2025-03-04 11:35:14,989 INFO L226 Difference]: Without dead ends: 15614 [2025-03-04 11:35:15,006 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-03-04 11:35:15,007 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 1248 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:15,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 1033 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:15,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15614 states. [2025-03-04 11:35:15,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15614 to 14245. [2025-03-04 11:35:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14245 states, 12231 states have (on average 1.2275365873599868) internal successors, (15014), 12443 states have internal predecessors, (15014), 1008 states have call successors, (1008), 714 states have call predecessors, (1008), 1000 states have return successors, (1525), 1088 states have call predecessors, (1525), 1008 states have call successors, (1525) [2025-03-04 11:35:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14245 states to 14245 states and 17547 transitions. [2025-03-04 11:35:15,588 INFO L78 Accepts]: Start accepts. Automaton has 14245 states and 17547 transitions. Word has length 114 [2025-03-04 11:35:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:15,588 INFO L471 AbstractCegarLoop]: Abstraction has 14245 states and 17547 transitions. [2025-03-04 11:35:15,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 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-03-04 11:35:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 14245 states and 17547 transitions. [2025-03-04 11:35:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 11:35:15,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:15,590 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:15,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 11:35:15,590 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:15,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash -102950490, now seen corresponding path program 1 times [2025-03-04 11:35:15,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:15,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628720705] [2025-03-04 11:35:15,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:15,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:15,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 11:35:15,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 11:35:15,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:15,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 11:35:15,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:15,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628720705] [2025-03-04 11:35:15,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628720705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:15,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:15,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:35:15,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545960389] [2025-03-04 11:35:15,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:15,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:15,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:15,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:15,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:15,619 INFO L87 Difference]: Start difference. First operand 14245 states and 17547 transitions. Second operand has 3 states, 2 states have (on average 41.0) internal successors, (82), 3 states have internal predecessors, (82), 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-03-04 11:35:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:16,182 INFO L93 Difference]: Finished difference Result 14245 states and 17547 transitions. [2025-03-04 11:35:16,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:16,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 41.0) internal successors, (82), 3 states have internal predecessors, (82), 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 122 [2025-03-04 11:35:16,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:16,224 INFO L225 Difference]: With dead ends: 14245 [2025-03-04 11:35:16,224 INFO L226 Difference]: Without dead ends: 14243 [2025-03-04 11:35:16,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:16,229 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 178 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 183 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-03-04 11:35:16,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 183 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14243 states. [2025-03-04 11:35:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14243 to 14243. [2025-03-04 11:35:16,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14243 states, 12231 states have (on average 1.223448614177091) internal successors, (14964), 12441 states have internal predecessors, (14964), 1008 states have call successors, (1008), 714 states have call predecessors, (1008), 1000 states have return successors, (1525), 1088 states have call predecessors, (1525), 1008 states have call successors, (1525) [2025-03-04 11:35:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14243 states to 14243 states and 17497 transitions. [2025-03-04 11:35:16,860 INFO L78 Accepts]: Start accepts. Automaton has 14243 states and 17497 transitions. Word has length 122 [2025-03-04 11:35:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:16,860 INFO L471 AbstractCegarLoop]: Abstraction has 14243 states and 17497 transitions. [2025-03-04 11:35:16,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 41.0) internal successors, (82), 3 states have internal predecessors, (82), 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-03-04 11:35:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 14243 states and 17497 transitions. [2025-03-04 11:35:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 11:35:16,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:16,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:16,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 11:35:16,862 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:35:16,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:16,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1103502232, now seen corresponding path program 1 times [2025-03-04 11:35:16,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:16,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387236979] [2025-03-04 11:35:16,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:16,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:16,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 11:35:16,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 11:35:16,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:16,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 11:35:16,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 11:35:16,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 11:35:16,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 11:35:16,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:16,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 11:35:16,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 11:35:16,915 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 11:35:16,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-04 11:35:16,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-04 11:35:16,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-04 11:35:16,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-04 11:35:16,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-04 11:35:16,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-04 11:35:16,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 11:35:16,921 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, 1, 1] [2025-03-04 11:35:17,003 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:35:17,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:35:17 BoogieIcfgContainer [2025-03-04 11:35:17,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:35:17,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:35:17,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:35:17,010 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:35:17,010 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:34:47" (3/4) ... [2025-03-04 11:35:17,011 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 11:35:17,093 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 89. [2025-03-04 11:35:17,167 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:35:17,167 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:35:17,167 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:35:17,167 INFO L158 Benchmark]: Toolchain (without parser) took 30525.69ms. Allocated memory was 167.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 132.2MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2025-03-04 11:35:17,167 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 125.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:35:17,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.16ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 118.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:35:17,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.41ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 117.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:35:17,168 INFO L158 Benchmark]: Boogie Preprocessor took 31.80ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 115.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:35:17,168 INFO L158 Benchmark]: IcfgBuilder took 448.88ms. Allocated memory is still 167.8MB. Free memory was 115.2MB in the beginning and 92.4MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:35:17,168 INFO L158 Benchmark]: TraceAbstraction took 29626.19ms. Allocated memory was 167.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 91.9MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2025-03-04 11:35:17,168 INFO L158 Benchmark]: Witness Printer took 158.17ms. Allocated memory is still 4.2GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:35:17,169 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.44ms. Allocated memory is still 201.3MB. Free memory was 126.2MB in the beginning and 125.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.16ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 118.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.41ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 117.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.80ms. Allocated memory is still 167.8MB. Free memory was 117.0MB in the beginning and 115.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 448.88ms. Allocated memory is still 167.8MB. Free memory was 115.2MB in the beginning and 92.4MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29626.19ms. Allocated memory was 167.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 91.9MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 158.17ms. Allocated memory is still 4.2GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 21.0MB). 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] [L553] COND TRUE 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] [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] [L281] COND TRUE 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] [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] [L105] COND TRUE 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=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] [L281] COND TRUE 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=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] [L61] COND TRUE 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=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: 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. - 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: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 148 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 29.5s, OverallIterations: 29, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9015 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8841 mSDsluCounter, 17462 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11577 mSDsCounter, 1016 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6010 IncrementalHoareTripleChecker+Invalid, 7026 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1016 mSolverCounterUnsat, 5885 mSDtfsCounter, 6010 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22044occurred in iteration=22, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 11700 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2452 NumberOfCodeBlocks, 2452 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2301 ConstructedInterpolants, 0 QuantifiedInterpolants, 3900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 299/299 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-03-04 11:35:17,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)