./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 26bf02dce57f3cc9fa9e6af5bd48026588368cec482f21797d4110581d1b8f61 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:45:18,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:45:19,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:45:19,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:45:19,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:45:19,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:45:19,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:45:19,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:45:19,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:45:19,056 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:45:19,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:45:19,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:45:19,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:45:19,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:45:19,058 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:45:19,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:45:19,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:45:19,059 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:45:19,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:45:19,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:45:19,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:45:19,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:45:19,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:45:19,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:45:19,061 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:45:19,062 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:45:19,062 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:45:19,062 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:45:19,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:45:19,063 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:45:19,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:45:19,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:45:19,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:45:19,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:45:19,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:45:19,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:45:19,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:45:19,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:45:19,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:45:19,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:45:19,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:45:19,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:45:19,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:45:19,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:45:19,067 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-clean/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-clean/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 -> 26bf02dce57f3cc9fa9e6af5bd48026588368cec482f21797d4110581d1b8f61 [2024-10-11 20:45:19,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:45:19,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:45:19,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:45:19,376 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:45:19,377 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:45:19,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c [2024-10-11 20:45:20,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:45:20,945 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:45:20,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c [2024-10-11 20:45:20,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c1386791d/ed74771b49194dfbb86070e0bde69d8d/FLAG0e0bb970c [2024-10-11 20:45:21,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c1386791d/ed74771b49194dfbb86070e0bde69d8d [2024-10-11 20:45:21,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:45:21,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:45:21,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:45:21,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:45:21,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:45:21,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:45:21" (1/1) ... [2024-10-11 20:45:21,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae75609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21, skipping insertion in model container [2024-10-11 20:45:21,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:45:21" (1/1) ... [2024-10-11 20:45:21,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:45:21,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:45:21,562 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:45:21,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:45:21,599 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:45:21,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21 WrapperNode [2024-10-11 20:45:21,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:45:21,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:45:21,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:45:21,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:45:21,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21" (1/1) ... [2024-10-11 20:45:21,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21" (1/1) ... [2024-10-11 20:45:21,639 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 172 [2024-10-11 20:45:21,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:45:21,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:45:21,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:45:21,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:45:21,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21" (1/1) ... [2024-10-11 20:45:21,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21" (1/1) ... [2024-10-11 20:45:21,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21" (1/1) ... [2024-10-11 20:45:21,666 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-11 20:45:21,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21" (1/1) ... [2024-10-11 20:45:21,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21" (1/1) ... [2024-10-11 20:45:21,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21" (1/1) ... [2024-10-11 20:45:21,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21" (1/1) ... [2024-10-11 20:45:21,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21" (1/1) ... [2024-10-11 20:45:21,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21" (1/1) ... [2024-10-11 20:45:21,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:45:21,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:45:21,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:45:21,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:45:21,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21" (1/1) ... [2024-10-11 20:45:21,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:45:21,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:21,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:45:21,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:45:21,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:45:21,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 20:45:21,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 20:45:21,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:45:21,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:45:21,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:45:21,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:45:21,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:45:21,840 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:45:21,844 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:45:22,369 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-10-11 20:45:22,369 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:45:22,461 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:45:22,464 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 20:45:22,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:45:22 BoogieIcfgContainer [2024-10-11 20:45:22,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:45:22,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:45:22,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:45:22,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:45:22,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:45:21" (1/3) ... [2024-10-11 20:45:22,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198d5d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:45:22, skipping insertion in model container [2024-10-11 20:45:22,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:45:21" (2/3) ... [2024-10-11 20:45:22,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198d5d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:45:22, skipping insertion in model container [2024-10-11 20:45:22,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:45:22" (3/3) ... [2024-10-11 20:45:22,508 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound2.c [2024-10-11 20:45:22,526 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:45:22,526 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2024-10-11 20:45:22,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:45:22,605 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;@35ffadc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:45:22,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2024-10-11 20:45:22,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 115 states have (on average 1.9478260869565218) internal successors, (224), 213 states have internal predecessors, (224), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:45:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 20:45:22,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:22,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 20:45:22,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:22,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:22,621 INFO L85 PathProgramCache]: Analyzing trace with hash 10140, now seen corresponding path program 1 times [2024-10-11 20:45:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:22,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121159015] [2024-10-11 20:45:22,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:22,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:22,781 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-11 20:45:22,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:22,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121159015] [2024-10-11 20:45:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121159015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:22,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:22,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:45:22,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806059170] [2024-10-11 20:45:22,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:22,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:22,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:22,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:22,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:22,814 INFO L87 Difference]: Start difference. First operand has 222 states, 115 states have (on average 1.9478260869565218) internal successors, (224), 213 states have internal predecessors, (224), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:45:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:22,928 INFO L93 Difference]: Finished difference Result 419 states and 463 transitions. [2024-10-11 20:45:22,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:22,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-11 20:45:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:22,940 INFO L225 Difference]: With dead ends: 419 [2024-10-11 20:45:22,940 INFO L226 Difference]: Without dead ends: 205 [2024-10-11 20:45:22,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:22,946 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 13 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:22,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 384 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:22,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-11 20:45:22,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-10-11 20:45:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 114 states have (on average 1.780701754385965) internal successors, (203), 197 states have internal predecessors, (203), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:45:22,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 213 transitions. [2024-10-11 20:45:22,996 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 213 transitions. Word has length 2 [2024-10-11 20:45:22,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:22,996 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 213 transitions. [2024-10-11 20:45:22,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:45:22,997 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 213 transitions. [2024-10-11 20:45:22,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 20:45:22,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:22,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 20:45:22,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:45:22,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:22,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash 314376, now seen corresponding path program 1 times [2024-10-11 20:45:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:22,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154086329] [2024-10-11 20:45:23,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:23,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:23,054 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-11 20:45:23,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:23,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154086329] [2024-10-11 20:45:23,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154086329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:23,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:23,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:45:23,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783015407] [2024-10-11 20:45:23,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:23,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:23,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:23,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:23,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:23,057 INFO L87 Difference]: Start difference. First operand 205 states and 213 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:45:23,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:23,118 INFO L93 Difference]: Finished difference Result 205 states and 213 transitions. [2024-10-11 20:45:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:23,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 20:45:23,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:23,123 INFO L225 Difference]: With dead ends: 205 [2024-10-11 20:45:23,123 INFO L226 Difference]: Without dead ends: 201 [2024-10-11 20:45:23,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:23,124 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 12 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:23,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 378 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:45:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-11 20:45:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-10-11 20:45:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 114 states have (on average 1.7456140350877194) internal successors, (199), 193 states have internal predecessors, (199), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:45:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 209 transitions. [2024-10-11 20:45:23,150 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 209 transitions. Word has length 3 [2024-10-11 20:45:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:23,151 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 209 transitions. [2024-10-11 20:45:23,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:45:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 209 transitions. [2024-10-11 20:45:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:45:23,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:23,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:23,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:45:23,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:23,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:23,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1723766388, now seen corresponding path program 1 times [2024-10-11 20:45:23,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:23,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172943077] [2024-10-11 20:45:23,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:23,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:23,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666460236] [2024-10-11 20:45:23,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:23,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:23,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:23,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:23,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:45:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:23,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:45:23,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:23,308 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-11 20:45:23,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:45:23,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:23,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172943077] [2024-10-11 20:45:23,309 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:23,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666460236] [2024-10-11 20:45:23,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666460236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:23,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:23,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 20:45:23,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123000996] [2024-10-11 20:45:23,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:23,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:23,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:23,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:23,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:23,315 INFO L87 Difference]: Start difference. First operand 201 states and 209 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:45:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:23,359 INFO L93 Difference]: Finished difference Result 201 states and 209 transitions. [2024-10-11 20:45:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:23,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:45:23,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:23,362 INFO L225 Difference]: With dead ends: 201 [2024-10-11 20:45:23,362 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 20:45:23,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:23,364 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 8 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:23,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 378 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:45:23,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 20:45:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-10-11 20:45:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 114 states have (on average 1.7280701754385965) internal successors, (197), 191 states have internal predecessors, (197), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:45:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 207 transitions. [2024-10-11 20:45:23,381 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 207 transitions. Word has length 7 [2024-10-11 20:45:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:23,382 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 207 transitions. [2024-10-11 20:45:23,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:45:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 207 transitions. [2024-10-11 20:45:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 20:45:23,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:23,384 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:23,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:45:23,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:23,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:23,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:23,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2063672454, now seen corresponding path program 1 times [2024-10-11 20:45:23,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:23,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754145063] [2024-10-11 20:45:23,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:23,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:23,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565169356] [2024-10-11 20:45:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:23,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:23,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:23,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:23,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:45:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:23,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:45:23,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:23,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:23,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:45:23,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:23,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754145063] [2024-10-11 20:45:23,752 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:23,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565169356] [2024-10-11 20:45:23,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565169356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:23,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:23,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:23,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876435073] [2024-10-11 20:45:23,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:23,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:23,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:23,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:23,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:23,756 INFO L87 Difference]: Start difference. First operand 199 states and 207 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:23,829 INFO L93 Difference]: Finished difference Result 199 states and 207 transitions. [2024-10-11 20:45:23,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:23,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-11 20:45:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:23,833 INFO L225 Difference]: With dead ends: 199 [2024-10-11 20:45:23,833 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 20:45:23,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:23,834 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 162 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:23,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 185 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 20:45:23,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-10-11 20:45:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 114 states have (on average 1.7105263157894737) internal successors, (195), 189 states have internal predecessors, (195), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:45:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 205 transitions. [2024-10-11 20:45:23,856 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 205 transitions. Word has length 24 [2024-10-11 20:45:23,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:23,857 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 205 transitions. [2024-10-11 20:45:23,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 205 transitions. [2024-10-11 20:45:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:45:23,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:23,858 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:23,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:45:24,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:24,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:24,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:24,060 INFO L85 PathProgramCache]: Analyzing trace with hash -450663304, now seen corresponding path program 1 times [2024-10-11 20:45:24,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:24,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504930287] [2024-10-11 20:45:24,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:24,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:24,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:24,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:45:24,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:24,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504930287] [2024-10-11 20:45:24,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504930287] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:24,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883610851] [2024-10-11 20:45:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:24,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:24,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:24,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:24,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:45:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:24,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:45:24,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:45:24,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:45:24,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883610851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:24,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:45:24,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 20:45:24,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119211812] [2024-10-11 20:45:24,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:24,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:45:24,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:24,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:45:24,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:45:24,494 INFO L87 Difference]: Start difference. First operand 197 states and 205 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:24,668 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2024-10-11 20:45:24,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:45:24,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-11 20:45:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:24,670 INFO L225 Difference]: With dead ends: 197 [2024-10-11 20:45:24,670 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 20:45:24,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:45:24,672 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 161 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:24,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 678 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:45:24,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 20:45:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-10-11 20:45:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 114 states have (on average 1.6929824561403508) internal successors, (193), 187 states have internal predecessors, (193), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:45:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 203 transitions. [2024-10-11 20:45:24,679 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 203 transitions. Word has length 25 [2024-10-11 20:45:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:24,680 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 203 transitions. [2024-10-11 20:45:24,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 203 transitions. [2024-10-11 20:45:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 20:45:24,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:24,681 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:24,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 20:45:24,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:24,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:24,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash 704263898, now seen corresponding path program 1 times [2024-10-11 20:45:24,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:24,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263033323] [2024-10-11 20:45:24,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:24,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:24,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:24,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:25,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:25,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263033323] [2024-10-11 20:45:25,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263033323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:25,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:45:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499880342] [2024-10-11 20:45:25,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:25,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:45:25,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:25,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:45:25,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:45:25,011 INFO L87 Difference]: Start difference. First operand 195 states and 203 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:25,052 INFO L93 Difference]: Finished difference Result 229 states and 237 transitions. [2024-10-11 20:45:25,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:45:25,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-10-11 20:45:25,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:25,055 INFO L225 Difference]: With dead ends: 229 [2024-10-11 20:45:25,056 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 20:45:25,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:45:25,058 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 9 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:25,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 567 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:45:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 20:45:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-10-11 20:45:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 118 states have (on average 1.6694915254237288) internal successors, (197), 191 states have internal predecessors, (197), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:45:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 207 transitions. [2024-10-11 20:45:25,075 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 207 transitions. Word has length 27 [2024-10-11 20:45:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:25,075 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 207 transitions. [2024-10-11 20:45:25,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 207 transitions. [2024-10-11 20:45:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 20:45:25,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:25,076 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:25,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 20:45:25,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:25,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:25,077 INFO L85 PathProgramCache]: Analyzing trace with hash -189384977, now seen corresponding path program 1 times [2024-10-11 20:45:25,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:25,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138235658] [2024-10-11 20:45:25,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:25,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:25,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:25,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:25,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:25,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138235658] [2024-10-11 20:45:25,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138235658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:25,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:25,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:25,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620044570] [2024-10-11 20:45:25,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:25,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:25,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:25,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:25,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:25,138 INFO L87 Difference]: Start difference. First operand 199 states and 207 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:25,220 INFO L93 Difference]: Finished difference Result 251 states and 261 transitions. [2024-10-11 20:45:25,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:25,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-10-11 20:45:25,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:25,222 INFO L225 Difference]: With dead ends: 251 [2024-10-11 20:45:25,222 INFO L226 Difference]: Without dead ends: 248 [2024-10-11 20:45:25,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:25,223 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 141 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:25,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 271 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:25,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-11 20:45:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 214. [2024-10-11 20:45:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 206 states have internal predecessors, (221), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:45:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 231 transitions. [2024-10-11 20:45:25,234 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 231 transitions. Word has length 30 [2024-10-11 20:45:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:25,235 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 231 transitions. [2024-10-11 20:45:25,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 231 transitions. [2024-10-11 20:45:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 20:45:25,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:25,236 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:25,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:45:25,236 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:25,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:25,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1575966911, now seen corresponding path program 1 times [2024-10-11 20:45:25,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:25,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713858415] [2024-10-11 20:45:25,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:25,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:25,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:25,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:25,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:25,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713858415] [2024-10-11 20:45:25,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713858415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:25,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:25,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:45:25,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934299145] [2024-10-11 20:45:25,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:25,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:45:25,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:25,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:45:25,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:45:25,345 INFO L87 Difference]: Start difference. First operand 214 states and 231 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:25,485 INFO L93 Difference]: Finished difference Result 254 states and 264 transitions. [2024-10-11 20:45:25,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:45:25,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-11 20:45:25,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:25,488 INFO L225 Difference]: With dead ends: 254 [2024-10-11 20:45:25,488 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 20:45:25,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:45:25,489 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 151 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:25,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 427 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 20:45:25,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 217. [2024-10-11 20:45:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 136 states have (on average 1.6470588235294117) internal successors, (224), 209 states have internal predecessors, (224), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:45:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 234 transitions. [2024-10-11 20:45:25,501 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 234 transitions. Word has length 31 [2024-10-11 20:45:25,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:25,502 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 234 transitions. [2024-10-11 20:45:25,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 234 transitions. [2024-10-11 20:45:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 20:45:25,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:25,503 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:25,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:45:25,503 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:25,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:25,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1610333903, now seen corresponding path program 1 times [2024-10-11 20:45:25,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:25,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514902221] [2024-10-11 20:45:25,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:25,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:25,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1490682268] [2024-10-11 20:45:25,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:25,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:25,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:25,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:25,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:45:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:25,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 20:45:25,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:25,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:45:25,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:25,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514902221] [2024-10-11 20:45:25,626 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:25,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490682268] [2024-10-11 20:45:25,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490682268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:25,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:25,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:25,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495182047] [2024-10-11 20:45:25,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:25,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:25,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:25,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:25,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:25,628 INFO L87 Difference]: Start difference. First operand 217 states and 234 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:25,745 INFO L93 Difference]: Finished difference Result 366 states and 398 transitions. [2024-10-11 20:45:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:25,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-11 20:45:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:25,748 INFO L225 Difference]: With dead ends: 366 [2024-10-11 20:45:25,748 INFO L226 Difference]: Without dead ends: 363 [2024-10-11 20:45:25,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:25,749 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 139 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:25,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 358 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-11 20:45:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 289. [2024-10-11 20:45:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 205 states have (on average 1.6780487804878048) internal successors, (344), 278 states have internal predecessors, (344), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:45:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 360 transitions. [2024-10-11 20:45:25,761 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 360 transitions. Word has length 32 [2024-10-11 20:45:25,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:25,762 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 360 transitions. [2024-10-11 20:45:25,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 360 transitions. [2024-10-11 20:45:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 20:45:25,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:25,762 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:25,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:45:25,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 20:45:25,963 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:25,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:25,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1619256643, now seen corresponding path program 1 times [2024-10-11 20:45:25,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:25,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542204090] [2024-10-11 20:45:25,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:25,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:26,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:26,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:45:26,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:26,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542204090] [2024-10-11 20:45:26,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542204090] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:26,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189386890] [2024-10-11 20:45:26,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:26,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:26,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:26,133 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:26,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:45:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:26,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:45:26,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:45:26,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:45:26,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189386890] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:45:26,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:45:26,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-10-11 20:45:26,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762248455] [2024-10-11 20:45:26,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:26,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 20:45:26,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:26,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 20:45:26,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:45:26,643 INFO L87 Difference]: Start difference. First operand 289 states and 360 transitions. Second operand has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:45:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:27,142 INFO L93 Difference]: Finished difference Result 406 states and 434 transitions. [2024-10-11 20:45:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 20:45:27,143 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2024-10-11 20:45:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:27,145 INFO L225 Difference]: With dead ends: 406 [2024-10-11 20:45:27,145 INFO L226 Difference]: Without dead ends: 403 [2024-10-11 20:45:27,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:45:27,149 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 578 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:27,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1655 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:45:27,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-11 20:45:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 295. [2024-10-11 20:45:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 211 states have (on average 1.6587677725118484) internal successors, (350), 284 states have internal predecessors, (350), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 20:45:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 366 transitions. [2024-10-11 20:45:27,163 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 366 transitions. Word has length 33 [2024-10-11 20:45:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:27,163 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 366 transitions. [2024-10-11 20:45:27,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.923076923076923) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 20:45:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 366 transitions. [2024-10-11 20:45:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 20:45:27,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:27,164 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:27,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 20:45:27,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:45:27,365 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:27,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:27,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1327475525, now seen corresponding path program 1 times [2024-10-11 20:45:27,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:27,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426945768] [2024-10-11 20:45:27,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:27,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:27,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399939556] [2024-10-11 20:45:27,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:27,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:27,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:27,380 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:27,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:45:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:27,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:45:27,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:45:27,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:27,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:27,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426945768] [2024-10-11 20:45:27,750 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:27,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399939556] [2024-10-11 20:45:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399939556] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:27,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:45:27,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-10-11 20:45:27,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969952561] [2024-10-11 20:45:27,751 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:27,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:45:27,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:27,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:45:27,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:45:27,752 INFO L87 Difference]: Start difference. First operand 295 states and 366 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:45:29,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:29,369 INFO L93 Difference]: Finished difference Result 475 states and 580 transitions. [2024-10-11 20:45:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 20:45:29,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-10-11 20:45:29,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:29,373 INFO L225 Difference]: With dead ends: 475 [2024-10-11 20:45:29,373 INFO L226 Difference]: Without dead ends: 448 [2024-10-11 20:45:29,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:45:29,374 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 428 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:29,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 511 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 20:45:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-11 20:45:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 414. [2024-10-11 20:45:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 327 states have (on average 1.5688073394495412) internal successors, (513), 400 states have internal predecessors, (513), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 20:45:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 535 transitions. [2024-10-11 20:45:29,400 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 535 transitions. Word has length 35 [2024-10-11 20:45:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:29,401 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 535 transitions. [2024-10-11 20:45:29,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:45:29,401 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 535 transitions. [2024-10-11 20:45:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 20:45:29,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:29,402 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:29,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 20:45:29,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 20:45:29,606 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:29,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:29,606 INFO L85 PathProgramCache]: Analyzing trace with hash 98695495, now seen corresponding path program 1 times [2024-10-11 20:45:29,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:29,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707211628] [2024-10-11 20:45:29,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:29,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:29,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628506737] [2024-10-11 20:45:29,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:29,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:29,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:29,619 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:29,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:45:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:29,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:45:29,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:29,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:45:29,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:29,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707211628] [2024-10-11 20:45:29,692 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:29,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628506737] [2024-10-11 20:45:29,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628506737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:29,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:29,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:45:29,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967499519] [2024-10-11 20:45:29,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:29,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:45:29,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:29,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:45:29,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:29,693 INFO L87 Difference]: Start difference. First operand 414 states and 535 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:29,888 INFO L93 Difference]: Finished difference Result 606 states and 768 transitions. [2024-10-11 20:45:29,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:45:29,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-10-11 20:45:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:29,892 INFO L225 Difference]: With dead ends: 606 [2024-10-11 20:45:29,892 INFO L226 Difference]: Without dead ends: 565 [2024-10-11 20:45:29,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:45:29,892 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 117 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:29,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 260 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:45:29,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-11 20:45:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 532. [2024-10-11 20:45:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 442 states have (on average 1.5158371040723981) internal successors, (670), 515 states have internal predecessors, (670), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 20:45:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 698 transitions. [2024-10-11 20:45:29,920 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 698 transitions. Word has length 37 [2024-10-11 20:45:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:29,920 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 698 transitions. [2024-10-11 20:45:29,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 20:45:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 698 transitions. [2024-10-11 20:45:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 20:45:29,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:29,921 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:29,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:45:30,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:30,122 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:30,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:30,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1705268062, now seen corresponding path program 1 times [2024-10-11 20:45:30,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:30,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951912337] [2024-10-11 20:45:30,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:30,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:30,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:30,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:30,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:45:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:30,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:30,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951912337] [2024-10-11 20:45:30,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951912337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:30,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:30,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:45:30,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167138651] [2024-10-11 20:45:30,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:30,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:45:30,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:30,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:45:30,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:45:30,234 INFO L87 Difference]: Start difference. First operand 532 states and 698 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:45:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:30,328 INFO L93 Difference]: Finished difference Result 640 states and 820 transitions. [2024-10-11 20:45:30,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:45:30,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 55 [2024-10-11 20:45:30,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:30,331 INFO L225 Difference]: With dead ends: 640 [2024-10-11 20:45:30,331 INFO L226 Difference]: Without dead ends: 639 [2024-10-11 20:45:30,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:45:30,332 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 62 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:30,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 926 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:30,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-10-11 20:45:30,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 613. [2024-10-11 20:45:30,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 519 states have (on average 1.4816955684007707) internal successors, (769), 592 states have internal predecessors, (769), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 20:45:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 803 transitions. [2024-10-11 20:45:30,361 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 803 transitions. Word has length 55 [2024-10-11 20:45:30,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:30,361 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 803 transitions. [2024-10-11 20:45:30,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:45:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 803 transitions. [2024-10-11 20:45:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 20:45:30,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:30,362 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:30,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:45:30,363 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:30,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1323702497, now seen corresponding path program 1 times [2024-10-11 20:45:30,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:30,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806704351] [2024-10-11 20:45:30,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:30,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:30,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:30,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:30,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:45:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:30,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:30,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806704351] [2024-10-11 20:45:30,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806704351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:30,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:30,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:45:30,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208359204] [2024-10-11 20:45:30,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:30,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:45:30,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:30,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:45:30,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:45:30,453 INFO L87 Difference]: Start difference. First operand 613 states and 803 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:45:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:30,536 INFO L93 Difference]: Finished difference Result 1125 states and 1479 transitions. [2024-10-11 20:45:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:45:30,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2024-10-11 20:45:30,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:30,539 INFO L225 Difference]: With dead ends: 1125 [2024-10-11 20:45:30,539 INFO L226 Difference]: Without dead ends: 617 [2024-10-11 20:45:30,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:45:30,541 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 18 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:30,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 772 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:45:30,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-10-11 20:45:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2024-10-11 20:45:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 522 states have (on average 1.475095785440613) internal successors, (770), 595 states have internal predecessors, (770), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 20:45:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 804 transitions. [2024-10-11 20:45:30,571 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 804 transitions. Word has length 56 [2024-10-11 20:45:30,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:30,571 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 804 transitions. [2024-10-11 20:45:30,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 20:45:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 804 transitions. [2024-10-11 20:45:30,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 20:45:30,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:30,582 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:30,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 20:45:30,583 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:30,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:30,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1497218300, now seen corresponding path program 1 times [2024-10-11 20:45:30,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:30,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016245511] [2024-10-11 20:45:30,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:30,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:30,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:30,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:30,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:45:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:30,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:45:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:45:30,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:30,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016245511] [2024-10-11 20:45:30,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016245511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:30,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:30,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:45:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466559425] [2024-10-11 20:45:30,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:30,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:45:30,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:30,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:45:30,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:45:30,663 INFO L87 Difference]: Start difference. First operand 617 states and 804 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:45:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:30,892 INFO L93 Difference]: Finished difference Result 650 states and 805 transitions. [2024-10-11 20:45:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:45:30,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2024-10-11 20:45:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:30,895 INFO L225 Difference]: With dead ends: 650 [2024-10-11 20:45:30,895 INFO L226 Difference]: Without dead ends: 649 [2024-10-11 20:45:30,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:45:30,897 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 83 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:30,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 344 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:45:30,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-10-11 20:45:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 617. [2024-10-11 20:45:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 522 states have (on average 1.4693486590038314) internal successors, (767), 595 states have internal predecessors, (767), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 20:45:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 801 transitions. [2024-10-11 20:45:30,927 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 801 transitions. Word has length 82 [2024-10-11 20:45:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:30,927 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 801 transitions. [2024-10-11 20:45:30,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:45:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 801 transitions. [2024-10-11 20:45:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 20:45:30,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:30,928 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:30,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 20:45:30,929 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:30,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:30,929 INFO L85 PathProgramCache]: Analyzing trace with hash -830872778, now seen corresponding path program 1 times [2024-10-11 20:45:30,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:30,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089949752] [2024-10-11 20:45:30,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:30,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:45:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:45:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:45:31,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:31,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089949752] [2024-10-11 20:45:31,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089949752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:31,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:31,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:45:31,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617343461] [2024-10-11 20:45:31,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:31,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:45:31,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:31,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:45:31,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:45:31,051 INFO L87 Difference]: Start difference. First operand 617 states and 801 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:45:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:31,456 INFO L93 Difference]: Finished difference Result 664 states and 823 transitions. [2024-10-11 20:45:31,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:45:31,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 83 [2024-10-11 20:45:31,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:31,459 INFO L225 Difference]: With dead ends: 664 [2024-10-11 20:45:31,459 INFO L226 Difference]: Without dead ends: 663 [2024-10-11 20:45:31,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:45:31,460 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 368 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:31,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 324 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:45:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-10-11 20:45:31,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 617. [2024-10-11 20:45:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 522 states have (on average 1.4636015325670497) internal successors, (764), 595 states have internal predecessors, (764), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 20:45:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 798 transitions. [2024-10-11 20:45:31,487 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 798 transitions. Word has length 83 [2024-10-11 20:45:31,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:31,488 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 798 transitions. [2024-10-11 20:45:31,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:45:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 798 transitions. [2024-10-11 20:45:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 20:45:31,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:31,489 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:31,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 20:45:31,489 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:31,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:31,489 INFO L85 PathProgramCache]: Analyzing trace with hash -830874284, now seen corresponding path program 1 times [2024-10-11 20:45:31,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:31,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134261593] [2024-10-11 20:45:31,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:31,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:45:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:45:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:45:31,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:31,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134261593] [2024-10-11 20:45:31,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134261593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:31,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:31,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:45:31,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846438196] [2024-10-11 20:45:31,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:31,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:45:31,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:31,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:45:31,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:45:31,637 INFO L87 Difference]: Start difference. First operand 617 states and 798 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 20:45:31,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:31,788 INFO L93 Difference]: Finished difference Result 1164 states and 1503 transitions. [2024-10-11 20:45:31,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:45:31,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 83 [2024-10-11 20:45:31,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:31,792 INFO L225 Difference]: With dead ends: 1164 [2024-10-11 20:45:31,792 INFO L226 Difference]: Without dead ends: 656 [2024-10-11 20:45:31,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:45:31,793 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 51 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:31,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1304 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-11 20:45:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 629. [2024-10-11 20:45:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 534 states have (on average 1.4588014981273407) internal successors, (779), 607 states have internal predecessors, (779), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 20:45:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 813 transitions. [2024-10-11 20:45:31,835 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 813 transitions. Word has length 83 [2024-10-11 20:45:31,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:31,835 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 813 transitions. [2024-10-11 20:45:31,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 20:45:31,835 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 813 transitions. [2024-10-11 20:45:31,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 20:45:31,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:31,836 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:31,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 20:45:31,836 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:31,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:31,837 INFO L85 PathProgramCache]: Analyzing trace with hash 12701165, now seen corresponding path program 1 times [2024-10-11 20:45:31,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:31,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406572204] [2024-10-11 20:45:31,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:31,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:45:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:45:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:45:31,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:31,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406572204] [2024-10-11 20:45:31,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406572204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:31,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:31,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:45:31,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329010425] [2024-10-11 20:45:31,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:31,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:45:31,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:31,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:45:31,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:45:31,961 INFO L87 Difference]: Start difference. First operand 629 states and 813 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 20:45:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:32,089 INFO L93 Difference]: Finished difference Result 638 states and 820 transitions. [2024-10-11 20:45:32,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 20:45:32,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 84 [2024-10-11 20:45:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:32,092 INFO L225 Difference]: With dead ends: 638 [2024-10-11 20:45:32,092 INFO L226 Difference]: Without dead ends: 637 [2024-10-11 20:45:32,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:45:32,093 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 38 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:32,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1180 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-11 20:45:32,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2024-10-11 20:45:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 537 states have (on average 1.4543761638733705) internal successors, (781), 610 states have internal predecessors, (781), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 20:45:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 815 transitions. [2024-10-11 20:45:32,121 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 815 transitions. Word has length 84 [2024-10-11 20:45:32,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:32,122 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 815 transitions. [2024-10-11 20:45:32,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 20:45:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 815 transitions. [2024-10-11 20:45:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 20:45:32,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:32,123 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:32,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 20:45:32,123 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:32,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:32,123 INFO L85 PathProgramCache]: Analyzing trace with hash 423474969, now seen corresponding path program 1 times [2024-10-11 20:45:32,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:32,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114421099] [2024-10-11 20:45:32,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:32,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:45:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:45:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:45:32,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:32,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114421099] [2024-10-11 20:45:32,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114421099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:45:32,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:45:32,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:45:32,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692642544] [2024-10-11 20:45:32,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:45:32,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:45:32,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:32,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:45:32,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:45:32,200 INFO L87 Difference]: Start difference. First operand 633 states and 815 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:32,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:32,249 INFO L93 Difference]: Finished difference Result 683 states and 855 transitions. [2024-10-11 20:45:32,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:45:32,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 87 [2024-10-11 20:45:32,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:32,251 INFO L225 Difference]: With dead ends: 683 [2024-10-11 20:45:32,251 INFO L226 Difference]: Without dead ends: 174 [2024-10-11 20:45:32,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:45:32,252 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 26 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:32,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 438 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:45:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-11 20:45:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 166. [2024-10-11 20:45:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 134 states have (on average 1.1865671641791045) internal successors, (159), 156 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:45:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 169 transitions. [2024-10-11 20:45:32,265 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 169 transitions. Word has length 87 [2024-10-11 20:45:32,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:32,266 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 169 transitions. [2024-10-11 20:45:32,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 20:45:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 169 transitions. [2024-10-11 20:45:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 20:45:32,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:32,267 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:32,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 20:45:32,268 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:32,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash 396283429, now seen corresponding path program 1 times [2024-10-11 20:45:32,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:32,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835799036] [2024-10-11 20:45:32,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:32,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:45:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:45:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:45:32,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:32,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835799036] [2024-10-11 20:45:32,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835799036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:32,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945900652] [2024-10-11 20:45:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:32,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:32,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:32,397 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:32,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:45:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:32,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:45:32,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:32,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:45:32,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945900652] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:45:32,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:45:32,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2024-10-11 20:45:32,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917606085] [2024-10-11 20:45:32,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:32,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 20:45:32,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:32,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 20:45:32,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:45:32,700 INFO L87 Difference]: Start difference. First operand 166 states and 169 transitions. Second operand has 17 states, 16 states have (on average 10.625) internal successors, (170), 17 states have internal predecessors, (170), 7 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-11 20:45:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:32,880 INFO L93 Difference]: Finished difference Result 270 states and 279 transitions. [2024-10-11 20:45:32,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 20:45:32,880 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 10.625) internal successors, (170), 17 states have internal predecessors, (170), 7 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 88 [2024-10-11 20:45:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:32,881 INFO L225 Difference]: With dead ends: 270 [2024-10-11 20:45:32,882 INFO L226 Difference]: Without dead ends: 269 [2024-10-11 20:45:32,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:45:32,882 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 151 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:32,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 836 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-11 20:45:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2024-10-11 20:45:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 197 states have (on average 1.2893401015228427) internal successors, (254), 219 states have internal predecessors, (254), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 268 transitions. [2024-10-11 20:45:32,900 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 268 transitions. Word has length 88 [2024-10-11 20:45:32,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:32,900 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 268 transitions. [2024-10-11 20:45:32,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 10.625) internal successors, (170), 17 states have internal predecessors, (170), 7 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-11 20:45:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 268 transitions. [2024-10-11 20:45:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 20:45:32,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:32,903 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:32,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:45:33,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:33,108 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:33,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash 242822222, now seen corresponding path program 1 times [2024-10-11 20:45:33,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:33,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338028303] [2024-10-11 20:45:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:33,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:45:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:45:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:45:33,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:33,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338028303] [2024-10-11 20:45:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338028303] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288002303] [2024-10-11 20:45:33,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:33,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:33,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:33,269 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:33,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:45:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:33,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 20:45:33,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:33,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:45:33,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288002303] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:45:33,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:45:33,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 20 [2024-10-11 20:45:33,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199556213] [2024-10-11 20:45:33,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:33,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 20:45:33,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:33,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 20:45:33,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-10-11 20:45:33,618 INFO L87 Difference]: Start difference. First operand 233 states and 268 transitions. Second operand has 21 states, 20 states have (on average 8.5) internal successors, (170), 21 states have internal predecessors, (170), 7 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-11 20:45:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:33,859 INFO L93 Difference]: Finished difference Result 256 states and 277 transitions. [2024-10-11 20:45:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 20:45:33,860 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 8.5) internal successors, (170), 21 states have internal predecessors, (170), 7 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 88 [2024-10-11 20:45:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:33,861 INFO L225 Difference]: With dead ends: 256 [2024-10-11 20:45:33,861 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 20:45:33,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2024-10-11 20:45:33,863 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 87 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:33,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1238 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 20:45:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2024-10-11 20:45:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 197 states have (on average 1.284263959390863) internal successors, (253), 219 states have internal predecessors, (253), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 20:45:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 267 transitions. [2024-10-11 20:45:33,876 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 267 transitions. Word has length 88 [2024-10-11 20:45:33,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:33,876 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 267 transitions. [2024-10-11 20:45:33,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 8.5) internal successors, (170), 21 states have internal predecessors, (170), 7 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-11 20:45:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 267 transitions. [2024-10-11 20:45:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 20:45:33,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:33,878 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:33,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 20:45:34,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:34,082 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:34,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:34,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1423709849, now seen corresponding path program 1 times [2024-10-11 20:45:34,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:34,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574548815] [2024-10-11 20:45:34,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:34,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:34,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 20:45:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:34,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 20:45:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:34,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 20:45:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:34,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:45:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:45:34,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:34,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574548815] [2024-10-11 20:45:34,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574548815] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:45:34,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224471485] [2024-10-11 20:45:34,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:34,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:34,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:34,232 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:34,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:45:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:34,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 20:45:34,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:45:34,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:45:34,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224471485] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:45:34,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:45:34,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 11 [2024-10-11 20:45:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756887255] [2024-10-11 20:45:34,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:34,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:45:34,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:34,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:45:34,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:45:34,533 INFO L87 Difference]: Start difference. First operand 233 states and 267 transitions. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 20:45:34,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:34,622 INFO L93 Difference]: Finished difference Result 262 states and 295 transitions. [2024-10-11 20:45:34,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:45:34,623 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 90 [2024-10-11 20:45:34,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:34,624 INFO L225 Difference]: With dead ends: 262 [2024-10-11 20:45:34,624 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 20:45:34,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 180 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:45:34,625 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 18 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:34,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 543 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 20:45:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-11 20:45:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 106 states have internal predecessors, (106), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:45:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2024-10-11 20:45:34,633 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 90 [2024-10-11 20:45:34,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:34,634 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2024-10-11 20:45:34,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 20:45:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2024-10-11 20:45:34,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 20:45:34,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:45:34,635 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:34,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 20:45:34,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 20:45:34,836 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-10-11 20:45:34,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:45:34,836 INFO L85 PathProgramCache]: Analyzing trace with hash -664517043, now seen corresponding path program 1 times [2024-10-11 20:45:34,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:45:34,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745979793] [2024-10-11 20:45:34,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:34,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:45:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 20:45:34,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1804156869] [2024-10-11 20:45:34,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:45:34,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:45:34,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:45:34,868 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:45:34,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:45:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:45:34,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:45:34,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:45:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:45:35,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:45:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 20:45:35,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:45:35,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745979793] [2024-10-11 20:45:35,182 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 20:45:35,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804156869] [2024-10-11 20:45:35,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804156869] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:45:35,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 20:45:35,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-10-11 20:45:35,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035761585] [2024-10-11 20:45:35,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 20:45:35,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:45:35,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:45:35,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:45:35,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:45:35,184 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:45:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:45:35,254 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2024-10-11 20:45:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:45:35,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 103 [2024-10-11 20:45:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:45:35,255 INFO L225 Difference]: With dead ends: 114 [2024-10-11 20:45:35,255 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:45:35,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:45:35,256 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 27 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:45:35,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 183 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:45:35,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:45:35,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:45:35,257 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-11 20:45:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:45:35,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2024-10-11 20:45:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:45:35,257 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:45:35,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:45:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:45:35,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:45:35,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 98 remaining) [2024-10-11 20:45:35,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 98 remaining) [2024-10-11 20:45:35,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 98 remaining) [2024-10-11 20:45:35,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 98 remaining) [2024-10-11 20:45:35,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 98 remaining) [2024-10-11 20:45:35,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 98 remaining) [2024-10-11 20:45:35,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 98 remaining) [2024-10-11 20:45:35,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 98 remaining) [2024-10-11 20:45:35,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 98 remaining) [2024-10-11 20:45:35,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 98 remaining) [2024-10-11 20:45:35,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 98 remaining) [2024-10-11 20:45:35,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 98 remaining) [2024-10-11 20:45:35,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 98 remaining) [2024-10-11 20:45:35,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 98 remaining) [2024-10-11 20:45:35,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 98 remaining) [2024-10-11 20:45:35,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 98 remaining) [2024-10-11 20:45:35,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 98 remaining) [2024-10-11 20:45:35,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 98 remaining) [2024-10-11 20:45:35,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 98 remaining) [2024-10-11 20:45:35,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 98 remaining) [2024-10-11 20:45:35,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 98 remaining) [2024-10-11 20:45:35,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 98 remaining) [2024-10-11 20:45:35,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 98 remaining) [2024-10-11 20:45:35,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 98 remaining) [2024-10-11 20:45:35,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 98 remaining) [2024-10-11 20:45:35,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 98 remaining) [2024-10-11 20:45:35,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 98 remaining) [2024-10-11 20:45:35,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 98 remaining) [2024-10-11 20:45:35,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 98 remaining) [2024-10-11 20:45:35,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 98 remaining) [2024-10-11 20:45:35,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 98 remaining) [2024-10-11 20:45:35,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 98 remaining) [2024-10-11 20:45:35,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 98 remaining) [2024-10-11 20:45:35,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 98 remaining) [2024-10-11 20:45:35,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 98 remaining) [2024-10-11 20:45:35,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 98 remaining) [2024-10-11 20:45:35,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 98 remaining) [2024-10-11 20:45:35,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 98 remaining) [2024-10-11 20:45:35,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 98 remaining) [2024-10-11 20:45:35,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 98 remaining) [2024-10-11 20:45:35,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 98 remaining) [2024-10-11 20:45:35,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 98 remaining) [2024-10-11 20:45:35,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 98 remaining) [2024-10-11 20:45:35,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 98 remaining) [2024-10-11 20:45:35,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 98 remaining) [2024-10-11 20:45:35,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 98 remaining) [2024-10-11 20:45:35,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 98 remaining) [2024-10-11 20:45:35,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 98 remaining) [2024-10-11 20:45:35,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 98 remaining) [2024-10-11 20:45:35,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 98 remaining) [2024-10-11 20:45:35,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 98 remaining) [2024-10-11 20:45:35,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 98 remaining) [2024-10-11 20:45:35,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 98 remaining) [2024-10-11 20:45:35,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 98 remaining) [2024-10-11 20:45:35,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 98 remaining) [2024-10-11 20:45:35,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 98 remaining) [2024-10-11 20:45:35,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 98 remaining) [2024-10-11 20:45:35,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 98 remaining) [2024-10-11 20:45:35,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 98 remaining) [2024-10-11 20:45:35,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 98 remaining) [2024-10-11 20:45:35,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 98 remaining) [2024-10-11 20:45:35,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 98 remaining) [2024-10-11 20:45:35,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 98 remaining) [2024-10-11 20:45:35,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 98 remaining) [2024-10-11 20:45:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 98 remaining) [2024-10-11 20:45:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 98 remaining) [2024-10-11 20:45:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 98 remaining) [2024-10-11 20:45:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 98 remaining) [2024-10-11 20:45:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 98 remaining) [2024-10-11 20:45:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 98 remaining) [2024-10-11 20:45:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 98 remaining) [2024-10-11 20:45:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 98 remaining) [2024-10-11 20:45:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 98 remaining) [2024-10-11 20:45:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 98 remaining) [2024-10-11 20:45:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 98 remaining) [2024-10-11 20:45:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 98 remaining) [2024-10-11 20:45:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 98 remaining) [2024-10-11 20:45:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 98 remaining) [2024-10-11 20:45:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 98 remaining) [2024-10-11 20:45:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 98 remaining) [2024-10-11 20:45:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 98 remaining) [2024-10-11 20:45:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 98 remaining) [2024-10-11 20:45:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 98 remaining) [2024-10-11 20:45:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 98 remaining) [2024-10-11 20:45:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 98 remaining) [2024-10-11 20:45:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 98 remaining) [2024-10-11 20:45:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 98 remaining) [2024-10-11 20:45:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 98 remaining) [2024-10-11 20:45:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 98 remaining) [2024-10-11 20:45:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 98 remaining) [2024-10-11 20:45:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 98 remaining) [2024-10-11 20:45:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 98 remaining) [2024-10-11 20:45:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 98 remaining) [2024-10-11 20:45:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 98 remaining) [2024-10-11 20:45:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 98 remaining) [2024-10-11 20:45:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 98 remaining) [2024-10-11 20:45:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 98 remaining) [2024-10-11 20:45:35,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 98 remaining) [2024-10-11 20:45:35,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 20:45:35,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 20:45:35,490 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:45:35,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:45:37,070 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:45:37,091 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 20:45:37,092 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 20:45:37,094 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 20:45:37,094 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 20:45:37,099 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 20:45:37,099 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 20:45:37,105 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 20:45:37,106 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 20:45:37,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:45:37 BoogieIcfgContainer [2024-10-11 20:45:37,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:45:37,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:45:37,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:45:37,116 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:45:37,117 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:45:22" (3/4) ... [2024-10-11 20:45:37,118 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:45:37,122 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 20:45:37,122 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:45:37,131 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-11 20:45:37,131 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 20:45:37,131 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:45:37,132 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:45:37,245 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:45:37,245 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:45:37,245 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:45:37,246 INFO L158 Benchmark]: Toolchain (without parser) took 15910.90ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 121.4MB in the beginning and 106.1MB in the end (delta: 15.2MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2024-10-11 20:45:37,246 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 109.1MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:45:37,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.64ms. Allocated memory is still 151.0MB. Free memory was 121.4MB in the beginning and 108.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:45:37,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.26ms. Allocated memory is still 151.0MB. Free memory was 108.8MB in the beginning and 105.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:45:37,247 INFO L158 Benchmark]: Boogie Preprocessor took 40.71ms. Allocated memory is still 151.0MB. Free memory was 105.7MB in the beginning and 104.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:45:37,248 INFO L158 Benchmark]: RCFGBuilder took 783.01ms. Allocated memory is still 151.0MB. Free memory was 104.7MB in the beginning and 119.5MB in the end (delta: -14.8MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2024-10-11 20:45:37,248 INFO L158 Benchmark]: TraceAbstraction took 14649.37ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 119.5MB in the beginning and 113.5MB in the end (delta: 6.0MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. [2024-10-11 20:45:37,248 INFO L158 Benchmark]: Witness Printer took 129.23ms. Allocated memory is still 220.2MB. Free memory was 113.5MB in the beginning and 106.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 20:45:37,249 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.97ms. Allocated memory is still 109.1MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.64ms. Allocated memory is still 151.0MB. Free memory was 121.4MB in the beginning and 108.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.26ms. Allocated memory is still 151.0MB. Free memory was 108.8MB in the beginning and 105.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.71ms. Allocated memory is still 151.0MB. Free memory was 105.7MB in the beginning and 104.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 783.01ms. Allocated memory is still 151.0MB. Free memory was 104.7MB in the beginning and 119.5MB in the end (delta: -14.8MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14649.37ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 119.5MB in the beginning and 113.5MB in the end (delta: 6.0MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. * Witness Printer took 129.23ms. Allocated memory is still 220.2MB. Free memory was 113.5MB in the beginning and 106.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 222 locations, 98 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2885 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2848 mSDsluCounter, 14140 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10446 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3351 IncrementalHoareTripleChecker+Invalid, 3482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 3694 mSDtfsCounter, 3351 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1185 GetRequests, 1022 SyntacticMatches, 5 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=633occurred in iteration=18, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 510 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1747 NumberOfCodeBlocks, 1747 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1878 ConstructedInterpolants, 15 QuantifiedInterpolants, 6447 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1081 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 33 InterpolantComputations, 17 PerfectInterpolantSequences, 175/235 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 98 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((counter == 3) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= (2147483645 + (2 * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)))))) && (((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && (v == 1)) && (A <= 2147483647)) || (((((((((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= (2147483645 + (2 * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))))) && (((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && (3 == v)) && (A <= 2147483647)) && (counter <= 2147483646)) && (0 <= A)) && (3 <= counter))) || (((((((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= (2147483645 + (2 * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))))) && (((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && (v == 1)) && (counter == 0)) && (A <= 2147483647))) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= (2147483645 + (2 * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))))) && (((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && (3 == v)) && (A <= 2147483647)) && (0 <= A)) && (counter == 2)) || (((((((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= (2147483645 + (2 * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))))) && (((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && (v == 1)) && (A <= 2147483647)) && (counter == 1))) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((((2 <= counter) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= (2147483645 + (2 * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)))))) && (((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && (3 == v)) && (counter <= 2147483645)) && (A <= 2147483647)) && (0 <= A)) || (((((((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= (2147483645 + (2 * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))))) && (((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && (v == 1)) && (A <= 2147483647)) && (counter == 2))) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((cond != 0) && (counter == 0)) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:45:37,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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