./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/sqrt1-ll_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 623f8e570c67201db9fc7be447d74d083955ca752401303f9fce588b7571c3af --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:09:02,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:09:02,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 21:09:02,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:09:02,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:09:02,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:09:02,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:09:02,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:09:02,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:09:02,485 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:09:02,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:09:02,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:09:02,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:09:02,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:09:02,491 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:09:02,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:09:02,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:09:02,491 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:09:02,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 21:09:02,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:09:02,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:09:02,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:09:02,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:09:02,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:09:02,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:09:02,495 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:09:02,495 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:09:02,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:09:02,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:09:02,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:09:02,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:09:02,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:09:02,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:09:02,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:09:02,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:09:02,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:09:02,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:09:02,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:09:02,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 21:09:02,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 21:09:02,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:09:02,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:09:02,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:09:02,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:09:02,501 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 623f8e570c67201db9fc7be447d74d083955ca752401303f9fce588b7571c3af [2024-10-14 21:09:02,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:09:02,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:09:02,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:09:02,752 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:09:02,753 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:09:02,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound5.c [2024-10-14 21:09:04,121 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:09:04,313 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:09:04,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound5.c [2024-10-14 21:09:04,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a119c81f0/aa4d020d056042d2a5d1261211e417a9/FLAGb050c1316 [2024-10-14 21:09:04,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a119c81f0/aa4d020d056042d2a5d1261211e417a9 [2024-10-14 21:09:04,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:09:04,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:09:04,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:09:04,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:09:04,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:09:04,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:09:04" (1/1) ... [2024-10-14 21:09:04,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6516fdb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04, skipping insertion in model container [2024-10-14 21:09:04,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:09:04" (1/1) ... [2024-10-14 21:09:04,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:09:04,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:09:04,932 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:09:04,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:09:04,977 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:09:04,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04 WrapperNode [2024-10-14 21:09:05,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:09:05,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:09:05,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:09:05,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:09:05,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04" (1/1) ... [2024-10-14 21:09:05,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04" (1/1) ... [2024-10-14 21:09:05,097 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-10-14 21:09:05,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:09:05,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:09:05,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:09:05,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:09:05,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04" (1/1) ... [2024-10-14 21:09:05,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04" (1/1) ... [2024-10-14 21:09:05,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04" (1/1) ... [2024-10-14 21:09:05,142 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 21:09:05,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04" (1/1) ... [2024-10-14 21:09:05,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04" (1/1) ... [2024-10-14 21:09:05,146 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04" (1/1) ... [2024-10-14 21:09:05,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04" (1/1) ... [2024-10-14 21:09:05,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04" (1/1) ... [2024-10-14 21:09:05,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04" (1/1) ... [2024-10-14 21:09:05,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:09:05,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:09:05,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:09:05,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:09:05,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04" (1/1) ... [2024-10-14 21:09:05,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:09:05,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:05,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 21:09:05,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 21:09:05,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:09:05,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 21:09:05,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:09:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:09:05,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 21:09:05,246 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 21:09:05,307 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:09:05,309 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 21:09:05,575 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-14 21:09:05,575 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 21:09:05,604 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 21:09:05,605 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 21:09:05,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:09:05 BoogieIcfgContainer [2024-10-14 21:09:05,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 21:09:05,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 21:09:05,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 21:09:05,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 21:09:05,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:09:04" (1/3) ... [2024-10-14 21:09:05,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1d2e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:09:05, skipping insertion in model container [2024-10-14 21:09:05,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:09:04" (2/3) ... [2024-10-14 21:09:05,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1d2e01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:09:05, skipping insertion in model container [2024-10-14 21:09:05,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:09:05" (3/3) ... [2024-10-14 21:09:05,614 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound5.c [2024-10-14 21:09:05,629 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 21:09:05,630 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-10-14 21:09:05,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 21:09:05,702 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;@246a32a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 21:09:05,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-10-14 21:09:05,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 59 states have (on average 1.9322033898305084) internal successors, (114), 109 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:09:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 21:09:05,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:05,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 21:09:05,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:05,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:05,721 INFO L85 PathProgramCache]: Analyzing trace with hash 179321260, now seen corresponding path program 1 times [2024-10-14 21:09:05,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:05,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38679742] [2024-10-14 21:09:05,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:05,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:09:05,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38679742] [2024-10-14 21:09:05,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38679742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:05,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:09:05,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:09:05,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177003596] [2024-10-14 21:09:05,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:05,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 21:09:05,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:05,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 21:09:05,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 21:09:05,886 INFO L87 Difference]: Start difference. First operand has 117 states, 59 states have (on average 1.9322033898305084) internal successors, (114), 109 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:09:05,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:05,922 INFO L93 Difference]: Finished difference Result 228 states and 255 transitions. [2024-10-14 21:09:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 21:09:05,924 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 21:09:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:05,931 INFO L225 Difference]: With dead ends: 228 [2024-10-14 21:09:05,932 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 21:09:05,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 21:09:05,941 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:05,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:09:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 21:09:05,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-14 21:09:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 58 states have (on average 1.793103448275862) internal successors, (104), 103 states have internal predecessors, (104), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 21:09:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2024-10-14 21:09:05,995 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 5 [2024-10-14 21:09:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:05,996 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2024-10-14 21:09:05,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:09:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2024-10-14 21:09:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 21:09:05,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:05,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 21:09:05,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 21:09:05,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:05,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:05,997 INFO L85 PathProgramCache]: Analyzing trace with hash 179380837, now seen corresponding path program 1 times [2024-10-14 21:09:05,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:05,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873826195] [2024-10-14 21:09:05,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:09:06,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:06,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873826195] [2024-10-14 21:09:06,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873826195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:06,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:09:06,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:09:06,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150645698] [2024-10-14 21:09:06,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:06,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:09:06,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:06,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:09:06,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:09:06,093 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:09:06,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:06,268 INFO L93 Difference]: Finished difference Result 205 states and 214 transitions. [2024-10-14 21:09:06,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:09:06,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 21:09:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:06,272 INFO L225 Difference]: With dead ends: 205 [2024-10-14 21:09:06,272 INFO L226 Difference]: Without dead ends: 185 [2024-10-14 21:09:06,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:09:06,274 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 68 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:06,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 161 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:09:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-14 21:09:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 150. [2024-10-14 21:09:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 94 states have (on average 1.6170212765957446) internal successors, (152), 139 states have internal predecessors, (152), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 21:09:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2024-10-14 21:09:06,300 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 5 [2024-10-14 21:09:06,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:06,300 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2024-10-14 21:09:06,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:09:06,300 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2024-10-14 21:09:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 21:09:06,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:06,302 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] [2024-10-14 21:09:06,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 21:09:06,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:06,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:06,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1083960687, now seen corresponding path program 1 times [2024-10-14 21:09:06,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:06,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592999280] [2024-10-14 21:09:06,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:06,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:09:06,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058286764] [2024-10-14 21:09:06,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:06,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:06,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:06,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:09:06,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 21:09:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:06,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:09:06,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:06,473 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-14 21:09:06,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:09:06,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:06,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592999280] [2024-10-14 21:09:06,476 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:09:06,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058286764] [2024-10-14 21:09:06,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058286764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:06,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:09:06,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:09:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526093604] [2024-10-14 21:09:06,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:06,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:09:06,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:06,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:09:06,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:09:06,482 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-14 21:09:06,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:06,619 INFO L93 Difference]: Finished difference Result 177 states and 198 transitions. [2024-10-14 21:09:06,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:09:06,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 26 [2024-10-14 21:09:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:06,622 INFO L225 Difference]: With dead ends: 177 [2024-10-14 21:09:06,624 INFO L226 Difference]: Without dead ends: 169 [2024-10-14 21:09:06,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-14 21:09:06,625 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:06,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 147 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:09:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-14 21:09:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2024-10-14 21:09:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 104 states have (on average 1.5673076923076923) internal successors, (163), 149 states have internal predecessors, (163), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 21:09:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2024-10-14 21:09:06,646 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 26 [2024-10-14 21:09:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:06,648 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2024-10-14 21:09:06,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-14 21:09:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2024-10-14 21:09:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 21:09:06,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:06,649 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-14 21:09:06,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 21:09:06,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:06,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:06,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:06,851 INFO L85 PathProgramCache]: Analyzing trace with hash 756957147, now seen corresponding path program 1 times [2024-10-14 21:09:06,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:06,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938571101] [2024-10-14 21:09:06,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:06,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:09:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:06,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 21:09:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:06,984 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-14 21:09:06,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:06,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938571101] [2024-10-14 21:09:06,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938571101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:06,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:09:06,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:09:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824009479] [2024-10-14 21:09:06,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:06,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:09:06,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:06,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:09:06,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:09:06,987 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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-14 21:09:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:07,087 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2024-10-14 21:09:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:09:07,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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-14 21:09:07,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:07,089 INFO L225 Difference]: With dead ends: 177 [2024-10-14 21:09:07,090 INFO L226 Difference]: Without dead ends: 167 [2024-10-14 21:09:07,091 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-14 21:09:07,094 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:07,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 161 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:09:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-14 21:09:07,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2024-10-14 21:09:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 107 states have (on average 1.485981308411215) internal successors, (159), 152 states have internal predecessors, (159), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 21:09:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 179 transitions. [2024-10-14 21:09:07,105 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 179 transitions. Word has length 27 [2024-10-14 21:09:07,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:07,106 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 179 transitions. [2024-10-14 21:09:07,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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-14 21:09:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 179 transitions. [2024-10-14 21:09:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 21:09:07,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:07,107 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-14 21:09:07,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 21:09:07,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:07,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:07,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1932139797, now seen corresponding path program 1 times [2024-10-14 21:09:07,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:07,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232308085] [2024-10-14 21:09:07,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:07,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:09:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:07,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 21:09:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:07,239 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-14 21:09:07,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:07,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232308085] [2024-10-14 21:09:07,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232308085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:07,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:09:07,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:09:07,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234159222] [2024-10-14 21:09:07,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:07,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:09:07,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:07,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:09:07,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:09:07,246 INFO L87 Difference]: Start difference. First operand 164 states and 179 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-14 21:09:07,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:07,430 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2024-10-14 21:09:07,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:09:07,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-14 21:09:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:07,432 INFO L225 Difference]: With dead ends: 169 [2024-10-14 21:09:07,432 INFO L226 Difference]: Without dead ends: 167 [2024-10-14 21:09:07,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-14 21:09:07,434 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 47 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:07,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 210 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:09:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-14 21:09:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2024-10-14 21:09:07,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 152 states have internal predecessors, (157), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 21:09:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2024-10-14 21:09:07,453 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 30 [2024-10-14 21:09:07,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:07,453 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2024-10-14 21:09:07,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-14 21:09:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2024-10-14 21:09:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 21:09:07,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:07,455 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] [2024-10-14 21:09:07,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 21:09:07,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:07,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1747126169, now seen corresponding path program 1 times [2024-10-14 21:09:07,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:07,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158903585] [2024-10-14 21:09:07,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:07,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:07,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:09:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:07,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 21:09:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:07,559 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-14 21:09:07,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:07,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158903585] [2024-10-14 21:09:07,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158903585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:07,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:09:07,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:09:07,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826093976] [2024-10-14 21:09:07,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:07,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:09:07,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:07,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:09:07,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:09:07,562 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-14 21:09:07,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:07,676 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2024-10-14 21:09:07,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:09:07,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 34 [2024-10-14 21:09:07,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:07,678 INFO L225 Difference]: With dead ends: 169 [2024-10-14 21:09:07,678 INFO L226 Difference]: Without dead ends: 141 [2024-10-14 21:09:07,679 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-14 21:09:07,679 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 29 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:07,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 143 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:09:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-14 21:09:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-10-14 21:09:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.5348837209302326) internal successors, (132), 131 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 21:09:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2024-10-14 21:09:07,695 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 34 [2024-10-14 21:09:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:07,695 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2024-10-14 21:09:07,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-14 21:09:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2024-10-14 21:09:07,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 21:09:07,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:07,697 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 21:09:07,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 21:09:07,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:07,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:07,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1812886385, now seen corresponding path program 1 times [2024-10-14 21:09:07,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:07,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470101113] [2024-10-14 21:09:07,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:07,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:07,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:09:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:07,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 21:09:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:07,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:09:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:09:07,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:07,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470101113] [2024-10-14 21:09:07,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470101113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:07,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:09:07,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:09:07,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142947849] [2024-10-14 21:09:07,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:07,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:09:07,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:07,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:09:07,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:09:07,825 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:09:07,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:07,951 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2024-10-14 21:09:07,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:09:07,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-10-14 21:09:07,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:07,953 INFO L225 Difference]: With dead ends: 144 [2024-10-14 21:09:07,953 INFO L226 Difference]: Without dead ends: 143 [2024-10-14 21:09:07,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-14 21:09:07,954 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:07,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 206 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:09:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-14 21:09:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2024-10-14 21:09:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.528735632183908) internal successors, (133), 132 states have internal predecessors, (133), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 21:09:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2024-10-14 21:09:07,960 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 47 [2024-10-14 21:09:07,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:07,961 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2024-10-14 21:09:07,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:09:07,961 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2024-10-14 21:09:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 21:09:07,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:07,962 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 21:09:07,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 21:09:07,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:07,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash 364903199, now seen corresponding path program 1 times [2024-10-14 21:09:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:07,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242174939] [2024-10-14 21:09:07,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:07,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:08,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:09:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:08,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 21:09:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:09:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:09:08,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:08,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242174939] [2024-10-14 21:09:08,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242174939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:08,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:09:08,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:09:08,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134273120] [2024-10-14 21:09:08,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:08,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:09:08,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:08,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:09:08,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 21:09:08,091 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:09:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:08,191 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2024-10-14 21:09:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:09:08,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-10-14 21:09:08,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:08,193 INFO L225 Difference]: With dead ends: 144 [2024-10-14 21:09:08,193 INFO L226 Difference]: Without dead ends: 143 [2024-10-14 21:09:08,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-14 21:09:08,197 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:08,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:09:08,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-14 21:09:08,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-10-14 21:09:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 88 states have (on average 1.5227272727272727) internal successors, (134), 133 states have internal predecessors, (134), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 21:09:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2024-10-14 21:09:08,204 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 48 [2024-10-14 21:09:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:08,204 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2024-10-14 21:09:08,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:09:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2024-10-14 21:09:08,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 21:09:08,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:08,206 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-14 21:09:08,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 21:09:08,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:08,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1515342495, now seen corresponding path program 1 times [2024-10-14 21:09:08,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:08,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106817832] [2024-10-14 21:09:08,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:08,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:08,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:09:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:08,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 21:09:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:08,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:09:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:09:08,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:08,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106817832] [2024-10-14 21:09:08,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106817832] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:08,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544912342] [2024-10-14 21:09:08,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:08,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:08,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:08,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:09:08,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 21:09:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:08,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:09:08,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:09:08,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:09:08,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544912342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:08,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:09:08,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-14 21:09:08,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768219467] [2024-10-14 21:09:08,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:08,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 21:09:08,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:08,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 21:09:08,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:09:08,438 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:09:08,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:08,526 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2024-10-14 21:09:08,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 21:09:08,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-10-14 21:09:08,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:08,527 INFO L225 Difference]: With dead ends: 143 [2024-10-14 21:09:08,528 INFO L226 Difference]: Without dead ends: 134 [2024-10-14 21:09:08,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:09:08,530 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 72 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:08,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 129 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:09:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-14 21:09:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-14 21:09:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 124 states have internal predecessors, (125), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 21:09:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2024-10-14 21:09:08,537 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 50 [2024-10-14 21:09:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:08,538 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2024-10-14 21:09:08,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 21:09:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2024-10-14 21:09:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 21:09:08,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:08,539 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-14 21:09:08,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 21:09:08,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-14 21:09:08,744 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:08,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:08,745 INFO L85 PathProgramCache]: Analyzing trace with hash 269022963, now seen corresponding path program 1 times [2024-10-14 21:09:08,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:08,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214870999] [2024-10-14 21:09:08,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:08,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:08,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:09:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:08,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 21:09:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:08,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:09:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:09:08,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:08,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214870999] [2024-10-14 21:09:08,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214870999] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:08,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080203575] [2024-10-14 21:09:08,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:08,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:08,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:08,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:09:08,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 21:09:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:08,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 21:09:08,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:09:08,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 21:09:09,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080203575] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:09,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:09,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-14 21:09:09,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949339938] [2024-10-14 21:09:09,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:09,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 21:09:09,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:09,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 21:09:09,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:09:09,031 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 21:09:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:09,168 INFO L93 Difference]: Finished difference Result 229 states and 258 transitions. [2024-10-14 21:09:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:09:09,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 51 [2024-10-14 21:09:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:09,170 INFO L225 Difference]: With dead ends: 229 [2024-10-14 21:09:09,170 INFO L226 Difference]: Without dead ends: 220 [2024-10-14 21:09:09,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:09:09,171 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 175 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:09,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 219 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:09:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-14 21:09:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 125. [2024-10-14 21:09:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 115 states have internal predecessors, (116), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 21:09:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2024-10-14 21:09:09,178 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 51 [2024-10-14 21:09:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:09,178 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2024-10-14 21:09:09,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.666666666666668) internal successors, (100), 7 states have internal predecessors, (100), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 21:09:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2024-10-14 21:09:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 21:09:09,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:09,179 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-10-14 21:09:09,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 21:09:09,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:09,380 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:09,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:09,381 INFO L85 PathProgramCache]: Analyzing trace with hash -63646801, now seen corresponding path program 1 times [2024-10-14 21:09:09,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:09,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873982865] [2024-10-14 21:09:09,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:09,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:09:09,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1182953036] [2024-10-14 21:09:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:09,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:09,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:09,397 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:09:09,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 21:09:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:09,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:09:09,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:09:09,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 21:09:09,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:09,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873982865] [2024-10-14 21:09:09,674 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:09:09,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182953036] [2024-10-14 21:09:09,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182953036] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:09,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 21:09:09,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-10-14 21:09:09,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662461078] [2024-10-14 21:09:09,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:09,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:09:09,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:09,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:09:09,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:09:09,677 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 21:09:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:09,851 INFO L93 Difference]: Finished difference Result 304 states and 326 transitions. [2024-10-14 21:09:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:09:09,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 64 [2024-10-14 21:09:09,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:09,853 INFO L225 Difference]: With dead ends: 304 [2024-10-14 21:09:09,853 INFO L226 Difference]: Without dead ends: 302 [2024-10-14 21:09:09,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:09:09,854 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 237 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:09,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 306 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:09:09,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-14 21:09:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 202. [2024-10-14 21:09:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 159 states have (on average 1.371069182389937) internal successors, (218), 185 states have internal predecessors, (218), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 21:09:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 248 transitions. [2024-10-14 21:09:09,866 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 248 transitions. Word has length 64 [2024-10-14 21:09:09,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:09,866 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 248 transitions. [2024-10-14 21:09:09,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.8) internal successors, (89), 6 states have internal predecessors, (89), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-14 21:09:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 248 transitions. [2024-10-14 21:09:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 21:09:09,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:09,868 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:09:09,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 21:09:10,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:10,073 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:10,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:10,073 INFO L85 PathProgramCache]: Analyzing trace with hash -906332907, now seen corresponding path program 1 times [2024-10-14 21:09:10,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:10,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543461293] [2024-10-14 21:09:10,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:10,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 21:09:10,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728309772] [2024-10-14 21:09:10,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:10,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:10,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:10,088 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:09:10,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 21:09:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:10,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:09:10,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:09:10,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:09:10,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:10,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543461293] [2024-10-14 21:09:10,360 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 21:09:10,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728309772] [2024-10-14 21:09:10,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728309772] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:10,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 21:09:10,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-10-14 21:09:10,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118133687] [2024-10-14 21:09:10,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:10,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:09:10,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:10,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:09:10,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:09:10,362 INFO L87 Difference]: Start difference. First operand 202 states and 248 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-14 21:09:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:10,610 INFO L93 Difference]: Finished difference Result 262 states and 325 transitions. [2024-10-14 21:09:10,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:09:10,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 71 [2024-10-14 21:09:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:10,613 INFO L225 Difference]: With dead ends: 262 [2024-10-14 21:09:10,613 INFO L226 Difference]: Without dead ends: 254 [2024-10-14 21:09:10,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-14 21:09:10,615 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 218 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:10,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 210 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:09:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-14 21:09:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 198. [2024-10-14 21:09:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 161 states have (on average 1.2608695652173914) internal successors, (203), 180 states have internal predecessors, (203), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 21:09:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 235 transitions. [2024-10-14 21:09:10,631 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 235 transitions. Word has length 71 [2024-10-14 21:09:10,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:10,632 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 235 transitions. [2024-10-14 21:09:10,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-14 21:09:10,632 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 235 transitions. [2024-10-14 21:09:10,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 21:09:10,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:10,634 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:09:10,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 21:09:10,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 21:09:10,835 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:10,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:10,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1968451031, now seen corresponding path program 1 times [2024-10-14 21:09:10,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:10,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736503667] [2024-10-14 21:09:10,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:10,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:10,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:09:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:10,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 21:09:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:10,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:09:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:10,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:09:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:10,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 21:09:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:09:10,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:10,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736503667] [2024-10-14 21:09:10,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736503667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:10,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223340156] [2024-10-14 21:09:10,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:10,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:10,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:10,959 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:09:10,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 21:09:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:11,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:09:11,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:09:11,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:09:11,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223340156] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:11,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:11,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-14 21:09:11,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3552081] [2024-10-14 21:09:11,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:11,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 21:09:11,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:11,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 21:09:11,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:09:11,280 INFO L87 Difference]: Start difference. First operand 198 states and 235 transitions. Second operand has 10 states, 9 states have (on average 14.0) internal successors, (126), 10 states have internal predecessors, (126), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-14 21:09:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:11,452 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2024-10-14 21:09:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:09:11,452 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.0) internal successors, (126), 10 states have internal predecessors, (126), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 72 [2024-10-14 21:09:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:11,453 INFO L225 Difference]: With dead ends: 198 [2024-10-14 21:09:11,453 INFO L226 Difference]: Without dead ends: 195 [2024-10-14 21:09:11,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-10-14 21:09:11,454 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 90 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:11,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 180 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:09:11,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-14 21:09:11,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-10-14 21:09:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 161 states have (on average 1.2173913043478262) internal successors, (196), 177 states have internal predecessors, (196), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 21:09:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 228 transitions. [2024-10-14 21:09:11,467 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 228 transitions. Word has length 72 [2024-10-14 21:09:11,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:11,468 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 228 transitions. [2024-10-14 21:09:11,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.0) internal successors, (126), 10 states have internal predecessors, (126), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-14 21:09:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 228 transitions. [2024-10-14 21:09:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 21:09:11,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:11,469 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:09:11,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 21:09:11,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:11,670 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:11,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:11,670 INFO L85 PathProgramCache]: Analyzing trace with hash 892439895, now seen corresponding path program 1 times [2024-10-14 21:09:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:11,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859631317] [2024-10-14 21:09:11,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:11,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:11,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:09:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:11,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 21:09:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:11,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:09:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:11,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:09:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 21:09:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:09:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859631317] [2024-10-14 21:09:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859631317] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:11,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305076980] [2024-10-14 21:09:11,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:11,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:11,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:11,790 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:09:11,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 21:09:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:11,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:09:11,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:09:11,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:09:12,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305076980] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:12,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:12,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-14 21:09:12,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184819324] [2024-10-14 21:09:12,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:12,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 21:09:12,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:12,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 21:09:12,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:09:12,102 INFO L87 Difference]: Start difference. First operand 195 states and 228 transitions. Second operand has 10 states, 9 states have (on average 14.222222222222221) internal successors, (128), 10 states have internal predecessors, (128), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-14 21:09:12,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:12,349 INFO L93 Difference]: Finished difference Result 221 states and 260 transitions. [2024-10-14 21:09:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:09:12,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.222222222222221) internal successors, (128), 10 states have internal predecessors, (128), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 73 [2024-10-14 21:09:12,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:12,351 INFO L225 Difference]: With dead ends: 221 [2024-10-14 21:09:12,351 INFO L226 Difference]: Without dead ends: 212 [2024-10-14 21:09:12,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:09:12,352 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 96 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:12,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 246 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:09:12,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-14 21:09:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 188. [2024-10-14 21:09:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 161 states have (on average 1.1180124223602483) internal successors, (180), 170 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 21:09:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 212 transitions. [2024-10-14 21:09:12,363 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 212 transitions. Word has length 73 [2024-10-14 21:09:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:12,364 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 212 transitions. [2024-10-14 21:09:12,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.222222222222221) internal successors, (128), 10 states have internal predecessors, (128), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-14 21:09:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 212 transitions. [2024-10-14 21:09:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 21:09:12,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:12,368 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:09:12,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 21:09:12,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:12,569 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:12,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:12,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1358717543, now seen corresponding path program 1 times [2024-10-14 21:09:12,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:12,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146845344] [2024-10-14 21:09:12,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:12,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:12,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:09:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:12,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 21:09:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:12,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:09:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:12,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:09:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:12,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 21:09:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:09:12,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:12,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146845344] [2024-10-14 21:09:12,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146845344] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:12,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230611739] [2024-10-14 21:09:12,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:12,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:12,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:12,745 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:09:12,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 21:09:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:12,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 21:09:12,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-14 21:09:13,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:09:13,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230611739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:09:13,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:09:13,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-10-14 21:09:13,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498811308] [2024-10-14 21:09:13,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:09:13,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:09:13,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:13,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:09:13,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:09:13,002 INFO L87 Difference]: Start difference. First operand 188 states and 212 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 21:09:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:13,119 INFO L93 Difference]: Finished difference Result 188 states and 212 transitions. [2024-10-14 21:09:13,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 21:09:13,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2024-10-14 21:09:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:13,121 INFO L225 Difference]: With dead ends: 188 [2024-10-14 21:09:13,121 INFO L226 Difference]: Without dead ends: 158 [2024-10-14 21:09:13,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:09:13,122 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 90 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:13,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 108 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:09:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-14 21:09:13,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-10-14 21:09:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 142 states have internal predecessors, (144), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 21:09:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 172 transitions. [2024-10-14 21:09:13,132 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 172 transitions. Word has length 75 [2024-10-14 21:09:13,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:13,132 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 172 transitions. [2024-10-14 21:09:13,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 21:09:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 172 transitions. [2024-10-14 21:09:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 21:09:13,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:13,134 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2024-10-14 21:09:13,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 21:09:13,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 21:09:13,335 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:13,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:13,336 INFO L85 PathProgramCache]: Analyzing trace with hash 51405215, now seen corresponding path program 1 times [2024-10-14 21:09:13,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:13,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499533350] [2024-10-14 21:09:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:13,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:13,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:09:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:13,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 21:09:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:13,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:09:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:13,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:09:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:13,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 21:09:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:13,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 21:09:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:13,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 21:09:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:13,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 21:09:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:13,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 21:09:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 21:09:13,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:13,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499533350] [2024-10-14 21:09:13,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499533350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:13,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690726820] [2024-10-14 21:09:13,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:13,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:13,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:13,542 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:09:13,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 21:09:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:13,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 21:09:13,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 21:09:13,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-14 21:09:14,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690726820] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:14,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:14,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-10-14 21:09:14,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856867106] [2024-10-14 21:09:14,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:14,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 21:09:14,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:14,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 21:09:14,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2024-10-14 21:09:14,183 INFO L87 Difference]: Start difference. First operand 158 states and 172 transitions. Second operand has 20 states, 19 states have (on average 14.631578947368421) internal successors, (278), 20 states have internal predecessors, (278), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2024-10-14 21:09:14,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:14,485 INFO L93 Difference]: Finished difference Result 245 states and 273 transitions. [2024-10-14 21:09:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 21:09:14,485 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 14.631578947368421) internal successors, (278), 20 states have internal predecessors, (278), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 138 [2024-10-14 21:09:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:14,487 INFO L225 Difference]: With dead ends: 245 [2024-10-14 21:09:14,487 INFO L226 Difference]: Without dead ends: 244 [2024-10-14 21:09:14,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2024-10-14 21:09:14,488 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:14,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 155 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:09:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-14 21:09:14,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2024-10-14 21:09:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 216 states have (on average 1.0509259259259258) internal successors, (227), 219 states have internal predecessors, (227), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 21:09:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 269 transitions. [2024-10-14 21:09:14,502 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 269 transitions. Word has length 138 [2024-10-14 21:09:14,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:14,502 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 269 transitions. [2024-10-14 21:09:14,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 14.631578947368421) internal successors, (278), 20 states have internal predecessors, (278), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2024-10-14 21:09:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 269 transitions. [2024-10-14 21:09:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-14 21:09:14,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:14,504 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2024-10-14 21:09:14,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 21:09:14,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 21:09:14,705 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:14,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:14,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1705604823, now seen corresponding path program 2 times [2024-10-14 21:09:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:14,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367253599] [2024-10-14 21:09:14,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:14,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:14,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:09:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:14,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 21:09:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:14,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:09:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:14,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:09:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:14,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 21:09:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:14,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 21:09:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:14,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 21:09:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:14,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 21:09:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:14,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 21:09:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:14,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 21:09:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:14,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-14 21:09:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 21:09:14,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:14,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367253599] [2024-10-14 21:09:14,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367253599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:14,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560329698] [2024-10-14 21:09:14,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:09:14,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:14,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:14,968 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:09:14,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 21:09:15,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:09:15,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:09:15,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 21:09:15,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 21:09:15,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:15,709 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 21:09:15,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560329698] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:15,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:15,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2024-10-14 21:09:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704135456] [2024-10-14 21:09:15,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:15,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 21:09:15,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:15,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 21:09:15,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2024-10-14 21:09:15,712 INFO L87 Difference]: Start difference. First operand 242 states and 269 transitions. Second operand has 22 states, 21 states have (on average 14.666666666666666) internal successors, (308), 22 states have internal predecessors, (308), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-14 21:09:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:16,133 INFO L93 Difference]: Finished difference Result 264 states and 291 transitions. [2024-10-14 21:09:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 21:09:16,134 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 14.666666666666666) internal successors, (308), 22 states have internal predecessors, (308), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 163 [2024-10-14 21:09:16,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:16,136 INFO L225 Difference]: With dead ends: 264 [2024-10-14 21:09:16,137 INFO L226 Difference]: Without dead ends: 263 [2024-10-14 21:09:16,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2024-10-14 21:09:16,138 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 90 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:16,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 292 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:09:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-14 21:09:16,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2024-10-14 21:09:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 231 states have (on average 1.0432900432900434) internal successors, (241), 234 states have internal predecessors, (241), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 21:09:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 287 transitions. [2024-10-14 21:09:16,152 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 287 transitions. Word has length 163 [2024-10-14 21:09:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:16,153 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 287 transitions. [2024-10-14 21:09:16,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 14.666666666666666) internal successors, (308), 22 states have internal predecessors, (308), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-14 21:09:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 287 transitions. [2024-10-14 21:09:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 21:09:16,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:09:16,155 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-10-14 21:09:16,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-14 21:09:16,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 21:09:16,356 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2024-10-14 21:09:16,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:09:16,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2110938291, now seen corresponding path program 2 times [2024-10-14 21:09:16,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:09:16,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487599434] [2024-10-14 21:09:16,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:09:16,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:09:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:16,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 21:09:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:16,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 21:09:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:16,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 21:09:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:16,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 21:09:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:16,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 21:09:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:16,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 21:09:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:16,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 21:09:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:16,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 21:09:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:16,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-14 21:09:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:16,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 21:09:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:16,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-14 21:09:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:16,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-14 21:09:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:16,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-14 21:09:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:09:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 66 proven. 180 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 21:09:16,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:09:16,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487599434] [2024-10-14 21:09:16,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487599434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:09:16,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102609845] [2024-10-14 21:09:16,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:09:16,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:09:16,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:09:16,748 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:09:16,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 21:09:16,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:09:16,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:09:16,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 21:09:16,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:09:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 213 proven. 81 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 21:09:17,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:09:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 66 proven. 180 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-14 21:09:18,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102609845] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:09:18,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:09:18,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2024-10-14 21:09:18,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329949767] [2024-10-14 21:09:18,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:09:18,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 21:09:18,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:09:18,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 21:09:18,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2024-10-14 21:09:18,179 INFO L87 Difference]: Start difference. First operand 259 states and 287 transitions. Second operand has 29 states, 29 states have (on average 12.89655172413793) internal successors, (374), 29 states have internal predecessors, (374), 13 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2024-10-14 21:09:18,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:09:18,411 INFO L93 Difference]: Finished difference Result 263 states and 290 transitions. [2024-10-14 21:09:18,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 21:09:18,412 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 12.89655172413793) internal successors, (374), 29 states have internal predecessors, (374), 13 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) Word has length 199 [2024-10-14 21:09:18,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:09:18,413 INFO L225 Difference]: With dead ends: 263 [2024-10-14 21:09:18,413 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 21:09:18,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2024-10-14 21:09:18,415 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:09:18,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 378 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:09:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 21:09:18,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 21:09:18,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:09:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 21:09:18,416 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 199 [2024-10-14 21:09:18,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:09:18,416 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 21:09:18,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 12.89655172413793) internal successors, (374), 29 states have internal predecessors, (374), 13 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2024-10-14 21:09:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 21:09:18,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 21:09:18,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 50 remaining) [2024-10-14 21:09:18,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 50 remaining) [2024-10-14 21:09:18,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 50 remaining) [2024-10-14 21:09:18,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 50 remaining) [2024-10-14 21:09:18,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 50 remaining) [2024-10-14 21:09:18,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 50 remaining) [2024-10-14 21:09:18,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 50 remaining) [2024-10-14 21:09:18,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 50 remaining) [2024-10-14 21:09:18,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 50 remaining) [2024-10-14 21:09:18,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 50 remaining) [2024-10-14 21:09:18,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 50 remaining) [2024-10-14 21:09:18,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 50 remaining) [2024-10-14 21:09:18,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 50 remaining) [2024-10-14 21:09:18,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 50 remaining) [2024-10-14 21:09:18,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 50 remaining) [2024-10-14 21:09:18,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 50 remaining) [2024-10-14 21:09:18,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 50 remaining) [2024-10-14 21:09:18,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 50 remaining) [2024-10-14 21:09:18,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 50 remaining) [2024-10-14 21:09:18,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 50 remaining) [2024-10-14 21:09:18,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 50 remaining) [2024-10-14 21:09:18,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 50 remaining) [2024-10-14 21:09:18,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 50 remaining) [2024-10-14 21:09:18,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 50 remaining) [2024-10-14 21:09:18,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 50 remaining) [2024-10-14 21:09:18,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 50 remaining) [2024-10-14 21:09:18,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 50 remaining) [2024-10-14 21:09:18,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 50 remaining) [2024-10-14 21:09:18,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 50 remaining) [2024-10-14 21:09:18,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 50 remaining) [2024-10-14 21:09:18,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 50 remaining) [2024-10-14 21:09:18,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 50 remaining) [2024-10-14 21:09:18,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 50 remaining) [2024-10-14 21:09:18,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 50 remaining) [2024-10-14 21:09:18,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 50 remaining) [2024-10-14 21:09:18,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 50 remaining) [2024-10-14 21:09:18,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 50 remaining) [2024-10-14 21:09:18,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 50 remaining) [2024-10-14 21:09:18,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 50 remaining) [2024-10-14 21:09:18,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 50 remaining) [2024-10-14 21:09:18,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 50 remaining) [2024-10-14 21:09:18,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 50 remaining) [2024-10-14 21:09:18,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 50 remaining) [2024-10-14 21:09:18,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 50 remaining) [2024-10-14 21:09:18,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 50 remaining) [2024-10-14 21:09:18,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 50 remaining) [2024-10-14 21:09:18,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 50 remaining) [2024-10-14 21:09:18,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 50 remaining) [2024-10-14 21:09:18,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 50 remaining) [2024-10-14 21:09:18,425 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 50 remaining) [2024-10-14 21:09:18,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-14 21:09:18,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 21:09:18,629 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:09:18,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 21:09:19,163 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 21:09:19,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:09:19 BoogieIcfgContainer [2024-10-14 21:09:19,187 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 21:09:19,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 21:09:19,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 21:09:19,188 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 21:09:19,188 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:09:05" (3/4) ... [2024-10-14 21:09:19,190 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 21:09:19,194 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 21:09:19,200 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-14 21:09:19,200 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 21:09:19,201 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 21:09:19,201 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 21:09:19,306 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 21:09:19,306 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 21:09:19,306 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 21:09:19,307 INFO L158 Benchmark]: Toolchain (without parser) took 14610.29ms. Allocated memory was 172.0MB in the beginning and 228.6MB in the end (delta: 56.6MB). Free memory was 104.0MB in the beginning and 66.6MB in the end (delta: 37.4MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. [2024-10-14 21:09:19,307 INFO L158 Benchmark]: CDTParser took 1.66ms. Allocated memory is still 172.0MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:09:19,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.75ms. Allocated memory is still 172.0MB. Free memory was 103.8MB in the beginning and 144.5MB in the end (delta: -40.8MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2024-10-14 21:09:19,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.12ms. Allocated memory is still 172.0MB. Free memory was 144.5MB in the beginning and 142.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 21:09:19,312 INFO L158 Benchmark]: Boogie Preprocessor took 64.37ms. Allocated memory is still 172.0MB. Free memory was 142.4MB in the beginning and 141.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:09:19,312 INFO L158 Benchmark]: RCFGBuilder took 443.01ms. Allocated memory is still 172.0MB. Free memory was 140.3MB in the beginning and 120.8MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 21:09:19,312 INFO L158 Benchmark]: TraceAbstraction took 13579.56ms. Allocated memory was 172.0MB in the beginning and 228.6MB in the end (delta: 56.6MB). Free memory was 120.1MB in the beginning and 72.9MB in the end (delta: 47.2MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. [2024-10-14 21:09:19,312 INFO L158 Benchmark]: Witness Printer took 118.70ms. Allocated memory is still 228.6MB. Free memory was 72.9MB in the beginning and 66.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 21:09:19,314 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.66ms. Allocated memory is still 172.0MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.75ms. Allocated memory is still 172.0MB. Free memory was 103.8MB in the beginning and 144.5MB in the end (delta: -40.8MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.12ms. Allocated memory is still 172.0MB. Free memory was 144.5MB in the beginning and 142.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.37ms. Allocated memory is still 172.0MB. Free memory was 142.4MB in the beginning and 141.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 443.01ms. Allocated memory is still 172.0MB. Free memory was 140.3MB in the beginning and 120.8MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13579.56ms. Allocated memory was 172.0MB in the beginning and 228.6MB in the end (delta: 56.6MB). Free memory was 120.1MB in the beginning and 72.9MB in the end (delta: 47.2MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. * Witness Printer took 118.70ms. Allocated memory is still 228.6MB. Free memory was 72.9MB in the beginning and 66.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: 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: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: 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: 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: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 18, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1354 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1301 mSDsluCounter, 3520 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2198 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2638 IncrementalHoareTripleChecker+Invalid, 2813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 1322 mSDtfsCounter, 2638 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2009 GetRequests, 1873 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=259occurred in iteration=17, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 331 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 2160 NumberOfCodeBlocks, 2160 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2796 ConstructedInterpolants, 0 QuantifiedInterpolants, 13415 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1661 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 34 InterpolantComputations, 10 PerfectInterpolantSequences, 2894/4265 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 50 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((5 == t) && (1 <= a)) && (9 == s)) && (n <= 5)) && (0 <= n)) && ((((__int128) a * a) + ((__int128) a * 4)) <= 9223372036854775803)) || (((((3 == t) && (a == 1)) && (s == 4)) && (n <= 5)) && (0 <= n))) || (((((t == 1) && (a == 0)) && (n <= 5)) && (0 <= n)) && (s == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-14 21:09:19,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE