./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/dijkstra-u_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 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/dijkstra-u_unwindbound10.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 26517bdd67184dea6352cf50b6d9992d41ecfd853675bfc685354b90b7b5bf40 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:36:06,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:36:06,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:36:06,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:36:06,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:36:06,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:36:06,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:36:06,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:36:06,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:36:06,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:36:06,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:36:06,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:36:06,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:36:06,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:36:06,533 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:36:06,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:36:06,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:36:06,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:36:06,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:36:06,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:36:06,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:36:06,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:36:06,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:36:06,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:36:06,539 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:36:06,539 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:36:06,539 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:36:06,539 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:36:06,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:36:06,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:36:06,540 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:36:06,540 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:36:06,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:36:06,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:36:06,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:36:06,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:36:06,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:36:06,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:36:06,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:36:06,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:36:06,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:36:06,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:36:06,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:36:06,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:36:06,545 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 -> 26517bdd67184dea6352cf50b6d9992d41ecfd853675bfc685354b90b7b5bf40 [2024-10-14 20:36:06,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:36:06,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:36:06,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:36:06,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:36:06,829 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:36:06,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2024-10-14 20:36:08,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:36:08,524 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:36:08,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2024-10-14 20:36:08,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ca5833a/171deb40df5b446db8d152801c4ab200/FLAG842560c65 [2024-10-14 20:36:08,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ca5833a/171deb40df5b446db8d152801c4ab200 [2024-10-14 20:36:08,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:36:08,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:36:08,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:36:08,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:36:08,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:36:08,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:36:08" (1/1) ... [2024-10-14 20:36:08,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664d377d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:08, skipping insertion in model container [2024-10-14 20:36:08,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:36:08" (1/1) ... [2024-10-14 20:36:08,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:36:09,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:36:09,114 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:36:09,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:36:09,161 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:36:09,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:09 WrapperNode [2024-10-14 20:36:09,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:36:09,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:36:09,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:36:09,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:36:09,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:09" (1/1) ... [2024-10-14 20:36:09,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:09" (1/1) ... [2024-10-14 20:36:09,219 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-10-14 20:36:09,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:36:09,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:36:09,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:36:09,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:36:09,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:09" (1/1) ... [2024-10-14 20:36:09,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:09" (1/1) ... [2024-10-14 20:36:09,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:09" (1/1) ... [2024-10-14 20:36:09,258 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-14 20:36:09,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:09" (1/1) ... [2024-10-14 20:36:09,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:09" (1/1) ... [2024-10-14 20:36:09,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:09" (1/1) ... [2024-10-14 20:36:09,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:09" (1/1) ... [2024-10-14 20:36:09,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:09" (1/1) ... [2024-10-14 20:36:09,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:09" (1/1) ... [2024-10-14 20:36:09,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:36:09,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:36:09,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:36:09,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:36:09,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:09" (1/1) ... [2024-10-14 20:36:09,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:36:09,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:09,315 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-14 20:36:09,318 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-14 20:36:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:36:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:36:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:36:09,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:36:09,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:36:09,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:36:09,426 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:36:09,428 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:36:09,683 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-14 20:36:09,683 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:36:09,723 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:36:09,723 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 20:36:09,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:36:09 BoogieIcfgContainer [2024-10-14 20:36:09,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:36:09,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:36:09,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:36:09,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:36:09,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:36:08" (1/3) ... [2024-10-14 20:36:09,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b58756a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:36:09, skipping insertion in model container [2024-10-14 20:36:09,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:36:09" (2/3) ... [2024-10-14 20:36:09,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b58756a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:36:09, skipping insertion in model container [2024-10-14 20:36:09,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:36:09" (3/3) ... [2024-10-14 20:36:09,738 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound10.c [2024-10-14 20:36:09,754 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:36:09,754 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 20:36:09,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:36:09,822 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;@76cb0768, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:36:09,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 20:36:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 20:36:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 20:36:09,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:09,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 20:36:09,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:09,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:09,839 INFO L85 PathProgramCache]: Analyzing trace with hash 123909867, now seen corresponding path program 1 times [2024-10-14 20:36:09,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:09,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941391929] [2024-10-14 20:36:09,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:09,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:09,970 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-14 20:36:09,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:09,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941391929] [2024-10-14 20:36:09,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941391929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:09,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:36:09,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:36:09,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926299187] [2024-10-14 20:36:09,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:09,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 20:36:09,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:10,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 20:36:10,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:36:10,009 INFO L87 Difference]: Start difference. First operand has 33 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:10,046 INFO L93 Difference]: Finished difference Result 64 states and 104 transitions. [2024-10-14 20:36:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 20:36:10,049 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 20:36:10,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:10,056 INFO L225 Difference]: With dead ends: 64 [2024-10-14 20:36:10,056 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 20:36:10,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:36:10,078 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:10,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 20:36:10,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 20:36:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:36:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-14 20:36:10,127 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 5 [2024-10-14 20:36:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:10,127 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-14 20:36:10,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-14 20:36:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 20:36:10,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:10,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 20:36:10,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:36:10,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:10,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:10,130 INFO L85 PathProgramCache]: Analyzing trace with hash 123969449, now seen corresponding path program 1 times [2024-10-14 20:36:10,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:10,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639122756] [2024-10-14 20:36:10,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:10,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:10,247 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-14 20:36:10,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639122756] [2024-10-14 20:36:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639122756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:10,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:36:10,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:36:10,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173313335] [2024-10-14 20:36:10,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:10,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:36:10,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:10,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:36:10,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:36:10,251 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:10,318 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2024-10-14 20:36:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:36:10,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 20:36:10,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:10,321 INFO L225 Difference]: With dead ends: 52 [2024-10-14 20:36:10,321 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 20:36:10,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-14 20:36:10,324 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:10,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 87 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:10,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 20:36:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-14 20:36:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:36:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-14 20:36:10,333 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 5 [2024-10-14 20:36:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:10,334 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-14 20:36:10,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-14 20:36:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:36:10,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:10,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:10,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:36:10,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:10,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:10,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1809310676, now seen corresponding path program 1 times [2024-10-14 20:36:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196241301] [2024-10-14 20:36:10,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:10,511 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-14 20:36:10,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:10,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196241301] [2024-10-14 20:36:10,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196241301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:10,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:36:10,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:36:10,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960571731] [2024-10-14 20:36:10,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:10,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:36:10,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:10,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:36:10,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:36:10,515 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-14 20:36:10,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:10,727 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-10-14 20:36:10,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:36:10,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2024-10-14 20:36:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:10,729 INFO L225 Difference]: With dead ends: 56 [2024-10-14 20:36:10,730 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 20:36:10,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:36:10,731 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:10,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 121 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:36:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 20:36:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-10-14 20:36:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-10-14 20:36:10,743 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 10 [2024-10-14 20:36:10,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:10,744 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-10-14 20:36:10,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-14 20:36:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-10-14 20:36:10,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 20:36:10,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:10,745 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:10,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:36:10,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:10,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:10,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1809309426, now seen corresponding path program 1 times [2024-10-14 20:36:10,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:10,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445014362] [2024-10-14 20:36:10,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:10,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:10,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:10,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445014362] [2024-10-14 20:36:10,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445014362] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:10,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628292904] [2024-10-14 20:36:10,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:10,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:10,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:10,881 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-14 20:36:10,883 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-14 20:36:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:10,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:36:10,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:11,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:36:11,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628292904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:11,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:36:11,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-14 20:36:11,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559398282] [2024-10-14 20:36:11,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:11,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:36:11,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:11,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:36:11,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:36:11,032 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-14 20:36:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:11,078 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2024-10-14 20:36:11,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:36:11,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2024-10-14 20:36:11,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:11,082 INFO L225 Difference]: With dead ends: 57 [2024-10-14 20:36:11,082 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 20:36:11,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 20:36:11,084 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 103 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-14 20:36:11,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 20:36:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2024-10-14 20:36:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-10-14 20:36:11,101 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 10 [2024-10-14 20:36:11,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:11,102 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-10-14 20:36:11,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-14 20:36:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-10-14 20:36:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 20:36:11,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:11,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:11,118 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-14 20:36:11,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:11,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:11,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:11,304 INFO L85 PathProgramCache]: Analyzing trace with hash -254056039, now seen corresponding path program 1 times [2024-10-14 20:36:11,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:11,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603773810] [2024-10-14 20:36:11,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:11,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:11,397 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-14 20:36:11,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:11,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603773810] [2024-10-14 20:36:11,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603773810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:11,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:36:11,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:36:11,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487927487] [2024-10-14 20:36:11,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:11,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:36:11,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:11,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:36:11,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:36:11,403 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-14 20:36:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:11,463 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-10-14 20:36:11,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 20:36:11,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2024-10-14 20:36:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:11,464 INFO L225 Difference]: With dead ends: 57 [2024-10-14 20:36:11,465 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 20:36:11,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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-14 20:36:11,466 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:11,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 109 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 20:36:11,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-10-14 20:36:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 36 states have internal predecessors, (43), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2024-10-14 20:36:11,474 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 11 [2024-10-14 20:36:11,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:11,475 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2024-10-14 20:36:11,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-14 20:36:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2024-10-14 20:36:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 20:36:11,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:11,476 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:11,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:36:11,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:11,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:11,477 INFO L85 PathProgramCache]: Analyzing trace with hash -254017310, now seen corresponding path program 1 times [2024-10-14 20:36:11,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:11,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721585104] [2024-10-14 20:36:11,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:11,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:11,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:11,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721585104] [2024-10-14 20:36:11,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721585104] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:11,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651141116] [2024-10-14 20:36:11,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:11,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:11,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:11,545 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-14 20:36:11,546 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-14 20:36:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:11,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:36:11,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:11,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:36:11,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651141116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:11,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:36:11,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-14 20:36:11,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933244975] [2024-10-14 20:36:11,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:11,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:36:11,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:11,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:36:11,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 20:36:11,625 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-14 20:36:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:11,667 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2024-10-14 20:36:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:36:11,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2024-10-14 20:36:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:11,669 INFO L225 Difference]: With dead ends: 56 [2024-10-14 20:36:11,669 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 20:36:11,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 20:36:11,670 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 108 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-14 20:36:11,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 108 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:36:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 20:36:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-10-14 20:36:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-10-14 20:36:11,679 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 11 [2024-10-14 20:36:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:11,679 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-10-14 20:36:11,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-14 20:36:11,680 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-10-14 20:36:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:36:11,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:11,680 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:11,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 20:36:11,884 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,SelfDestructingSolverStorable5 [2024-10-14 20:36:11,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:11,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:11,885 INFO L85 PathProgramCache]: Analyzing trace with hash 302744435, now seen corresponding path program 1 times [2024-10-14 20:36:11,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:11,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718265839] [2024-10-14 20:36:11,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:11,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718265839] [2024-10-14 20:36:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718265839] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683341256] [2024-10-14 20:36:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:11,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:11,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:11,972 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-14 20:36:11,974 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-14 20:36:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:12,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 20:36:12,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:12,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:36:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:12,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683341256] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:36:12,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:36:12,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-10-14 20:36:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676671527] [2024-10-14 20:36:12,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:36:12,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 20:36:12,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:12,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 20:36:12,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-14 20:36:12,183 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 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-14 20:36:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:12,315 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2024-10-14 20:36:12,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 20:36:12,316 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 20:36:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:12,317 INFO L225 Difference]: With dead ends: 92 [2024-10-14 20:36:12,317 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 20:36:12,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-10-14 20:36:12,320 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:12,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:36:12,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 20:36:12,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2024-10-14 20:36:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 49 states have internal predecessors, (58), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 20:36:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2024-10-14 20:36:12,339 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 14 [2024-10-14 20:36:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:12,339 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2024-10-14 20:36:12,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 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-14 20:36:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2024-10-14 20:36:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:36:12,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:12,341 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:12,358 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-14 20:36:12,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:12,541 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:12,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash 795193831, now seen corresponding path program 1 times [2024-10-14 20:36:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:12,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045095900] [2024-10-14 20:36:12,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:12,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:12,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045095900] [2024-10-14 20:36:12,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045095900] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:12,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921714404] [2024-10-14 20:36:12,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:12,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:12,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:12,662 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-14 20:36:12,664 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-14 20:36:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:12,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:36:12,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:12,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:36:12,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921714404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:12,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:36:12,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2024-10-14 20:36:12,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2727844] [2024-10-14 20:36:12,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:12,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:36:12,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:12,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:36:12,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-14 20:36:12,770 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:12,849 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2024-10-14 20:36:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:36:12,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 20:36:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:12,850 INFO L225 Difference]: With dead ends: 64 [2024-10-14 20:36:12,851 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 20:36:12,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-14 20:36:12,851 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:12,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 66 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:36:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 20:36:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2024-10-14 20:36:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 20:36:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-10-14 20:36:12,859 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 15 [2024-10-14 20:36:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:12,859 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-10-14 20:36:12,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:36:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-10-14 20:36:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 20:36:12,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:12,860 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:12,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 20:36:13,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:13,061 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:13,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:13,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1118794946, now seen corresponding path program 1 times [2024-10-14 20:36:13,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:13,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215926803] [2024-10-14 20:36:13,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:13,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:13,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:13,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215926803] [2024-10-14 20:36:13,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215926803] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:13,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604674198] [2024-10-14 20:36:13,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:13,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:13,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:13,146 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-14 20:36:13,147 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-14 20:36:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:13,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:36:13,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:13,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:36:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:36:13,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604674198] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:36:13,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:36:13,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2024-10-14 20:36:13,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334950758] [2024-10-14 20:36:13,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:36:13,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 20:36:13,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:13,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 20:36:13,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-10-14 20:36:13,326 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 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-14 20:36:14,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 20:36:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:15,015 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2024-10-14 20:36:15,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 20:36:15,016 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 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 16 [2024-10-14 20:36:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:15,017 INFO L225 Difference]: With dead ends: 86 [2024-10-14 20:36:15,017 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 20:36:15,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-10-14 20:36:15,018 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:15,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 237 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 20:36:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 20:36:15,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2024-10-14 20:36:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 20:36:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2024-10-14 20:36:15,042 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 16 [2024-10-14 20:36:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:15,043 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2024-10-14 20:36:15,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 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-14 20:36:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2024-10-14 20:36:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 20:36:15,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:15,047 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 20:36:15,065 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-14 20:36:15,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:15,248 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:15,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:15,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1351280755, now seen corresponding path program 1 times [2024-10-14 20:36:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:15,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037157767] [2024-10-14 20:36:15,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:15,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 20:36:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:15,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:36:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:15,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:36:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:15,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 20:36:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:15,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 20:36:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:15,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 20:36:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:15,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 20:36:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:15,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 20:36:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:15,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 20:36:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:15,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 20:36:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:15,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 20:36:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:15,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 20:36:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 20:36:15,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:15,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037157767] [2024-10-14 20:36:15,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037157767] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:15,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148610010] [2024-10-14 20:36:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:15,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:15,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:15,776 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-14 20:36:15,778 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-14 20:36:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:15,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 20:36:15,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 6 proven. 171 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-14 20:36:16,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:36:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 20:36:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148610010] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:36:16,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:36:16,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 36 [2024-10-14 20:36:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366725181] [2024-10-14 20:36:16,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:36:16,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-14 20:36:16,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:16,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-14 20:36:16,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 20:36:16,624 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-14 20:36:21,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 20:36:25,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 20:36:26,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 20:36:31,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 20:36:35,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 20:36:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:35,985 INFO L93 Difference]: Finished difference Result 236 states and 319 transitions. [2024-10-14 20:36:35,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-14 20:36:35,986 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) Word has length 93 [2024-10-14 20:36:35,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:35,988 INFO L225 Difference]: With dead ends: 236 [2024-10-14 20:36:35,988 INFO L226 Difference]: Without dead ends: 235 [2024-10-14 20:36:35,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1016, Invalid=3144, Unknown=0, NotChecked=0, Total=4160 [2024-10-14 20:36:35,991 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 264 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 60 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:35,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 299 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 352 Invalid, 4 Unknown, 0 Unchecked, 18.7s Time] [2024-10-14 20:36:35,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-14 20:36:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 175. [2024-10-14 20:36:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 111 states have (on average 1.135135135135135) internal successors, (126), 111 states have internal predecessors, (126), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 20:36:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 234 transitions. [2024-10-14 20:36:36,020 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 234 transitions. Word has length 93 [2024-10-14 20:36:36,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:36,021 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 234 transitions. [2024-10-14 20:36:36,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.861111111111111) internal successors, (103), 37 states have internal predecessors, (103), 6 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-14 20:36:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 234 transitions. [2024-10-14 20:36:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-14 20:36:36,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:36,030 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2024-10-14 20:36:36,049 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-14 20:36:36,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:36,231 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:36,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:36,232 INFO L85 PathProgramCache]: Analyzing trace with hash 958093722, now seen corresponding path program 2 times [2024-10-14 20:36:36,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:36,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548061857] [2024-10-14 20:36:36,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:36,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 20:36:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 20:36:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 20:36:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 20:36:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 20:36:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 20:36:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 20:36:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 20:36:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 20:36:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 20:36:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 20:36:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 20:36:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 20:36:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 20:36:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 20:36:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 20:36:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 20:36:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 20:36:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 20:36:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 20:36:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 20:36:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 20:36:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-14 20:36:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 20:36:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-14 20:36:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-14 20:36:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-14 20:36:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-14 20:36:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 20:36:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 20:36:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-14 20:36:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-14 20:36:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-14 20:36:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-10-14 20:36:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-14 20:36:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-14 20:36:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-14 20:36:37,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:37,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548061857] [2024-10-14 20:36:37,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548061857] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:37,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010561119] [2024-10-14 20:36:37,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:36:37,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:37,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:37,695 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-14 20:36:37,696 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-14 20:36:37,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:36:37,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:36:37,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 20:36:37,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 2388 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-10-14 20:36:38,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:36:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-14 20:36:39,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010561119] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:36:39,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:36:39,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 48 [2024-10-14 20:36:39,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126993060] [2024-10-14 20:36:39,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:36:39,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-14 20:36:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:39,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-14 20:36:39,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1847, Unknown=0, NotChecked=0, Total=2352 [2024-10-14 20:36:39,378 INFO L87 Difference]: Start difference. First operand 175 states and 234 transitions. Second operand has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) [2024-10-14 20:36:44,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 20:36:48,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 20:36:51,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 20:36:52,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 20:36:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:54,828 INFO L93 Difference]: Finished difference Result 592 states and 805 transitions. [2024-10-14 20:36:54,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-10-14 20:36:54,830 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) Word has length 242 [2024-10-14 20:36:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:54,839 INFO L225 Difference]: With dead ends: 592 [2024-10-14 20:36:54,839 INFO L226 Difference]: Without dead ends: 591 [2024-10-14 20:36:54,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2647 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2197, Invalid=7309, Unknown=0, NotChecked=0, Total=9506 [2024-10-14 20:36:54,844 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 440 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 84 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:54,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 287 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 414 Invalid, 2 Unknown, 0 Unchecked, 14.2s Time] [2024-10-14 20:36:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-14 20:36:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 276. [2024-10-14 20:36:54,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 177 states have (on average 1.1638418079096045) internal successors, (206), 177 states have internal predecessors, (206), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 20:36:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 374 transitions. [2024-10-14 20:36:54,896 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 374 transitions. Word has length 242 [2024-10-14 20:36:54,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:54,898 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 374 transitions. [2024-10-14 20:36:54,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.1666666666666665) internal successors, (152), 49 states have internal predecessors, (152), 12 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 12 states have call predecessors, (108), 12 states have call successors, (108) [2024-10-14 20:36:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 374 transitions. [2024-10-14 20:36:54,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-14 20:36:54,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:54,905 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2024-10-14 20:36:54,924 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-14 20:36:55,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:55,110 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:55,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:55,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1972813965, now seen corresponding path program 1 times [2024-10-14 20:36:55,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:55,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685375907] [2024-10-14 20:36:55,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:55,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:55,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 20:36:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:55,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 20:36:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:55,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 20:36:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:55,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 20:36:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:55,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 20:36:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:55,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 20:36:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:55,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 20:36:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:55,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 20:36:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:55,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 20:36:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:55,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 20:36:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 20:36:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 20:36:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 20:36:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 20:36:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 20:36:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 20:36:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 20:36:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-14 20:36:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-14 20:36:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 20:36:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 20:36:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 20:36:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 20:36:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-14 20:36:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-14 20:36:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-14 20:36:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-14 20:36:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-14 20:36:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-14 20:36:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-10-14 20:36:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-14 20:36:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-14 20:36:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-14 20:36:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-14 20:36:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-14 20:36:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-14 20:36:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-14 20:36:56,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685375907] [2024-10-14 20:36:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685375907] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:56,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72878190] [2024-10-14 20:36:56,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:56,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:56,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:56,085 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-14 20:36:56,086 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-14 20:36:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:56,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 20:36:56,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-14 20:36:56,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:36:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2890 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2024-10-14 20:36:57,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72878190] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:36:57,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:36:57,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 25 [2024-10-14 20:36:57,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727339809] [2024-10-14 20:36:57,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:36:57,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 20:36:57,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:57,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 20:36:57,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2024-10-14 20:36:57,032 INFO L87 Difference]: Start difference. First operand 276 states and 374 transitions. Second operand has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 20:36:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:57,566 INFO L93 Difference]: Finished difference Result 425 states and 568 transitions. [2024-10-14 20:36:57,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-14 20:36:57,566 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 266 [2024-10-14 20:36:57,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:57,568 INFO L225 Difference]: With dead ends: 425 [2024-10-14 20:36:57,569 INFO L226 Difference]: Without dead ends: 309 [2024-10-14 20:36:57,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 583 SyntacticMatches, 16 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=576, Invalid=1230, Unknown=0, NotChecked=0, Total=1806 [2024-10-14 20:36:57,571 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 173 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:57,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 157 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:36:57,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-14 20:36:57,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 285. [2024-10-14 20:36:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 186 states have (on average 1.1397849462365592) internal successors, (212), 186 states have internal predecessors, (212), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 20:36:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 380 transitions. [2024-10-14 20:36:57,599 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 380 transitions. Word has length 266 [2024-10-14 20:36:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:57,600 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 380 transitions. [2024-10-14 20:36:57,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 20:36:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 380 transitions. [2024-10-14 20:36:57,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-14 20:36:57,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:36:57,605 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 9, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2024-10-14 20:36:57,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 20:36:57,805 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,SelfDestructingSolverStorable11 [2024-10-14 20:36:57,806 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-14 20:36:57,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:36:57,806 INFO L85 PathProgramCache]: Analyzing trace with hash 279119509, now seen corresponding path program 3 times [2024-10-14 20:36:57,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:36:57,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749107704] [2024-10-14 20:36:57,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:36:57,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:36:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 20:36:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 20:36:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 20:36:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 20:36:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 20:36:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 20:36:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 20:36:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 20:36:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 20:36:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 20:36:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 20:36:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 20:36:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 20:36:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 20:36:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 20:36:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 20:36:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-14 20:36:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 20:36:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 20:36:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-14 20:36:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-14 20:36:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 20:36:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 20:36:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 20:36:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 20:36:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-14 20:36:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 20:36:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 20:36:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-10-14 20:36:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-14 20:36:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-14 20:36:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-14 20:36:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-14 20:36:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-14 20:36:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-14 20:36:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-14 20:36:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:36:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 102 proven. 12 refuted. 0 times theorem prover too weak. 2784 trivial. 0 not checked. [2024-10-14 20:36:58,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:36:58,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749107704] [2024-10-14 20:36:58,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749107704] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:36:58,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415204148] [2024-10-14 20:36:58,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 20:36:58,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:36:58,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:36:58,191 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:36:58,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 20:36:58,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 20:36:58,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:36:58,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 20:36:58,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:36:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 783 proven. 0 refuted. 0 times theorem prover too weak. 2115 trivial. 0 not checked. [2024-10-14 20:36:58,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 20:36:58,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415204148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:36:58,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 20:36:58,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-14 20:36:58,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692772783] [2024-10-14 20:36:58,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:36:58,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:36:58,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:36:58,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:36:58,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:36:58,353 INFO L87 Difference]: Start difference. First operand 285 states and 380 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 20:36:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:36:58,489 INFO L93 Difference]: Finished difference Result 293 states and 388 transitions. [2024-10-14 20:36:58,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:36:58,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 267 [2024-10-14 20:36:58,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:36:58,491 INFO L225 Difference]: With dead ends: 293 [2024-10-14 20:36:58,491 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:36:58,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:36:58,494 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:36:58,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:36:58,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:36:58,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:36:58,495 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-14 20:36:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:36:58,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 267 [2024-10-14 20:36:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:36:58,496 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:36:58,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 20:36:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:36:58,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:36:58,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-14 20:36:58,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-14 20:36:58,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-14 20:36:58,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-14 20:36:58,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 20:36:58,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 20:36:58,704 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:36:58,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:36:59,911 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:36:59,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:36:59 BoogieIcfgContainer [2024-10-14 20:36:59,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:36:59,931 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:36:59,932 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:36:59,932 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:36:59,932 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:36:09" (3/4) ... [2024-10-14 20:36:59,934 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:36:59,937 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 20:36:59,942 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-14 20:36:59,942 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 20:36:59,942 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 20:36:59,942 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:37:00,051 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:37:00,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:37:00,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:37:00,052 INFO L158 Benchmark]: Toolchain (without parser) took 51148.78ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 93.8MB in the beginning and 161.4MB in the end (delta: -67.6MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2024-10-14 20:37:00,053 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 151.0MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:37:00,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.26ms. Allocated memory is still 151.0MB. Free memory was 93.7MB in the beginning and 81.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 20:37:00,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.98ms. Allocated memory is still 151.0MB. Free memory was 81.1MB in the beginning and 79.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:37:00,054 INFO L158 Benchmark]: Boogie Preprocessor took 57.14ms. Allocated memory is still 151.0MB. Free memory was 79.0MB in the beginning and 77.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:37:00,055 INFO L158 Benchmark]: RCFGBuilder took 443.27ms. Allocated memory is still 151.0MB. Free memory was 77.5MB in the beginning and 60.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 20:37:00,055 INFO L158 Benchmark]: TraceAbstraction took 50204.79ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 60.2MB in the beginning and 53.5MB in the end (delta: 6.7MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2024-10-14 20:37:00,056 INFO L158 Benchmark]: Witness Printer took 120.43ms. Allocated memory is still 195.0MB. Free memory was 53.5MB in the beginning and 161.4MB in the end (delta: -107.9MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2024-10-14 20:37:00,057 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 151.0MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.26ms. Allocated memory is still 151.0MB. Free memory was 93.7MB in the beginning and 81.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.98ms. Allocated memory is still 151.0MB. Free memory was 81.1MB in the beginning and 79.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.14ms. Allocated memory is still 151.0MB. Free memory was 79.0MB in the beginning and 77.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 443.27ms. Allocated memory is still 151.0MB. Free memory was 77.5MB in the beginning and 60.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 50204.79ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 60.2MB in the beginning and 53.5MB in the end (delta: 6.7MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. * Witness Printer took 120.43ms. Allocated memory is still 195.0MB. Free memory was 53.5MB in the beginning and 161.4MB in the end (delta: -107.9MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: 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 2 procedures, 33 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 48.9s, OverallIterations: 13, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 38.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 1132 SdHoareTripleChecker+Valid, 35.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1132 mSDsluCounter, 1829 SdHoareTripleChecker+Invalid, 34.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1472 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1325 IncrementalHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 357 mSDtfsCounter, 1325 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2025 GetRequests, 1705 SyntacticMatches, 16 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4529 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=285occurred in iteration=12, InterpolantAutomatonStates: 231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 455 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 1899 NumberOfCodeBlocks, 1659 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2503 ConstructedInterpolants, 0 QuantifiedInterpolants, 4485 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1633 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 27 InterpolantComputations, 8 PerfectInterpolantSequences, 20015/23648 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 4 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((counter <= 10) && (0 <= ((long long) counter + 2147483647))) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((counter <= 2147483641) && (0 <= ((long long) counter + 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:37:00,098 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