./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-09 12:10:56,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 12:10:56,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 12:10:56,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 12:10:56,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 12:10:56,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 12:10:56,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 12:10:56,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 12:10:56,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 12:10:56,933 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 12:10:56,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 12:10:56,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 12:10:56,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 12:10:56,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 12:10:56,940 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 12:10:56,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 12:10:56,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 12:10:56,941 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 12:10:56,941 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 12:10:56,941 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 12:10:56,941 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 12:10:56,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 12:10:56,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 12:10:56,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 12:10:56,945 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 12:10:56,945 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 12:10:56,945 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 12:10:56,945 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 12:10:56,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 12:10:56,946 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 12:10:56,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 12:10:56,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 12:10:56,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 12:10:56,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 12:10:56,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:10:56,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 12:10:56,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 12:10:56,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 12:10:56,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 12:10:56,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 12:10:56,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 12:10:56,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 12:10:56,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 12:10:56,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 12:10:56,951 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-11-09 12:10:57,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 12:10:57,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 12:10:57,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 12:10:57,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 12:10:57,224 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 12:10:57,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound5.c [2024-11-09 12:10:58,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 12:10:58,823 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 12:10:58,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound5.c [2024-11-09 12:10:58,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb3707e3/96a512043e954fa79bc77820da68d33f/FLAG2802fd071 [2024-11-09 12:10:58,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb3707e3/96a512043e954fa79bc77820da68d33f [2024-11-09 12:10:58,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 12:10:58,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 12:10:58,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 12:10:58,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 12:10:58,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 12:10:58,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:10:58" (1/1) ... [2024-11-09 12:10:58,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c9a7cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:58, skipping insertion in model container [2024-11-09 12:10:58,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:10:58" (1/1) ... [2024-11-09 12:10:58,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 12:10:59,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:10:59,096 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 12:10:59,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:10:59,143 INFO L204 MainTranslator]: Completed translation [2024-11-09 12:10:59,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:59 WrapperNode [2024-11-09 12:10:59,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 12:10:59,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 12:10:59,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 12:10:59,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 12:10:59,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:59" (1/1) ... [2024-11-09 12:10:59,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:59" (1/1) ... [2024-11-09 12:10:59,199 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2024-11-09 12:10:59,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 12:10:59,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 12:10:59,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 12:10:59,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 12:10:59,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:59" (1/1) ... [2024-11-09 12:10:59,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:59" (1/1) ... [2024-11-09 12:10:59,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:59" (1/1) ... [2024-11-09 12:10:59,229 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-11-09 12:10:59,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:59" (1/1) ... [2024-11-09 12:10:59,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:59" (1/1) ... [2024-11-09 12:10:59,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:59" (1/1) ... [2024-11-09 12:10:59,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:59" (1/1) ... [2024-11-09 12:10:59,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:59" (1/1) ... [2024-11-09 12:10:59,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:59" (1/1) ... [2024-11-09 12:10:59,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 12:10:59,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 12:10:59,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 12:10:59,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 12:10:59,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:59" (1/1) ... [2024-11-09 12:10:59,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:10:59,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:10:59,287 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-11-09 12:10:59,301 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-11-09 12:10:59,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 12:10:59,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 12:10:59,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 12:10:59,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 12:10:59,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 12:10:59,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 12:10:59,410 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 12:10:59,412 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 12:10:59,785 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-09 12:10:59,785 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 12:10:59,809 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 12:10:59,812 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 12:10:59,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:10:59 BoogieIcfgContainer [2024-11-09 12:10:59,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 12:10:59,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 12:10:59,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 12:10:59,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 12:10:59,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:10:58" (1/3) ... [2024-11-09 12:10:59,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1fb0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:10:59, skipping insertion in model container [2024-11-09 12:10:59,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:10:59" (2/3) ... [2024-11-09 12:10:59,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1fb0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:10:59, skipping insertion in model container [2024-11-09 12:10:59,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:10:59" (3/3) ... [2024-11-09 12:10:59,824 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound5.c [2024-11-09 12:10:59,840 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 12:10:59,840 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-11-09 12:10:59,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 12:10:59,900 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;@2cd4d062, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 12:10:59,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-09 12:10:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 64 states have (on average 1.859375) internal successors, (119), 114 states have internal predecessors, (119), 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-11-09 12:10:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 12:10:59,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:10:59,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 12:10:59,914 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-11-09 12:10:59,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:10:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash 889508909, now seen corresponding path program 1 times [2024-11-09 12:10:59,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:10:59,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967768033] [2024-11-09 12:10:59,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:10:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:11:00,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:00,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967768033] [2024-11-09 12:11:00,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967768033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:11:00,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:11:00,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:11:00,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462536436] [2024-11-09 12:11:00,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:11:00,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 12:11:00,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:00,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 12:11:00,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 12:11:00,085 INFO L87 Difference]: Start difference. First operand has 122 states, 64 states have (on average 1.859375) internal successors, (119), 114 states have internal predecessors, (119), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-09 12:11:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:00,122 INFO L93 Difference]: Finished difference Result 236 states and 263 transitions. [2024-11-09 12:11:00,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 12:11:00,124 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-11-09 12:11:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:00,130 INFO L225 Difference]: With dead ends: 236 [2024-11-09 12:11:00,130 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 12:11:00,133 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-11-09 12:11:00,137 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:00,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:11:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 12:11:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 12:11:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 59 states have (on average 1.7796610169491525) internal successors, (105), 104 states have internal predecessors, (105), 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-11-09 12:11:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2024-11-09 12:11:00,177 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 6 [2024-11-09 12:11:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:00,180 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2024-11-09 12:11:00,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-09 12:11:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2024-11-09 12:11:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 12:11:00,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:00,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 12:11:00,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 12:11:00,182 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-11-09 12:11:00,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash 889568486, now seen corresponding path program 1 times [2024-11-09 12:11:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:00,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794848062] [2024-11-09 12:11:00,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:00,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:11:00,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:00,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794848062] [2024-11-09 12:11:00,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794848062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:11:00,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:11:00,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:11:00,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917256258] [2024-11-09 12:11:00,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:11:00,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:11:00,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:00,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:11:00,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:11:00,272 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-09 12:11:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:00,420 INFO L93 Difference]: Finished difference Result 206 states and 215 transitions. [2024-11-09 12:11:00,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:11:00,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-09 12:11:00,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:00,423 INFO L225 Difference]: With dead ends: 206 [2024-11-09 12:11:00,423 INFO L226 Difference]: Without dead ends: 186 [2024-11-09 12:11:00,424 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-11-09 12:11:00,428 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:00,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 164 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:11:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-09 12:11:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 151. [2024-11-09 12:11:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 140 states have internal predecessors, (153), 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-11-09 12:11:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2024-11-09 12:11:00,458 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 171 transitions. Word has length 6 [2024-11-09 12:11:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:00,458 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 171 transitions. [2024-11-09 12:11:00,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-09 12:11:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2024-11-09 12:11:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 12:11:00,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:00,460 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-11-09 12:11:00,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 12:11:00,461 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-11-09 12:11:00,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1295434416, now seen corresponding path program 1 times [2024-11-09 12:11:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:00,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326782017] [2024-11-09 12:11:00,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:11:00,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [599315143] [2024-11-09 12:11:00,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:00,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:00,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:00,544 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-11-09 12:11:00,552 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-11-09 12:11:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:00,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:11:00,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:11:00,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:11:00,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:00,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326782017] [2024-11-09 12:11:00,717 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:11:00,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599315143] [2024-11-09 12:11:00,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599315143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:11:00,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:11:00,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:11:00,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546410579] [2024-11-09 12:11:00,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:11:00,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:11:00,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:00,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:11:00,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:11:00,730 INFO L87 Difference]: Start difference. First operand 151 states and 171 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-11-09 12:11:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:00,877 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2024-11-09 12:11:00,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:11:00,878 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-11-09 12:11:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:00,881 INFO L225 Difference]: With dead ends: 178 [2024-11-09 12:11:00,883 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 12:11:00,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-11-09 12:11:00,884 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 41 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:00,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 150 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:11:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 12:11:00,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2024-11-09 12:11:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 105 states have (on average 1.561904761904762) internal successors, (164), 150 states have internal predecessors, (164), 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-11-09 12:11:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 184 transitions. [2024-11-09 12:11:00,896 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 184 transitions. Word has length 27 [2024-11-09 12:11:00,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:00,897 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 184 transitions. [2024-11-09 12:11:00,897 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-11-09 12:11:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 184 transitions. [2024-11-09 12:11:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 12:11:00,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:00,898 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] [2024-11-09 12:11:00,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 12:11:01,102 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-11-09 12:11:01,103 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-11-09 12:11:01,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:01,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1503761308, now seen corresponding path program 1 times [2024-11-09 12:11:01,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:01,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123015507] [2024-11-09 12:11:01,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:01,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:01,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:11:01,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:01,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123015507] [2024-11-09 12:11:01,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123015507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:11:01,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:11:01,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:11:01,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146017709] [2024-11-09 12:11:01,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:11:01,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:11:01,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:01,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:11:01,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:11:01,223 INFO L87 Difference]: Start difference. First operand 162 states and 184 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-11-09 12:11:01,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:01,343 INFO L93 Difference]: Finished difference Result 178 states and 195 transitions. [2024-11-09 12:11:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:11:01,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 28 [2024-11-09 12:11:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:01,345 INFO L225 Difference]: With dead ends: 178 [2024-11-09 12:11:01,345 INFO L226 Difference]: Without dead ends: 168 [2024-11-09 12:11:01,346 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-11-09 12:11:01,347 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 38 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:01,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 164 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:11:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-09 12:11:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2024-11-09 12:11:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 108 states have (on average 1.4814814814814814) internal successors, (160), 153 states have internal predecessors, (160), 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-11-09 12:11:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 180 transitions. [2024-11-09 12:11:01,369 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 180 transitions. Word has length 28 [2024-11-09 12:11:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:01,369 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 180 transitions. [2024-11-09 12:11:01,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-11-09 12:11:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 180 transitions. [2024-11-09 12:11:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 12:11:01,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:01,371 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:11:01,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 12:11:01,371 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-11-09 12:11:01,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2044306868, now seen corresponding path program 1 times [2024-11-09 12:11:01,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:01,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26464619] [2024-11-09 12:11:01,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:01,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:01,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:01,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:11:01,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:01,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26464619] [2024-11-09 12:11:01,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26464619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:11:01,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:11:01,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:11:01,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212725488] [2024-11-09 12:11:01,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:11:01,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:11:01,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:01,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:11:01,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:11:01,506 INFO L87 Difference]: Start difference. First operand 165 states and 180 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:11:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:01,626 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2024-11-09 12:11:01,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:11:01,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-09 12:11:01,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:01,628 INFO L225 Difference]: With dead ends: 170 [2024-11-09 12:11:01,628 INFO L226 Difference]: Without dead ends: 168 [2024-11-09 12:11:01,629 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-11-09 12:11:01,630 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 80 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:01,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 156 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:11:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-09 12:11:01,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2024-11-09 12:11:01,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 108 states have (on average 1.462962962962963) internal successors, (158), 153 states have internal predecessors, (158), 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-11-09 12:11:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2024-11-09 12:11:01,647 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 31 [2024-11-09 12:11:01,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:01,648 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2024-11-09 12:11:01,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 12:11:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2024-11-09 12:11:01,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 12:11:01,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:01,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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:11:01,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 12:11:01,650 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-11-09 12:11:01,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:01,651 INFO L85 PathProgramCache]: Analyzing trace with hash 76490936, now seen corresponding path program 1 times [2024-11-09 12:11:01,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:01,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457770675] [2024-11-09 12:11:01,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:01,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:01,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:01,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:11:01,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:01,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457770675] [2024-11-09 12:11:01,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457770675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:11:01,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:11:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:11:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322730471] [2024-11-09 12:11:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:11:01,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:11:01,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:01,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:11:01,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:11:01,783 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-11-09 12:11:01,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:01,901 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2024-11-09 12:11:01,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:11:01,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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 35 [2024-11-09 12:11:01,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:01,903 INFO L225 Difference]: With dead ends: 170 [2024-11-09 12:11:01,903 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 12:11:01,903 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-11-09 12:11:01,904 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:01,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 146 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:11:01,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 12:11:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-09 12:11:01,919 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-11-09 12:11:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2024-11-09 12:11:01,920 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 35 [2024-11-09 12:11:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:01,924 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2024-11-09 12:11:01,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-11-09 12:11:01,925 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2024-11-09 12:11:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 12:11:01,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:01,926 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-11-09 12:11:01,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 12:11:01,926 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-11-09 12:11:01,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:01,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1341873330, now seen corresponding path program 1 times [2024-11-09 12:11:01,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:01,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690852246] [2024-11-09 12:11:01,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:01,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:02,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:02,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:11:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:11:02,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:02,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690852246] [2024-11-09 12:11:02,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690852246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:11:02,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:11:02,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:11:02,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150059577] [2024-11-09 12:11:02,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:11:02,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:11:02,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:02,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:11:02,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:11:02,084 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-11-09 12:11:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:02,211 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2024-11-09 12:11:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:11:02,212 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-11-09 12:11:02,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:02,214 INFO L225 Difference]: With dead ends: 145 [2024-11-09 12:11:02,214 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 12:11:02,215 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-11-09 12:11:02,215 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:02,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 210 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:11:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 12:11:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-09 12:11:02,225 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-11-09 12:11:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2024-11-09 12:11:02,226 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 48 [2024-11-09 12:11:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:02,227 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2024-11-09 12:11:02,227 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-11-09 12:11:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2024-11-09 12:11:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 12:11:02,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:02,229 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, 1] [2024-11-09 12:11:02,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 12:11:02,229 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-11-09 12:11:02,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:02,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1351599618, now seen corresponding path program 1 times [2024-11-09 12:11:02,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:02,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174045194] [2024-11-09 12:11:02,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:02,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:02,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:02,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:02,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:11:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:02,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:11:02,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:02,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174045194] [2024-11-09 12:11:02,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174045194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:11:02,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:11:02,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 12:11:02,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610679329] [2024-11-09 12:11:02,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:11:02,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:11:02,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:02,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:11:02,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 12:11:02,336 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-11-09 12:11:02,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:02,459 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2024-11-09 12:11:02,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:11:02,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 49 [2024-11-09 12:11:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:02,460 INFO L225 Difference]: With dead ends: 145 [2024-11-09 12:11:02,461 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 12:11:02,461 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-11-09 12:11:02,462 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:02,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:11:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 12:11:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-09 12:11:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 134 states have internal predecessors, (135), 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-11-09 12:11:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 151 transitions. [2024-11-09 12:11:02,469 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 151 transitions. Word has length 49 [2024-11-09 12:11:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:02,469 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 151 transitions. [2024-11-09 12:11:02,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-11-09 12:11:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2024-11-09 12:11:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 12:11:02,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:02,470 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, 1] [2024-11-09 12:11:02,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 12:11:02,474 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-11-09 12:11:02,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:02,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1807107968, now seen corresponding path program 1 times [2024-11-09 12:11:02,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:02,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361052561] [2024-11-09 12:11:02,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:02,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:02,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:02,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:02,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:11:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:02,536 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:11:02,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:02,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361052561] [2024-11-09 12:11:02,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361052561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:11:02,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101597385] [2024-11-09 12:11:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:02,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:02,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:02,539 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-11-09 12:11:02,540 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-11-09 12:11:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:02,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:11:02,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:11:02,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:11:02,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101597385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:11:02,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:11:02,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-09 12:11:02,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100495724] [2024-11-09 12:11:02,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:11:02,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:11:02,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:02,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:11:02,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:11:02,701 INFO L87 Difference]: Start difference. First operand 144 states and 151 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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-11-09 12:11:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:02,785 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2024-11-09 12:11:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:11:02,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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 51 [2024-11-09 12:11:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:02,787 INFO L225 Difference]: With dead ends: 144 [2024-11-09 12:11:02,788 INFO L226 Difference]: Without dead ends: 135 [2024-11-09 12:11:02,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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-11-09 12:11:02,789 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 120 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:02,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 120 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:11:02,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-09 12:11:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-09 12:11:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 125 states have internal predecessors, (126), 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-11-09 12:11:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2024-11-09 12:11:02,799 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 51 [2024-11-09 12:11:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:02,800 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2024-11-09 12:11:02,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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-11-09 12:11:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2024-11-09 12:11:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 12:11:02,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:02,801 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, 1] [2024-11-09 12:11:02,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 12:11:03,007 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-11-09 12:11:03,008 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-11-09 12:11:03,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash -185772108, now seen corresponding path program 1 times [2024-11-09 12:11:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:03,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075574933] [2024-11-09 12:11:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:03,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:03,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:03,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:03,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:11:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:11:03,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:03,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075574933] [2024-11-09 12:11:03,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075574933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:11:03,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901817284] [2024-11-09 12:11:03,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:03,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:03,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:03,095 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-11-09 12:11:03,098 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-11-09 12:11:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:03,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:11:03,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:11:03,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:11:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 12:11:03,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901817284] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:11:03,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:11:03,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-09 12:11:03,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622018348] [2024-11-09 12:11:03,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:11:03,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:11:03,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:03,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:11:03,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:11:03,325 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 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-11-09 12:11:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:03,477 INFO L93 Difference]: Finished difference Result 230 states and 259 transitions. [2024-11-09 12:11:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:11:03,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 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 52 [2024-11-09 12:11:03,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:03,479 INFO L225 Difference]: With dead ends: 230 [2024-11-09 12:11:03,479 INFO L226 Difference]: Without dead ends: 221 [2024-11-09 12:11:03,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 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-11-09 12:11:03,480 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 175 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:03,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 262 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:11:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-09 12:11:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 126. [2024-11-09 12:11:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 116 states have internal predecessors, (117), 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-11-09 12:11:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2024-11-09 12:11:03,488 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 52 [2024-11-09 12:11:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:03,489 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2024-11-09 12:11:03,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 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-11-09 12:11:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2024-11-09 12:11:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 12:11:03,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:03,490 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, 1] [2024-11-09 12:11:03,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 12:11:03,694 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-11-09 12:11:03,695 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-11-09 12:11:03,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:03,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1650363250, now seen corresponding path program 1 times [2024-11-09 12:11:03,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:03,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277122692] [2024-11-09 12:11:03,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:03,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:11:03,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [522078449] [2024-11-09 12:11:03,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:03,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:03,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:03,737 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-11-09 12:11:03,738 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-11-09 12:11:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:03,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:11:03,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:11:03,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:11:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 12:11:04,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:04,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277122692] [2024-11-09 12:11:04,009 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:11:04,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522078449] [2024-11-09 12:11:04,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522078449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:11:04,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:11:04,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-09 12:11:04,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006411602] [2024-11-09 12:11:04,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:11:04,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:11:04,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:04,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:11:04,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:11:04,012 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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-11-09 12:11:04,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:04,196 INFO L93 Difference]: Finished difference Result 305 states and 327 transitions. [2024-11-09 12:11:04,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:11:04,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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 65 [2024-11-09 12:11:04,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:04,198 INFO L225 Difference]: With dead ends: 305 [2024-11-09 12:11:04,198 INFO L226 Difference]: Without dead ends: 303 [2024-11-09 12:11:04,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 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-11-09 12:11:04,199 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 340 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:04,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 311 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:11:04,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-09 12:11:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 203. [2024-11-09 12:11:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 160 states have (on average 1.36875) internal successors, (219), 186 states have internal predecessors, (219), 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-11-09 12:11:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 249 transitions. [2024-11-09 12:11:04,211 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 249 transitions. Word has length 65 [2024-11-09 12:11:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:04,211 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 249 transitions. [2024-11-09 12:11:04,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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-11-09 12:11:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 249 transitions. [2024-11-09 12:11:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 12:11:04,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:04,213 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, 1] [2024-11-09 12:11:04,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 12:11:04,413 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-11-09 12:11:04,414 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-11-09 12:11:04,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:04,414 INFO L85 PathProgramCache]: Analyzing trace with hash 809495382, now seen corresponding path program 1 times [2024-11-09 12:11:04,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:04,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266206362] [2024-11-09 12:11:04,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:04,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 12:11:04,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1575877797] [2024-11-09 12:11:04,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:04,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:04,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:04,431 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-11-09 12:11:04,435 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-11-09 12:11:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:04,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:11:04,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:04,563 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:11:04,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:11:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:11:04,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:04,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266206362] [2024-11-09 12:11:04,688 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 12:11:04,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575877797] [2024-11-09 12:11:04,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575877797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:11:04,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:11:04,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-09 12:11:04,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353172171] [2024-11-09 12:11:04,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:11:04,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:11:04,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:04,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:11:04,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:11:04,690 INFO L87 Difference]: Start difference. First operand 203 states and 249 transitions. Second operand has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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-11-09 12:11:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:04,940 INFO L93 Difference]: Finished difference Result 263 states and 326 transitions. [2024-11-09 12:11:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:11:04,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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 72 [2024-11-09 12:11:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:04,942 INFO L225 Difference]: With dead ends: 263 [2024-11-09 12:11:04,943 INFO L226 Difference]: Without dead ends: 255 [2024-11-09 12:11:04,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 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-11-09 12:11:04,943 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 177 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:04,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 228 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:11:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-09 12:11:04,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 199. [2024-11-09 12:11:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 162 states have (on average 1.2592592592592593) internal successors, (204), 181 states have internal predecessors, (204), 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-11-09 12:11:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 236 transitions. [2024-11-09 12:11:04,960 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 236 transitions. Word has length 72 [2024-11-09 12:11:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:04,961 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 236 transitions. [2024-11-09 12:11:04,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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-11-09 12:11:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 236 transitions. [2024-11-09 12:11:04,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 12:11:04,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:04,963 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, 1] [2024-11-09 12:11:04,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 12:11:05,169 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-11-09 12:11:05,170 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-11-09 12:11:05,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:05,170 INFO L85 PathProgramCache]: Analyzing trace with hash -675446858, now seen corresponding path program 1 times [2024-11-09 12:11:05,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:05,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882207860] [2024-11-09 12:11:05,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:05,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:05,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:05,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:05,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:11:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:05,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:11:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:05,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 12:11:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:11:05,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:05,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882207860] [2024-11-09 12:11:05,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882207860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:11:05,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373012276] [2024-11-09 12:11:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:05,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:05,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:05,322 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-11-09 12:11:05,324 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-11-09 12:11:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:05,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:11:05,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:11:05,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:11:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:11:05,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373012276] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:11:05,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:11:05,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 12:11:05,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223892783] [2024-11-09 12:11:05,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:11:05,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 12:11:05,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 12:11:05,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:11:05,655 INFO L87 Difference]: Start difference. First operand 199 states and 236 transitions. Second operand has 10 states, 9 states have (on average 14.11111111111111) internal successors, (127), 10 states have internal predecessors, (127), 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-11-09 12:11:05,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:05,861 INFO L93 Difference]: Finished difference Result 199 states and 236 transitions. [2024-11-09 12:11:05,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:11:05,862 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.11111111111111) internal successors, (127), 10 states have internal predecessors, (127), 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-11-09 12:11:05,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:05,863 INFO L225 Difference]: With dead ends: 199 [2024-11-09 12:11:05,863 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 12:11:05,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 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-11-09 12:11:05,864 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 90 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:05,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 212 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:11:05,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 12:11:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-09 12:11:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 162 states have (on average 1.2160493827160495) internal successors, (197), 178 states have internal predecessors, (197), 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-11-09 12:11:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2024-11-09 12:11:05,878 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 73 [2024-11-09 12:11:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:05,878 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2024-11-09 12:11:05,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.11111111111111) internal successors, (127), 10 states have internal predecessors, (127), 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-11-09 12:11:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2024-11-09 12:11:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 12:11:05,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:05,880 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, 1] [2024-11-09 12:11:05,898 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-11-09 12:11:06,080 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-11-09 12:11:06,081 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-11-09 12:11:06,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:06,082 INFO L85 PathProgramCache]: Analyzing trace with hash 535983960, now seen corresponding path program 1 times [2024-11-09 12:11:06,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:06,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454442614] [2024-11-09 12:11:06,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:06,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:06,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:06,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:11:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:06,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:11:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:06,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 12:11:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:11:06,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:06,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454442614] [2024-11-09 12:11:06,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454442614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:11:06,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804086701] [2024-11-09 12:11:06,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:06,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:06,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:06,226 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-11-09 12:11:06,227 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-11-09 12:11:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:06,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 12:11:06,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:11:06,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:11:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:11:06,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804086701] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:11:06,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:11:06,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-09 12:11:06,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601438946] [2024-11-09 12:11:06,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:11:06,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 12:11:06,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:06,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 12:11:06,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:11:06,527 INFO L87 Difference]: Start difference. First operand 196 states and 229 transitions. Second operand has 10 states, 9 states have (on average 14.333333333333334) internal successors, (129), 10 states have internal predecessors, (129), 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-11-09 12:11:06,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:06,774 INFO L93 Difference]: Finished difference Result 222 states and 261 transitions. [2024-11-09 12:11:06,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:11:06,775 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 14.333333333333334) internal successors, (129), 10 states have internal predecessors, (129), 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 74 [2024-11-09 12:11:06,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:06,777 INFO L225 Difference]: With dead ends: 222 [2024-11-09 12:11:06,777 INFO L226 Difference]: Without dead ends: 213 [2024-11-09 12:11:06,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 152 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-11-09 12:11:06,778 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 155 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:06,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 206 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:11:06,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-09 12:11:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 189. [2024-11-09 12:11:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 162 states have (on average 1.117283950617284) internal successors, (181), 171 states have internal predecessors, (181), 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-11-09 12:11:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2024-11-09 12:11:06,792 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 74 [2024-11-09 12:11:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:06,792 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2024-11-09 12:11:06,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 14.333333333333334) internal successors, (129), 10 states have internal predecessors, (129), 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-11-09 12:11:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2024-11-09 12:11:06,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 12:11:06,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:06,795 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, 1] [2024-11-09 12:11:06,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 12:11:06,995 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-11-09 12:11:06,996 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-11-09 12:11:06,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:06,996 INFO L85 PathProgramCache]: Analyzing trace with hash -315487398, now seen corresponding path program 1 times [2024-11-09 12:11:06,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:06,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451247610] [2024-11-09 12:11:06,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:06,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:11:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:11:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 12:11:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:11:07,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:07,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451247610] [2024-11-09 12:11:07,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451247610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:11:07,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767739620] [2024-11-09 12:11:07,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:07,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:07,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:07,128 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-11-09 12:11:07,129 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-11-09 12:11:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 12:11:07,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 12:11:07,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:11:07,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767739620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:11:07,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:11:07,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-09 12:11:07,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458944613] [2024-11-09 12:11:07,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:11:07,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:11:07,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:07,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:11:07,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:11:07,417 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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-11-09 12:11:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:07,533 INFO L93 Difference]: Finished difference Result 189 states and 213 transitions. [2024-11-09 12:11:07,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:11:07,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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 76 [2024-11-09 12:11:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:07,535 INFO L225 Difference]: With dead ends: 189 [2024-11-09 12:11:07,535 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 12:11:07,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 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-11-09 12:11:07,536 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 35 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:07,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 137 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:11:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 12:11:07,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-09 12:11:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 140 states have (on average 1.0357142857142858) internal successors, (145), 143 states have internal predecessors, (145), 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-11-09 12:11:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2024-11-09 12:11:07,547 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 76 [2024-11-09 12:11:07,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:07,547 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2024-11-09 12:11:07,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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-11-09 12:11:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2024-11-09 12:11:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 12:11:07,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:07,549 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, 1] [2024-11-09 12:11:07,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 12:11:07,752 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-11-09 12:11:07,753 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-11-09 12:11:07,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1290551230, now seen corresponding path program 1 times [2024-11-09 12:11:07,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:07,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956654704] [2024-11-09 12:11:07,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:07,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:11:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:11:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 12:11:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 12:11:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 12:11:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 12:11:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 12:11:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 12:11:07,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:07,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956654704] [2024-11-09 12:11:07,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956654704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:11:07,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099759428] [2024-11-09 12:11:07,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:07,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:07,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:07,970 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-11-09 12:11:07,972 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-11-09 12:11:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:08,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 12:11:08,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 12:11:08,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:11:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 12:11:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099759428] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:11:08,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:11:08,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-11-09 12:11:08,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172535133] [2024-11-09 12:11:08,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:11:08,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 12:11:08,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:08,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 12:11:08,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2024-11-09 12:11:08,659 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand has 20 states, 19 states have (on average 14.68421052631579) internal successors, (279), 20 states have internal predecessors, (279), 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-11-09 12:11:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:09,027 INFO L93 Difference]: Finished difference Result 246 states and 274 transitions. [2024-11-09 12:11:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 12:11:09,028 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 14.68421052631579) internal successors, (279), 20 states have internal predecessors, (279), 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 139 [2024-11-09 12:11:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:09,030 INFO L225 Difference]: With dead ends: 246 [2024-11-09 12:11:09,030 INFO L226 Difference]: Without dead ends: 245 [2024-11-09 12:11:09,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 283 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-11-09 12:11:09,031 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:09,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 254 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 12:11:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-09 12:11:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2024-11-09 12:11:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 217 states have (on average 1.0506912442396312) internal successors, (228), 220 states have internal predecessors, (228), 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-11-09 12:11:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 270 transitions. [2024-11-09 12:11:09,047 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 270 transitions. Word has length 139 [2024-11-09 12:11:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:09,047 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 270 transitions. [2024-11-09 12:11:09,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 14.68421052631579) internal successors, (279), 20 states have internal predecessors, (279), 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-11-09 12:11:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 270 transitions. [2024-11-09 12:11:09,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-09 12:11:09,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:09,049 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, 1] [2024-11-09 12:11:09,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 12:11:09,250 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-11-09 12:11:09,250 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-11-09 12:11:09,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 127166872, now seen corresponding path program 2 times [2024-11-09 12:11:09,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:09,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293191788] [2024-11-09 12:11:09,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:09,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:09,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:09,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:09,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:11:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:09,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:11:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:09,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 12:11:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:09,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 12:11:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:09,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 12:11:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:09,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 12:11:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:09,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 12:11:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:09,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 12:11:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:09,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 12:11:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 12:11:09,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:09,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293191788] [2024-11-09 12:11:09,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293191788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:11:09,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606398526] [2024-11-09 12:11:09,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 12:11:09,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:09,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:09,471 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-11-09 12:11:09,472 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-11-09 12:11:09,540 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 12:11:09,540 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:11:09,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 12:11:09,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 12:11:09,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:11:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 12:11:10,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606398526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:11:10,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:11:10,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2024-11-09 12:11:10,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164443688] [2024-11-09 12:11:10,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:11:10,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 12:11:10,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:10,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 12:11:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2024-11-09 12:11:10,212 INFO L87 Difference]: Start difference. First operand 243 states and 270 transitions. Second operand has 22 states, 21 states have (on average 14.714285714285714) internal successors, (309), 22 states have internal predecessors, (309), 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-11-09 12:11:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:10,624 INFO L93 Difference]: Finished difference Result 265 states and 292 transitions. [2024-11-09 12:11:10,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 12:11:10,625 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 14.714285714285714) internal successors, (309), 22 states have internal predecessors, (309), 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 164 [2024-11-09 12:11:10,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:10,628 INFO L225 Difference]: With dead ends: 265 [2024-11-09 12:11:10,628 INFO L226 Difference]: Without dead ends: 264 [2024-11-09 12:11:10,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 336 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-11-09 12:11:10,629 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 88 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:10,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 272 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 12:11:10,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-09 12:11:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2024-11-09 12:11:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 232 states have (on average 1.043103448275862) internal successors, (242), 235 states have internal predecessors, (242), 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-11-09 12:11:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 288 transitions. [2024-11-09 12:11:10,644 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 288 transitions. Word has length 164 [2024-11-09 12:11:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:10,645 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 288 transitions. [2024-11-09 12:11:10,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 14.714285714285714) internal successors, (309), 22 states have internal predecessors, (309), 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-11-09 12:11:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 288 transitions. [2024-11-09 12:11:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-09 12:11:10,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:11:10,648 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, 1] [2024-11-09 12:11:10,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 12:11:10,848 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-11-09 12:11:10,849 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-11-09 12:11:10,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:11:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1781711604, now seen corresponding path program 2 times [2024-11-09 12:11:10,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:11:10,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814591772] [2024-11-09 12:11:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:11:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:11:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:11,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 12:11:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:11,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 12:11:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:11,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 12:11:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:11,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:11:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:11,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 12:11:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:11,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 12:11:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:11,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 12:11:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:11,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 12:11:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:11,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 12:11:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:11,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 12:11:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:11,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 12:11:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-09 12:11:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-09 12:11:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:11:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 66 proven. 180 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 12:11:11,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:11:11,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814591772] [2024-11-09 12:11:11,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814591772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:11:11,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114613156] [2024-11-09 12:11:11,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 12:11:11,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:11:11,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:11:11,345 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-11-09 12:11:11,359 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-11-09 12:11:11,434 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 12:11:11,434 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:11:11,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 12:11:11,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:11:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 213 proven. 81 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 12:11:12,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:11:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 66 proven. 180 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 12:11:12,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114613156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:11:12,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:11:12,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-09 12:11:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666095533] [2024-11-09 12:11:12,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:11:12,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 12:11:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:11:12,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 12:11:12,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2024-11-09 12:11:12,713 INFO L87 Difference]: Start difference. First operand 260 states and 288 transitions. Second operand has 28 states, 28 states have (on average 13.392857142857142) internal successors, (375), 28 states have internal predecessors, (375), 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-11-09 12:11:13,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:11:13,031 INFO L93 Difference]: Finished difference Result 264 states and 291 transitions. [2024-11-09 12:11:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 12:11:13,033 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 13.392857142857142) internal successors, (375), 28 states have internal predecessors, (375), 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 200 [2024-11-09 12:11:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:11:13,034 INFO L225 Difference]: With dead ends: 264 [2024-11-09 12:11:13,034 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 12:11:13,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2024-11-09 12:11:13,036 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:11:13,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 541 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 12:11:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 12:11:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 12:11:13,037 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-11-09 12:11:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 12:11:13,037 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 200 [2024-11-09 12:11:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:11:13,038 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 12:11:13,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 13.392857142857142) internal successors, (375), 28 states have internal predecessors, (375), 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-11-09 12:11:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 12:11:13,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 12:11:13,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 50 remaining) [2024-11-09 12:11:13,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 50 remaining) [2024-11-09 12:11:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 50 remaining) [2024-11-09 12:11:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 50 remaining) [2024-11-09 12:11:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 50 remaining) [2024-11-09 12:11:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 50 remaining) [2024-11-09 12:11:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 50 remaining) [2024-11-09 12:11:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 50 remaining) [2024-11-09 12:11:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 50 remaining) [2024-11-09 12:11:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 50 remaining) [2024-11-09 12:11:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 50 remaining) [2024-11-09 12:11:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 50 remaining) [2024-11-09 12:11:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 50 remaining) [2024-11-09 12:11:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 50 remaining) [2024-11-09 12:11:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 50 remaining) [2024-11-09 12:11:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 50 remaining) [2024-11-09 12:11:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 50 remaining) [2024-11-09 12:11:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 50 remaining) [2024-11-09 12:11:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 50 remaining) [2024-11-09 12:11:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 50 remaining) [2024-11-09 12:11:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 50 remaining) [2024-11-09 12:11:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 50 remaining) [2024-11-09 12:11:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 50 remaining) [2024-11-09 12:11:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 50 remaining) [2024-11-09 12:11:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 50 remaining) [2024-11-09 12:11:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 50 remaining) [2024-11-09 12:11:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 50 remaining) [2024-11-09 12:11:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 50 remaining) [2024-11-09 12:11:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 50 remaining) [2024-11-09 12:11:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 50 remaining) [2024-11-09 12:11:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 50 remaining) [2024-11-09 12:11:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 50 remaining) [2024-11-09 12:11:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 50 remaining) [2024-11-09 12:11:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 50 remaining) [2024-11-09 12:11:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 50 remaining) [2024-11-09 12:11:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 50 remaining) [2024-11-09 12:11:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 50 remaining) [2024-11-09 12:11:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 50 remaining) [2024-11-09 12:11:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 50 remaining) [2024-11-09 12:11:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 50 remaining) [2024-11-09 12:11:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 50 remaining) [2024-11-09 12:11:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 50 remaining) [2024-11-09 12:11:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 50 remaining) [2024-11-09 12:11:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 50 remaining) [2024-11-09 12:11:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 50 remaining) [2024-11-09 12:11:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 50 remaining) [2024-11-09 12:11:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 50 remaining) [2024-11-09 12:11:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 50 remaining) [2024-11-09 12:11:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 50 remaining) [2024-11-09 12:11:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 50 remaining) [2024-11-09 12:11:13,065 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-11-09 12:11:13,249 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-11-09 12:11:13,252 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:11:13,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 12:11:13,783 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 12:11:13,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:11:13 BoogieIcfgContainer [2024-11-09 12:11:13,806 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 12:11:13,806 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 12:11:13,806 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 12:11:13,807 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 12:11:13,807 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:10:59" (3/4) ... [2024-11-09 12:11:13,809 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 12:11:13,813 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 12:11:13,818 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-09 12:11:13,819 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 12:11:13,819 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 12:11:13,819 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 12:11:13,909 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 12:11:13,909 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 12:11:13,911 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 12:11:13,912 INFO L158 Benchmark]: Toolchain (without parser) took 15066.25ms. Allocated memory was 138.4MB in the beginning and 239.1MB in the end (delta: 100.7MB). Free memory was 67.0MB in the beginning and 185.4MB in the end (delta: -118.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:11:13,912 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 138.4MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:11:13,913 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.06ms. Allocated memory is still 138.4MB. Free memory was 66.9MB in the beginning and 54.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 12:11:13,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.04ms. Allocated memory is still 138.4MB. Free memory was 54.3MB in the beginning and 109.2MB in the end (delta: -54.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-11-09 12:11:13,913 INFO L158 Benchmark]: Boogie Preprocessor took 37.87ms. Allocated memory is still 138.4MB. Free memory was 109.2MB in the beginning and 107.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 12:11:13,913 INFO L158 Benchmark]: RCFGBuilder took 558.35ms. Allocated memory is still 199.2MB. Free memory was 171.9MB in the beginning and 153.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 12:11:13,913 INFO L158 Benchmark]: TraceAbstraction took 13990.72ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 151.9MB in the beginning and 190.6MB in the end (delta: -38.7MB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. [2024-11-09 12:11:13,914 INFO L158 Benchmark]: Witness Printer took 105.18ms. Allocated memory is still 239.1MB. Free memory was 190.6MB in the beginning and 185.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 12:11:13,915 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.89ms. Allocated memory is still 138.4MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.06ms. Allocated memory is still 138.4MB. Free memory was 66.9MB in the beginning and 54.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.04ms. Allocated memory is still 138.4MB. Free memory was 54.3MB in the beginning and 109.2MB in the end (delta: -54.9MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.87ms. Allocated memory is still 138.4MB. Free memory was 109.2MB in the beginning and 107.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 558.35ms. Allocated memory is still 199.2MB. Free memory was 171.9MB in the beginning and 153.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13990.72ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 151.9MB in the beginning and 190.6MB in the end (delta: -38.7MB). Peak memory consumption was 122.8MB. Max. memory is 16.1GB. * Witness Printer took 105.18ms. Allocated memory is still 239.1MB. Free memory was 190.6MB in the beginning and 185.4MB in the end (delta: 5.2MB). 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, 122 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 18, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1497 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1444 mSDsluCounter, 3869 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2507 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2875 IncrementalHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 1362 mSDtfsCounter, 2875 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2028 GetRequests, 1894 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred 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.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2189 NumberOfCodeBlocks, 2189 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2830 ConstructedInterpolants, 0 QuantifiedInterpolants, 14213 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1683 ConjunctsInSsa, 66 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-11-09 12:11:13,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE