./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.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 a4e999359b895f3090fa3a0a394d4e8b87ebbe801b1ab5ed9c028edec94c7c83 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 20:10:56,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 20:10:57,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-24 20:10:57,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 20:10:57,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 20:10:57,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 20:10:57,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 20:10:57,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 20:10:57,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 20:10:57,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 20:10:57,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 20:10:57,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 20:10:57,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 20:10:57,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 20:10:57,109 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 20:10:57,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 20:10:57,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 20:10:57,110 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 20:10:57,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 20:10:57,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 20:10:57,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 20:10:57,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 20:10:57,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 20:10:57,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 20:10:57,112 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 20:10:57,112 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 20:10:57,113 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 20:10:57,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 20:10:57,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 20:10:57,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 20:10:57,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 20:10:57,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 20:10:57,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 20:10:57,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 20:10:57,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:10:57,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 20:10:57,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 20:10:57,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 20:10:57,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 20:10:57,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 20:10:57,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 20:10:57,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 20:10:57,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 20:10:57,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 20:10:57,118 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4e999359b895f3090fa3a0a394d4e8b87ebbe801b1ab5ed9c028edec94c7c83 [2024-10-24 20:10:57,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 20:10:57,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 20:10:57,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 20:10:57,419 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 20:10:57,423 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 20:10:57,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c [2024-10-24 20:10:58,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 20:10:59,036 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 20:10:59,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c [2024-10-24 20:10:59,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51962537d/d827b57ca24c44d18b4981619d30d88e/FLAGd7f745f26 [2024-10-24 20:10:59,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51962537d/d827b57ca24c44d18b4981619d30d88e [2024-10-24 20:10:59,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 20:10:59,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 20:10:59,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 20:10:59,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 20:10:59,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 20:10:59,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:10:59" (1/1) ... [2024-10-24 20:10:59,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30b7ded9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59, skipping insertion in model container [2024-10-24 20:10:59,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:10:59" (1/1) ... [2024-10-24 20:10:59,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 20:10:59,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:10:59,251 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 20:10:59,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 20:10:59,290 INFO L204 MainTranslator]: Completed translation [2024-10-24 20:10:59,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59 WrapperNode [2024-10-24 20:10:59,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 20:10:59,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 20:10:59,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 20:10:59,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 20:10:59,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59" (1/1) ... [2024-10-24 20:10:59,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59" (1/1) ... [2024-10-24 20:10:59,319 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 172 [2024-10-24 20:10:59,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 20:10:59,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 20:10:59,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 20:10:59,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 20:10:59,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59" (1/1) ... [2024-10-24 20:10:59,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59" (1/1) ... [2024-10-24 20:10:59,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59" (1/1) ... [2024-10-24 20:10:59,347 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]. [2024-10-24 20:10:59,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59" (1/1) ... [2024-10-24 20:10:59,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59" (1/1) ... [2024-10-24 20:10:59,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59" (1/1) ... [2024-10-24 20:10:59,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59" (1/1) ... [2024-10-24 20:10:59,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59" (1/1) ... [2024-10-24 20:10:59,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59" (1/1) ... [2024-10-24 20:10:59,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 20:10:59,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 20:10:59,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 20:10:59,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 20:10:59,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59" (1/1) ... [2024-10-24 20:10:59,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 20:10:59,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:10:59,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 20:10:59,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 20:10:59,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 20:10:59,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 20:10:59,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 20:10:59,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 20:10:59,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 20:10:59,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 20:10:59,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 20:10:59,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 20:10:59,556 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 20:10:59,559 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 20:10:59,908 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-10-24 20:10:59,908 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 20:10:59,940 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 20:10:59,943 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-24 20:10:59,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:10:59 BoogieIcfgContainer [2024-10-24 20:10:59,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 20:10:59,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 20:10:59,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 20:10:59,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 20:10:59,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:10:59" (1/3) ... [2024-10-24 20:10:59,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9e7389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:10:59, skipping insertion in model container [2024-10-24 20:10:59,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:10:59" (2/3) ... [2024-10-24 20:10:59,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9e7389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:10:59, skipping insertion in model container [2024-10-24 20:10:59,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:10:59" (3/3) ... [2024-10-24 20:10:59,952 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound1.c [2024-10-24 20:10:59,965 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 20:10:59,965 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2024-10-24 20:11:00,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 20:11:00,033 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;@2211377c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 20:11:00,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2024-10-24 20:11:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 115 states have (on average 1.9478260869565218) internal successors, (224), 213 states have internal predecessors, (224), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 20:11:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 20:11:00,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:00,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 20:11:00,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:00,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:00,046 INFO L85 PathProgramCache]: Analyzing trace with hash 10140, now seen corresponding path program 1 times [2024-10-24 20:11:00,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:00,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579000244] [2024-10-24 20:11:00,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:00,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:11:00,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:00,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579000244] [2024-10-24 20:11:00,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579000244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:00,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:11:00,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 20:11:00,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842402226] [2024-10-24 20:11:00,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:00,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:11:00,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:00,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:11:00,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:11:00,213 INFO L87 Difference]: Start difference. First operand has 222 states, 115 states have (on average 1.9478260869565218) internal successors, (224), 213 states have internal predecessors, (224), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:11:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:00,298 INFO L93 Difference]: Finished difference Result 419 states and 463 transitions. [2024-10-24 20:11:00,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:11:00,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-24 20:11:00,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:00,312 INFO L225 Difference]: With dead ends: 419 [2024-10-24 20:11:00,312 INFO L226 Difference]: Without dead ends: 205 [2024-10-24 20:11:00,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:11:00,319 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 13 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:00,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 384 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:11:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-24 20:11:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-10-24 20:11:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 114 states have (on average 1.780701754385965) internal successors, (203), 197 states have internal predecessors, (203), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:11:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 213 transitions. [2024-10-24 20:11:00,378 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 213 transitions. Word has length 2 [2024-10-24 20:11:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:00,378 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 213 transitions. [2024-10-24 20:11:00,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:11:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 213 transitions. [2024-10-24 20:11:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 20:11:00,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:00,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 20:11:00,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 20:11:00,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:00,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:00,380 INFO L85 PathProgramCache]: Analyzing trace with hash 314376, now seen corresponding path program 1 times [2024-10-24 20:11:00,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:00,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705484806] [2024-10-24 20:11:00,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:00,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:11:00,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:00,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705484806] [2024-10-24 20:11:00,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705484806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:00,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:11:00,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 20:11:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290761270] [2024-10-24 20:11:00,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:00,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:11:00,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:00,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:11:00,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:11:00,403 INFO L87 Difference]: Start difference. First operand 205 states and 213 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:11:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:00,437 INFO L93 Difference]: Finished difference Result 205 states and 213 transitions. [2024-10-24 20:11:00,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:11:00,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-24 20:11:00,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:00,441 INFO L225 Difference]: With dead ends: 205 [2024-10-24 20:11:00,442 INFO L226 Difference]: Without dead ends: 201 [2024-10-24 20:11:00,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:11:00,443 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 12 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:00,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 378 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:11:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-24 20:11:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-10-24 20:11:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 114 states have (on average 1.7456140350877194) internal successors, (199), 193 states have internal predecessors, (199), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:11:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 209 transitions. [2024-10-24 20:11:00,452 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 209 transitions. Word has length 3 [2024-10-24 20:11:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:00,452 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 209 transitions. [2024-10-24 20:11:00,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:11:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 209 transitions. [2024-10-24 20:11:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 20:11:00,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:00,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:11:00,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 20:11:00,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:00,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1723766388, now seen corresponding path program 1 times [2024-10-24 20:11:00,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500759329] [2024-10-24 20:11:00,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:11:00,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456302220] [2024-10-24 20:11:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:00,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:11:00,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:11:00,470 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:11:00,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 20:11:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:00,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:11:00,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:11:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 20:11:00,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:11:00,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:00,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500759329] [2024-10-24 20:11:00,543 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:11:00,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456302220] [2024-10-24 20:11:00,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456302220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:00,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:11:00,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 20:11:00,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636751952] [2024-10-24 20:11:00,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:00,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:11:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:00,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:11:00,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:11:00,545 INFO L87 Difference]: Start difference. First operand 201 states and 209 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:11:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:00,570 INFO L93 Difference]: Finished difference Result 201 states and 209 transitions. [2024-10-24 20:11:00,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:11:00,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 20:11:00,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:00,571 INFO L225 Difference]: With dead ends: 201 [2024-10-24 20:11:00,572 INFO L226 Difference]: Without dead ends: 199 [2024-10-24 20:11:00,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:11:00,573 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 8 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:00,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 378 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:11:00,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-24 20:11:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-10-24 20:11:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 114 states have (on average 1.7280701754385965) internal successors, (197), 191 states have internal predecessors, (197), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:11:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 207 transitions. [2024-10-24 20:11:00,581 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 207 transitions. Word has length 7 [2024-10-24 20:11:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:00,582 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 207 transitions. [2024-10-24 20:11:00,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:11:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 207 transitions. [2024-10-24 20:11:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-24 20:11:00,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:00,583 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:11:00,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 20:11:00,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:11:00,788 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:00,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:00,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2063672454, now seen corresponding path program 1 times [2024-10-24 20:11:00,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:00,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363181977] [2024-10-24 20:11:00,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:00,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:11:00,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [987889888] [2024-10-24 20:11:00,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:00,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:11:00,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:11:00,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:11:00,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 20:11:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:00,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 20:11:00,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:11:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:11:00,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:11:00,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:00,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363181977] [2024-10-24 20:11:00,899 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:11:00,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987889888] [2024-10-24 20:11:00,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987889888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:00,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:11:00,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:11:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650897539] [2024-10-24 20:11:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:00,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:11:00,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:00,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:11:00,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:11:00,901 INFO L87 Difference]: Start difference. First operand 199 states and 207 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:11:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:00,948 INFO L93 Difference]: Finished difference Result 199 states and 207 transitions. [2024-10-24 20:11:00,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:11:00,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-24 20:11:00,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:00,950 INFO L225 Difference]: With dead ends: 199 [2024-10-24 20:11:00,950 INFO L226 Difference]: Without dead ends: 197 [2024-10-24 20:11:00,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:11:00,951 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 162 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:00,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 185 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:11:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-24 20:11:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-10-24 20:11:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 114 states have (on average 1.7105263157894737) internal successors, (195), 189 states have internal predecessors, (195), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:11:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 205 transitions. [2024-10-24 20:11:00,962 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 205 transitions. Word has length 24 [2024-10-24 20:11:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:00,963 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 205 transitions. [2024-10-24 20:11:00,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:11:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 205 transitions. [2024-10-24 20:11:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 20:11:00,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:00,964 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:11:00,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 20:11:01,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-24 20:11:01,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:01,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:01,166 INFO L85 PathProgramCache]: Analyzing trace with hash -450663304, now seen corresponding path program 1 times [2024-10-24 20:11:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:01,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346187430] [2024-10-24 20:11:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:01,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:01,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:11:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:01,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:11:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 20:11:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346187430] [2024-10-24 20:11:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346187430] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:11:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544820003] [2024-10-24 20:11:01,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:01,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:11:01,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:11:01,368 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:11:01,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 20:11:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:01,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 20:11:01,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:11:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 20:11:01,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:11:01,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544820003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:01,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:11:01,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-24 20:11:01,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834128060] [2024-10-24 20:11:01,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:01,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 20:11:01,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:01,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 20:11:01,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:11:01,501 INFO L87 Difference]: Start difference. First operand 197 states and 205 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:11:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:01,648 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2024-10-24 20:11:01,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 20:11:01,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-24 20:11:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:01,651 INFO L225 Difference]: With dead ends: 197 [2024-10-24 20:11:01,651 INFO L226 Difference]: Without dead ends: 195 [2024-10-24 20:11:01,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 20:11:01,652 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 161 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:01,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 678 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:11:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-24 20:11:01,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-10-24 20:11:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 114 states have (on average 1.6929824561403508) internal successors, (193), 187 states have internal predecessors, (193), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:11:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 203 transitions. [2024-10-24 20:11:01,663 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 203 transitions. Word has length 25 [2024-10-24 20:11:01,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:01,663 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 203 transitions. [2024-10-24 20:11:01,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:11:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 203 transitions. [2024-10-24 20:11:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 20:11:01,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:01,664 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:11:01,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 20:11:01,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:11:01,866 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:01,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:01,867 INFO L85 PathProgramCache]: Analyzing trace with hash 704263898, now seen corresponding path program 1 times [2024-10-24 20:11:01,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:01,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835405529] [2024-10-24 20:11:01,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:01,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:01,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:11:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:01,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:11:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:11:01,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:01,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835405529] [2024-10-24 20:11:01,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835405529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:01,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:11:01,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:11:01,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166661836] [2024-10-24 20:11:01,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:01,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:11:01,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:01,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:11:01,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:11:01,929 INFO L87 Difference]: Start difference. First operand 195 states and 203 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:11:01,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:01,953 INFO L93 Difference]: Finished difference Result 229 states and 237 transitions. [2024-10-24 20:11:01,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:11:01,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-10-24 20:11:01,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:01,954 INFO L225 Difference]: With dead ends: 229 [2024-10-24 20:11:01,955 INFO L226 Difference]: Without dead ends: 199 [2024-10-24 20:11:01,955 INFO L431 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 [2024-10-24 20:11:01,956 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 9 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:01,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 567 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:11:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-24 20:11:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-10-24 20:11:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 118 states have (on average 1.6694915254237288) internal successors, (197), 191 states have internal predecessors, (197), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:11:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 207 transitions. [2024-10-24 20:11:01,962 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 207 transitions. Word has length 27 [2024-10-24 20:11:01,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:01,962 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 207 transitions. [2024-10-24 20:11:01,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:11:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 207 transitions. [2024-10-24 20:11:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-24 20:11:01,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:01,963 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 20:11:01,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 20:11:01,964 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:01,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:01,964 INFO L85 PathProgramCache]: Analyzing trace with hash -189384977, now seen corresponding path program 1 times [2024-10-24 20:11:01,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:01,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775049664] [2024-10-24 20:11:01,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:01,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:01,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:11:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:01,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:11:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:11:02,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:02,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775049664] [2024-10-24 20:11:02,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775049664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:02,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:11:02,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:11:02,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581791992] [2024-10-24 20:11:02,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:02,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:11:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:02,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:11:02,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:11:02,002 INFO L87 Difference]: Start difference. First operand 199 states and 207 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:11:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:02,055 INFO L93 Difference]: Finished difference Result 251 states and 261 transitions. [2024-10-24 20:11:02,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:11:02,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-10-24 20:11:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:02,056 INFO L225 Difference]: With dead ends: 251 [2024-10-24 20:11:02,057 INFO L226 Difference]: Without dead ends: 248 [2024-10-24 20:11:02,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:11:02,057 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 141 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:02,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 271 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:11:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-24 20:11:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 214. [2024-10-24 20:11:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 206 states have internal predecessors, (221), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:11:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 231 transitions. [2024-10-24 20:11:02,064 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 231 transitions. Word has length 30 [2024-10-24 20:11:02,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:02,064 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 231 transitions. [2024-10-24 20:11:02,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:11:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 231 transitions. [2024-10-24 20:11:02,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 20:11:02,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:02,065 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 20:11:02,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 20:11:02,065 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:02,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:02,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1575966911, now seen corresponding path program 1 times [2024-10-24 20:11:02,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:02,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350386064] [2024-10-24 20:11:02,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:02,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:02,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:11:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:11:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:11:02,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:02,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350386064] [2024-10-24 20:11:02,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350386064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:02,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:11:02,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 20:11:02,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356098133] [2024-10-24 20:11:02,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:02,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 20:11:02,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:02,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 20:11:02,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:11:02,130 INFO L87 Difference]: Start difference. First operand 214 states and 231 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:11:02,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:02,249 INFO L93 Difference]: Finished difference Result 254 states and 264 transitions. [2024-10-24 20:11:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 20:11:02,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-24 20:11:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:02,252 INFO L225 Difference]: With dead ends: 254 [2024-10-24 20:11:02,252 INFO L226 Difference]: Without dead ends: 251 [2024-10-24 20:11:02,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 20:11:02,253 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 151 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:02,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 427 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:11:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-24 20:11:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 217. [2024-10-24 20:11:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 136 states have (on average 1.6470588235294117) internal successors, (224), 209 states have internal predecessors, (224), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-24 20:11:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 234 transitions. [2024-10-24 20:11:02,261 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 234 transitions. Word has length 31 [2024-10-24 20:11:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:02,262 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 234 transitions. [2024-10-24 20:11:02,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:11:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 234 transitions. [2024-10-24 20:11:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 20:11:02,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:02,263 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:11:02,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 20:11:02,263 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:02,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:02,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1610333903, now seen corresponding path program 1 times [2024-10-24 20:11:02,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:02,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580113885] [2024-10-24 20:11:02,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:02,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:11:02,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285229982] [2024-10-24 20:11:02,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:02,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:11:02,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:11:02,285 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:11:02,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 20:11:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:02,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 20:11:02,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:11:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:11:02,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:11:02,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:02,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580113885] [2024-10-24 20:11:02,397 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:11:02,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285229982] [2024-10-24 20:11:02,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285229982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:02,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:11:02,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:11:02,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913934304] [2024-10-24 20:11:02,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:02,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:11:02,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:02,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:11:02,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:11:02,399 INFO L87 Difference]: Start difference. First operand 217 states and 234 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:11:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:02,530 INFO L93 Difference]: Finished difference Result 366 states and 398 transitions. [2024-10-24 20:11:02,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:11:02,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-24 20:11:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:02,533 INFO L225 Difference]: With dead ends: 366 [2024-10-24 20:11:02,535 INFO L226 Difference]: Without dead ends: 363 [2024-10-24 20:11:02,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:11:02,536 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 139 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:02,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 358 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:11:02,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-24 20:11:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 289. [2024-10-24 20:11:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 205 states have (on average 1.6780487804878048) internal successors, (344), 278 states have internal predecessors, (344), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 20:11:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 360 transitions. [2024-10-24 20:11:02,554 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 360 transitions. Word has length 32 [2024-10-24 20:11:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:02,555 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 360 transitions. [2024-10-24 20:11:02,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:11:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 360 transitions. [2024-10-24 20:11:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 20:11:02,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:02,556 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 20:11:02,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 20:11:02,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:11:02,760 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:02,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:02,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1619256643, now seen corresponding path program 1 times [2024-10-24 20:11:02,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:02,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793590848] [2024-10-24 20:11:02,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:02,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:02,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:11:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:02,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:11:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 20:11:02,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:02,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793590848] [2024-10-24 20:11:02,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793590848] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:11:02,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084499089] [2024-10-24 20:11:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:02,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:11:02,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:11:02,851 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:11:02,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 20:11:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:02,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 20:11:02,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:11:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 20:11:03,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:11:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 20:11:03,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084499089] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 20:11:03,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 20:11:03,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-24 20:11:03,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494907780] [2024-10-24 20:11:03,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 20:11:03,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 20:11:03,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:03,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 20:11:03,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-24 20:11:03,246 INFO L87 Difference]: Start difference. First operand 289 states and 360 transitions. Second operand has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 20:11:03,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:03,649 INFO L93 Difference]: Finished difference Result 406 states and 434 transitions. [2024-10-24 20:11:03,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 20:11:03,649 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2024-10-24 20:11:03,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:03,651 INFO L225 Difference]: With dead ends: 406 [2024-10-24 20:11:03,651 INFO L226 Difference]: Without dead ends: 403 [2024-10-24 20:11:03,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-10-24 20:11:03,652 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 578 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:03,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1655 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 20:11:03,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-24 20:11:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 295. [2024-10-24 20:11:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 211 states have (on average 1.6587677725118484) internal successors, (350), 284 states have internal predecessors, (350), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 20:11:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 366 transitions. [2024-10-24 20:11:03,666 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 366 transitions. Word has length 33 [2024-10-24 20:11:03,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:03,667 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 366 transitions. [2024-10-24 20:11:03,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 20:11:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 366 transitions. [2024-10-24 20:11:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 20:11:03,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:03,668 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 20:11:03,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 20:11:03,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 20:11:03,872 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:03,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1327475525, now seen corresponding path program 1 times [2024-10-24 20:11:03,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:03,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555889028] [2024-10-24 20:11:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:03,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:11:03,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206013308] [2024-10-24 20:11:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:03,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:11:03,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:11:03,890 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:11:03,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 20:11:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:03,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 20:11:03,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:11:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 20:11:04,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:11:04,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:04,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555889028] [2024-10-24 20:11:04,190 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:11:04,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206013308] [2024-10-24 20:11:04,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206013308] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:11:04,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 20:11:04,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-24 20:11:04,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207389648] [2024-10-24 20:11:04,191 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 20:11:04,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 20:11:04,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:04,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 20:11:04,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 20:11:04,192 INFO L87 Difference]: Start difference. First operand 295 states and 366 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:11:06,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:06,888 INFO L93 Difference]: Finished difference Result 475 states and 580 transitions. [2024-10-24 20:11:06,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 20:11:06,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-10-24 20:11:06,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:06,890 INFO L225 Difference]: With dead ends: 475 [2024-10-24 20:11:06,891 INFO L226 Difference]: Without dead ends: 448 [2024-10-24 20:11:06,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 20:11:06,891 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 428 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:06,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 511 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 20:11:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-24 20:11:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 414. [2024-10-24 20:11:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 327 states have (on average 1.5688073394495412) internal successors, (513), 400 states have internal predecessors, (513), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 20:11:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 535 transitions. [2024-10-24 20:11:06,916 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 535 transitions. Word has length 35 [2024-10-24 20:11:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:06,916 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 535 transitions. [2024-10-24 20:11:06,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 20:11:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 535 transitions. [2024-10-24 20:11:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 20:11:06,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:06,917 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 20:11:06,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-24 20:11:07,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:11:07,119 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:07,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:07,119 INFO L85 PathProgramCache]: Analyzing trace with hash 98695495, now seen corresponding path program 1 times [2024-10-24 20:11:07,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:07,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055495349] [2024-10-24 20:11:07,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:07,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 20:11:07,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467915049] [2024-10-24 20:11:07,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:07,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:11:07,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:11:07,138 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:11:07,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 20:11:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:07,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 20:11:07,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:11:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:11:07,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 20:11:07,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:07,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055495349] [2024-10-24 20:11:07,203 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 20:11:07,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467915049] [2024-10-24 20:11:07,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467915049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:07,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:11:07,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 20:11:07,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967787746] [2024-10-24 20:11:07,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:07,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 20:11:07,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:07,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 20:11:07,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:11:07,205 INFO L87 Difference]: Start difference. First operand 414 states and 535 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:11:07,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:07,358 INFO L93 Difference]: Finished difference Result 606 states and 768 transitions. [2024-10-24 20:11:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 20:11:07,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-10-24 20:11:07,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:07,361 INFO L225 Difference]: With dead ends: 606 [2024-10-24 20:11:07,361 INFO L226 Difference]: Without dead ends: 565 [2024-10-24 20:11:07,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 20:11:07,362 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 117 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:07,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 260 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 20:11:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-24 20:11:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 532. [2024-10-24 20:11:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 442 states have (on average 1.5158371040723981) internal successors, (670), 515 states have internal predecessors, (670), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 20:11:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 698 transitions. [2024-10-24 20:11:07,380 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 698 transitions. Word has length 37 [2024-10-24 20:11:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:07,380 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 698 transitions. [2024-10-24 20:11:07,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 20:11:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 698 transitions. [2024-10-24 20:11:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 20:11:07,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:07,381 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 20:11:07,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 20:11:07,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:11:07,582 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:07,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:07,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1705268062, now seen corresponding path program 1 times [2024-10-24 20:11:07,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:07,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757901287] [2024-10-24 20:11:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:07,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:07,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:11:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:07,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:11:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:07,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 20:11:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:11:07,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:07,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757901287] [2024-10-24 20:11:07,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757901287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:07,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:11:07,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 20:11:07,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592956250] [2024-10-24 20:11:07,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:07,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 20:11:07,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:07,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 20:11:07,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 20:11:07,683 INFO L87 Difference]: Start difference. First operand 532 states and 698 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:11:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:07,761 INFO L93 Difference]: Finished difference Result 1075 states and 1408 transitions. [2024-10-24 20:11:07,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 20:11:07,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 55 [2024-10-24 20:11:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:07,763 INFO L225 Difference]: With dead ends: 1075 [2024-10-24 20:11:07,764 INFO L226 Difference]: Without dead ends: 567 [2024-10-24 20:11:07,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:11:07,765 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 21 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:07,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 931 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:11:07,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-10-24 20:11:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 561. [2024-10-24 20:11:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 469 states have (on average 1.488272921108742) internal successors, (698), 542 states have internal predecessors, (698), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 20:11:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 728 transitions. [2024-10-24 20:11:07,787 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 728 transitions. Word has length 55 [2024-10-24 20:11:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:07,788 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 728 transitions. [2024-10-24 20:11:07,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:11:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 728 transitions. [2024-10-24 20:11:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 20:11:07,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:07,789 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 20:11:07,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 20:11:07,789 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:07,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1323702497, now seen corresponding path program 1 times [2024-10-24 20:11:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:07,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753695471] [2024-10-24 20:11:07,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:07,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:07,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:11:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:07,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:11:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:07,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 20:11:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:11:07,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:07,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753695471] [2024-10-24 20:11:07,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753695471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:07,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:11:07,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 20:11:07,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195417521] [2024-10-24 20:11:07,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:07,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 20:11:07,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:07,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 20:11:07,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 20:11:07,863 INFO L87 Difference]: Start difference. First operand 561 states and 728 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:11:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:07,927 INFO L93 Difference]: Finished difference Result 562 states and 728 transitions. [2024-10-24 20:11:07,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 20:11:07,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2024-10-24 20:11:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:07,930 INFO L225 Difference]: With dead ends: 562 [2024-10-24 20:11:07,930 INFO L226 Difference]: Without dead ends: 561 [2024-10-24 20:11:07,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:11:07,931 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 15 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:07,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 920 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:11:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-10-24 20:11:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2024-10-24 20:11:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 469 states have (on average 1.4861407249466951) internal successors, (697), 542 states have internal predecessors, (697), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 20:11:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 727 transitions. [2024-10-24 20:11:07,954 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 727 transitions. Word has length 56 [2024-10-24 20:11:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:07,955 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 727 transitions. [2024-10-24 20:11:07,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:11:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 727 transitions. [2024-10-24 20:11:07,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 20:11:07,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:07,956 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 20:11:07,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 20:11:07,956 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:07,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:07,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1968492765, now seen corresponding path program 1 times [2024-10-24 20:11:07,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:07,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253195348] [2024-10-24 20:11:07,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:07,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:11:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:11:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 20:11:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:11:08,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:08,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253195348] [2024-10-24 20:11:08,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253195348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:08,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:11:08,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 20:11:08,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708475812] [2024-10-24 20:11:08,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:08,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:11:08,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:08,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:11:08,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:11:08,009 INFO L87 Difference]: Start difference. First operand 561 states and 727 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 20:11:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:08,067 INFO L93 Difference]: Finished difference Result 1103 states and 1452 transitions. [2024-10-24 20:11:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:11:08,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 59 [2024-10-24 20:11:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:08,070 INFO L225 Difference]: With dead ends: 1103 [2024-10-24 20:11:08,070 INFO L226 Difference]: Without dead ends: 595 [2024-10-24 20:11:08,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 20:11:08,071 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 10 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:08,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 775 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:11:08,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-10-24 20:11:08,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 577. [2024-10-24 20:11:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 485 states have (on average 1.468041237113402) internal successors, (712), 558 states have internal predecessors, (712), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 20:11:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 742 transitions. [2024-10-24 20:11:08,090 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 742 transitions. Word has length 59 [2024-10-24 20:11:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:08,090 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 742 transitions. [2024-10-24 20:11:08,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 20:11:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 742 transitions. [2024-10-24 20:11:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 20:11:08,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:08,091 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 20:11:08,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 20:11:08,091 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:08,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:08,091 INFO L85 PathProgramCache]: Analyzing trace with hash -893733378, now seen corresponding path program 1 times [2024-10-24 20:11:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:08,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314245115] [2024-10-24 20:11:08,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:11:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:11:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 20:11:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:11:08,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314245115] [2024-10-24 20:11:08,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314245115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:08,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:11:08,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 20:11:08,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470642183] [2024-10-24 20:11:08,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:08,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 20:11:08,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:08,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 20:11:08,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 20:11:08,177 INFO L87 Difference]: Start difference. First operand 577 states and 742 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:11:08,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:08,251 INFO L93 Difference]: Finished difference Result 582 states and 747 transitions. [2024-10-24 20:11:08,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 20:11:08,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-24 20:11:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:08,253 INFO L225 Difference]: With dead ends: 582 [2024-10-24 20:11:08,253 INFO L226 Difference]: Without dead ends: 581 [2024-10-24 20:11:08,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 20:11:08,254 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 23 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:08,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1093 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:11:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-10-24 20:11:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 580. [2024-10-24 20:11:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 488 states have (on average 1.4651639344262295) internal successors, (715), 561 states have internal predecessors, (715), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 20:11:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 745 transitions. [2024-10-24 20:11:08,271 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 745 transitions. Word has length 60 [2024-10-24 20:11:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:08,272 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 745 transitions. [2024-10-24 20:11:08,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 20:11:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 745 transitions. [2024-10-24 20:11:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 20:11:08,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:08,272 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 20:11:08,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 20:11:08,273 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:08,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:08,273 INFO L85 PathProgramCache]: Analyzing trace with hash -708605592, now seen corresponding path program 1 times [2024-10-24 20:11:08,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:08,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205683367] [2024-10-24 20:11:08,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:08,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:11:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:11:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 20:11:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:11:08,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:08,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205683367] [2024-10-24 20:11:08,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205683367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 20:11:08,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 20:11:08,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 20:11:08,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869301846] [2024-10-24 20:11:08,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 20:11:08,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 20:11:08,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:08,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 20:11:08,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 20:11:08,313 INFO L87 Difference]: Start difference. First operand 580 states and 745 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 20:11:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:08,340 INFO L93 Difference]: Finished difference Result 586 states and 752 transitions. [2024-10-24 20:11:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 20:11:08,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 63 [2024-10-24 20:11:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:08,341 INFO L225 Difference]: With dead ends: 586 [2024-10-24 20:11:08,341 INFO L226 Difference]: Without dead ends: 61 [2024-10-24 20:11:08,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 20:11:08,341 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 5 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:08,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 207 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:11:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-24 20:11:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-24 20:11:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 55 states have (on average 1.0) internal successors, (55), 55 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 20:11:08,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2024-10-24 20:11:08,345 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 63 [2024-10-24 20:11:08,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:08,346 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2024-10-24 20:11:08,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 20:11:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2024-10-24 20:11:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 20:11:08,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 20:11:08,346 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 20:11:08,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 20:11:08,347 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-24 20:11:08,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 20:11:08,347 INFO L85 PathProgramCache]: Analyzing trace with hash -491936801, now seen corresponding path program 1 times [2024-10-24 20:11:08,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 20:11:08,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639768731] [2024-10-24 20:11:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 20:11:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 20:11:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 20:11:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 20:11:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:11:08,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 20:11:08,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639768731] [2024-10-24 20:11:08,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639768731] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 20:11:08,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623291609] [2024-10-24 20:11:08,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 20:11:08,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 20:11:08,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 20:11:08,438 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 20:11:08,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 20:11:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 20:11:08,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 20:11:08,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 20:11:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:11:08,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 20:11:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 20:11:08,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623291609] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 20:11:08,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 20:11:08,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 20 [2024-10-24 20:11:08,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125236842] [2024-10-24 20:11:08,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 20:11:08,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 20:11:08,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 20:11:08,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 20:11:08,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-10-24 20:11:08,652 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 21 states, 20 states have (on average 6.45) internal successors, (129), 21 states have internal predecessors, (129), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-24 20:11:08,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 20:11:08,724 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2024-10-24 20:11:08,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 20:11:08,724 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.45) internal successors, (129), 21 states have internal predecessors, (129), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 64 [2024-10-24 20:11:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 20:11:08,724 INFO L225 Difference]: With dead ends: 61 [2024-10-24 20:11:08,724 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 20:11:08,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2024-10-24 20:11:08,725 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 29 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 20:11:08,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 292 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 20:11:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 20:11:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 20:11:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 20:11:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 20:11:08,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2024-10-24 20:11:08,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 20:11:08,726 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 20:11:08,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.45) internal successors, (129), 21 states have internal predecessors, (129), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-24 20:11:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 20:11:08,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 20:11:08,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 98 remaining) [2024-10-24 20:11:08,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 98 remaining) [2024-10-24 20:11:08,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 98 remaining) [2024-10-24 20:11:08,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 98 remaining) [2024-10-24 20:11:08,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 98 remaining) [2024-10-24 20:11:08,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 98 remaining) [2024-10-24 20:11:08,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 98 remaining) [2024-10-24 20:11:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 98 remaining) [2024-10-24 20:11:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 98 remaining) [2024-10-24 20:11:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 98 remaining) [2024-10-24 20:11:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 98 remaining) [2024-10-24 20:11:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 98 remaining) [2024-10-24 20:11:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 98 remaining) [2024-10-24 20:11:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 98 remaining) [2024-10-24 20:11:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 98 remaining) [2024-10-24 20:11:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 98 remaining) [2024-10-24 20:11:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 98 remaining) [2024-10-24 20:11:08,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 98 remaining) [2024-10-24 20:11:08,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 98 remaining) [2024-10-24 20:11:08,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 98 remaining) [2024-10-24 20:11:08,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 98 remaining) [2024-10-24 20:11:08,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 98 remaining) [2024-10-24 20:11:08,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 98 remaining) [2024-10-24 20:11:08,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 98 remaining) [2024-10-24 20:11:08,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 98 remaining) [2024-10-24 20:11:08,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 98 remaining) [2024-10-24 20:11:08,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 98 remaining) [2024-10-24 20:11:08,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 98 remaining) [2024-10-24 20:11:08,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 98 remaining) [2024-10-24 20:11:08,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 98 remaining) [2024-10-24 20:11:08,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 98 remaining) [2024-10-24 20:11:08,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 98 remaining) [2024-10-24 20:11:08,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 98 remaining) [2024-10-24 20:11:08,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 98 remaining) [2024-10-24 20:11:08,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 98 remaining) [2024-10-24 20:11:08,732 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 98 remaining) [2024-10-24 20:11:08,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 98 remaining) [2024-10-24 20:11:08,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 98 remaining) [2024-10-24 20:11:08,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 98 remaining) [2024-10-24 20:11:08,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 98 remaining) [2024-10-24 20:11:08,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 98 remaining) [2024-10-24 20:11:08,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 98 remaining) [2024-10-24 20:11:08,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 98 remaining) [2024-10-24 20:11:08,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 98 remaining) [2024-10-24 20:11:08,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 98 remaining) [2024-10-24 20:11:08,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 98 remaining) [2024-10-24 20:11:08,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 98 remaining) [2024-10-24 20:11:08,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 98 remaining) [2024-10-24 20:11:08,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 98 remaining) [2024-10-24 20:11:08,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 98 remaining) [2024-10-24 20:11:08,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 98 remaining) [2024-10-24 20:11:08,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 98 remaining) [2024-10-24 20:11:08,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 98 remaining) [2024-10-24 20:11:08,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 98 remaining) [2024-10-24 20:11:08,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 98 remaining) [2024-10-24 20:11:08,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 98 remaining) [2024-10-24 20:11:08,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 98 remaining) [2024-10-24 20:11:08,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 98 remaining) [2024-10-24 20:11:08,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 98 remaining) [2024-10-24 20:11:08,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 98 remaining) [2024-10-24 20:11:08,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 98 remaining) [2024-10-24 20:11:08,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 98 remaining) [2024-10-24 20:11:08,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 98 remaining) [2024-10-24 20:11:08,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 98 remaining) [2024-10-24 20:11:08,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 98 remaining) [2024-10-24 20:11:08,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 98 remaining) [2024-10-24 20:11:08,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 98 remaining) [2024-10-24 20:11:08,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 98 remaining) [2024-10-24 20:11:08,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 98 remaining) [2024-10-24 20:11:08,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 98 remaining) [2024-10-24 20:11:08,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 98 remaining) [2024-10-24 20:11:08,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 98 remaining) [2024-10-24 20:11:08,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 98 remaining) [2024-10-24 20:11:08,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 98 remaining) [2024-10-24 20:11:08,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 98 remaining) [2024-10-24 20:11:08,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 98 remaining) [2024-10-24 20:11:08,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 98 remaining) [2024-10-24 20:11:08,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 98 remaining) [2024-10-24 20:11:08,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 98 remaining) [2024-10-24 20:11:08,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 98 remaining) [2024-10-24 20:11:08,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 98 remaining) [2024-10-24 20:11:08,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 98 remaining) [2024-10-24 20:11:08,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 98 remaining) [2024-10-24 20:11:08,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-24 20:11:08,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-24 20:11:08,945 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 20:11:08,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 20:11:09,607 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 20:11:09,618 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 20:11:09,619 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 20:11:09,619 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 20:11:09,619 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 20:11:09,622 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 20:11:09,622 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 20:11:09,623 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 20:11:09,623 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 20:11:09,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:11:09 BoogieIcfgContainer [2024-10-24 20:11:09,631 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 20:11:09,631 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 20:11:09,631 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 20:11:09,631 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 20:11:09,632 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:10:59" (3/4) ... [2024-10-24 20:11:09,633 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 20:11:09,636 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 20:11:09,636 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-24 20:11:09,640 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-24 20:11:09,641 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-24 20:11:09,641 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 20:11:09,641 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 20:11:09,727 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 20:11:09,728 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 20:11:09,728 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 20:11:09,728 INFO L158 Benchmark]: Toolchain (without parser) took 10660.24ms. Allocated memory was 209.7MB in the beginning and 287.3MB in the end (delta: 77.6MB). Free memory was 142.4MB in the beginning and 250.5MB in the end (delta: -108.1MB). Peak memory consumption was 135.2MB. Max. memory is 16.1GB. [2024-10-24 20:11:09,729 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 109.1MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:11:09,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.16ms. Allocated memory is still 209.7MB. Free memory was 142.2MB in the beginning and 129.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 20:11:09,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.19ms. Allocated memory is still 209.7MB. Free memory was 129.3MB in the beginning and 127.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 20:11:09,729 INFO L158 Benchmark]: Boogie Preprocessor took 38.76ms. Allocated memory is still 209.7MB. Free memory was 127.0MB in the beginning and 125.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 20:11:09,729 INFO L158 Benchmark]: RCFGBuilder took 580.45ms. Allocated memory is still 209.7MB. Free memory was 125.2MB in the beginning and 152.7MB in the end (delta: -27.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 20:11:09,730 INFO L158 Benchmark]: TraceAbstraction took 9685.75ms. Allocated memory was 209.7MB in the beginning and 287.3MB in the end (delta: 77.6MB). Free memory was 151.4MB in the beginning and 90.0MB in the end (delta: 61.4MB). Peak memory consumption was 139.8MB. Max. memory is 16.1GB. [2024-10-24 20:11:09,730 INFO L158 Benchmark]: Witness Printer took 96.83ms. Allocated memory is still 287.3MB. Free memory was 89.0MB in the beginning and 250.5MB in the end (delta: -161.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 20:11:09,731 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.11ms. Allocated memory is still 109.1MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.16ms. Allocated memory is still 209.7MB. Free memory was 142.2MB in the beginning and 129.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.19ms. Allocated memory is still 209.7MB. Free memory was 129.3MB in the beginning and 127.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.76ms. Allocated memory is still 209.7MB. Free memory was 127.0MB in the beginning and 125.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 580.45ms. Allocated memory is still 209.7MB. Free memory was 125.2MB in the beginning and 152.7MB in the end (delta: -27.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9685.75ms. Allocated memory was 209.7MB in the beginning and 287.3MB in the end (delta: 77.6MB). Free memory was 151.4MB in the beginning and 90.0MB in the end (delta: 61.4MB). Peak memory consumption was 139.8MB. Max. memory is 16.1GB. * Witness Printer took 96.83ms. Allocated memory is still 287.3MB. Free memory was 89.0MB in the beginning and 250.5MB in the end (delta: -161.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 222 locations, 98 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2055 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2022 mSDsluCounter, 10270 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7285 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2194 IncrementalHoareTripleChecker+Invalid, 2301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 2985 mSDtfsCounter, 2194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=580occurred in iteration=16, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 342 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 839 ConstructedInterpolants, 15 QuantifiedInterpolants, 2924 SizeOfPredicates, 9 NumberOfNonLiveVariables, 585 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 67/91 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 - AllSpecificationsHoldResult: All specifications hold 98 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((2 <= counter) && (((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && (counter <= 3)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (A <= 2147483647)) || ((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (counter == 0)) && (A <= 2147483647))) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (A <= 2147483647)) && (counter == 1)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (A <= 2147483647)) && (counter == 2)) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (((cond != 0) && (counter == 0)) && (counter == \old(counter))) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-10-24 20:11:09,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE