./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-regression/test22-3.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/ldv-regression/test22-3.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 d801f0525ca26a676000831cf03fb7a7e79d5c4d235bd41da197ed6559b3bbff --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:20:34,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:20:34,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:20:34,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:20:34,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:20:34,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:20:34,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:20:34,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:20:34,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:20:34,650 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:20:34,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:20:34,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:20:34,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:20:34,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:20:34,654 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:20:34,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:20:34,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:20:34,657 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:20:34,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:20:34,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:20:34,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:20:34,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:20:34,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:20:34,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:20:34,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:20:34,660 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:20:34,660 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:20:34,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:20:34,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:20:34,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:20:34,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:20:34,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:20:34,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:20:34,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:20:34,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:20:34,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:20:34,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:20:34,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:20:34,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:20:34,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:20:34,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:20:34,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:20:34,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:20:34,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:20:34,669 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 -> d801f0525ca26a676000831cf03fb7a7e79d5c4d235bd41da197ed6559b3bbff [2024-11-09 11:20:34,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:20:34,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:20:34,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:20:34,976 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:20:34,977 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:20:34,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test22-3.c [2024-11-09 11:20:36,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:20:36,548 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:20:36,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-3.c [2024-11-09 11:20:36,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8d91212/4b139c46ef1a45fdaf87ceaa734f23b9/FLAGe36f26dae [2024-11-09 11:20:36,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8d91212/4b139c46ef1a45fdaf87ceaa734f23b9 [2024-11-09 11:20:36,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:20:36,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:20:36,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:20:36,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:20:36,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:20:36,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:20:36" (1/1) ... [2024-11-09 11:20:36,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fc92cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36, skipping insertion in model container [2024-11-09 11:20:36,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:20:36" (1/1) ... [2024-11-09 11:20:36,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:20:36,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:20:36,841 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:20:36,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:20:36,886 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:20:36,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36 WrapperNode [2024-11-09 11:20:36,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:20:36,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:20:36,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:20:36,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:20:36,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36" (1/1) ... [2024-11-09 11:20:36,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36" (1/1) ... [2024-11-09 11:20:36,928 INFO L138 Inliner]: procedures = 17, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 102 [2024-11-09 11:20:36,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:20:36,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:20:36,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:20:36,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:20:36,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36" (1/1) ... [2024-11-09 11:20:36,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36" (1/1) ... [2024-11-09 11:20:36,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36" (1/1) ... [2024-11-09 11:20:36,958 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 4 writes are split as follows [0, 4]. [2024-11-09 11:20:36,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36" (1/1) ... [2024-11-09 11:20:36,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36" (1/1) ... [2024-11-09 11:20:36,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36" (1/1) ... [2024-11-09 11:20:36,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36" (1/1) ... [2024-11-09 11:20:36,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36" (1/1) ... [2024-11-09 11:20:36,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36" (1/1) ... [2024-11-09 11:20:36,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:20:36,979 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:20:36,979 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:20:36,979 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:20:36,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36" (1/1) ... [2024-11-09 11:20:36,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:20:36,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:20:37,016 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 11:20:37,019 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 11:20:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:20:37,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 11:20:37,069 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 11:20:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:20:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 11:20:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 11:20:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 11:20:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2024-11-09 11:20:37,070 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2024-11-09 11:20:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:20:37,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:20:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 11:20:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 11:20:37,159 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:20:37,163 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:20:37,374 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-09 11:20:37,374 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:20:37,396 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:20:37,396 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 11:20:37,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:20:37 BoogieIcfgContainer [2024-11-09 11:20:37,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:20:37,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:20:37,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:20:37,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:20:37,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:20:36" (1/3) ... [2024-11-09 11:20:37,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d575159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:20:37, skipping insertion in model container [2024-11-09 11:20:37,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:36" (2/3) ... [2024-11-09 11:20:37,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d575159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:20:37, skipping insertion in model container [2024-11-09 11:20:37,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:20:37" (3/3) ... [2024-11-09 11:20:37,409 INFO L112 eAbstractionObserver]: Analyzing ICFG test22-3.c [2024-11-09 11:20:37,424 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:20:37,424 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-09 11:20:37,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:20:37,485 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;@706cc636, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:20:37,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-09 11:20:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:20:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 11:20:37,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:20:37,497 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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 11:20:37,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:20:37,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:20:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1078952575, now seen corresponding path program 1 times [2024-11-09 11:20:37,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:20:37,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508643377] [2024-11-09 11:20:37,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:20:37,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:20:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:37,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:20:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:37,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:20:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:37,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:20:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:37,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:20:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:37,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:20:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 11:20:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:20:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508643377] [2024-11-09 11:20:37,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508643377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:20:37,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:20:37,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:20:37,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17124780] [2024-11-09 11:20:37,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:20:37,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 11:20:37,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:20:37,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 11:20:37,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:20:37,841 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 33 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:20:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:20:37,856 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2024-11-09 11:20:37,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 11:20:37,858 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-11-09 11:20:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:20:37,864 INFO L225 Difference]: With dead ends: 78 [2024-11-09 11:20:37,864 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 11:20:37,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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 11:20:37,871 INFO L432 NwaCegarLoop]: 45 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, 45 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 11:20:37,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:20:37,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 11:20:37,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 11:20:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:20:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 11:20:37,910 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 33 [2024-11-09 11:20:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:20:37,911 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 11:20:37,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:20:37,913 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 11:20:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 11:20:37,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:20:37,914 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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 11:20:37,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:20:37,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:20:37,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:20:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1498187515, now seen corresponding path program 1 times [2024-11-09 11:20:37,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:20:37,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947704590] [2024-11-09 11:20:37,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:20:37,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:20:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:39,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:20:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:39,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:20:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:39,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:20:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:39,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:20:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:39,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:20:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:20:39,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:20:39,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947704590] [2024-11-09 11:20:39,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947704590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:20:39,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:20:39,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 11:20:39,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741096369] [2024-11-09 11:20:39,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:20:39,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 11:20:39,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:20:39,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 11:20:39,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:20:39,238 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 13 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 11:20:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:20:39,672 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-09 11:20:39,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 11:20:39,673 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2024-11-09 11:20:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:20:39,674 INFO L225 Difference]: With dead ends: 36 [2024-11-09 11:20:39,674 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 11:20:39,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-11-09 11:20:39,676 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:20:39,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 162 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:20:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 11:20:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 11:20:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:20:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-09 11:20:39,685 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 33 [2024-11-09 11:20:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:20:39,687 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-09 11:20:39,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 11:20:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-09 11:20:39,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 11:20:39,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:20:39,688 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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 11:20:39,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:20:39,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:20:39,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:20:39,689 INFO L85 PathProgramCache]: Analyzing trace with hash 800827350, now seen corresponding path program 1 times [2024-11-09 11:20:39,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:20:39,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492117161] [2024-11-09 11:20:39,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:20:39,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:20:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:20:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:20:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:20:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:20:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:20:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:20:40,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:20:40,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492117161] [2024-11-09 11:20:40,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492117161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:20:40,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:20:40,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 11:20:40,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21632841] [2024-11-09 11:20:40,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:20:40,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 11:20:40,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:20:40,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 11:20:40,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:20:40,221 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:20:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:20:40,398 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-09 11:20:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:20:40,399 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2024-11-09 11:20:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:20:40,400 INFO L225 Difference]: With dead ends: 35 [2024-11-09 11:20:40,400 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 11:20:40,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-09 11:20:40,402 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 58 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:20:40,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 90 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:20:40,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 11:20:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 11:20:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:20:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-09 11:20:40,412 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 34 [2024-11-09 11:20:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:20:40,413 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-09 11:20:40,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:20:40,413 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-09 11:20:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 11:20:40,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:20:40,415 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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 11:20:40,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:20:40,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:20:40,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:20:40,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1095681716, now seen corresponding path program 1 times [2024-11-09 11:20:40,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:20:40,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96353628] [2024-11-09 11:20:40,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:20:40,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:20:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:20:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:20:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:20:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:20:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:20:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 11:20:40,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:20:40,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96353628] [2024-11-09 11:20:40,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96353628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:20:40,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:20:40,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:20:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108585089] [2024-11-09 11:20:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:20:40,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:20:40,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:20:40,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:20:40,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:20:40,508 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 11:20:40,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:20:40,532 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-11-09 11:20:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:20:40,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2024-11-09 11:20:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:20:40,534 INFO L225 Difference]: With dead ends: 34 [2024-11-09 11:20:40,535 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 11:20:40,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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 11:20:40,536 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:20:40,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 79 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:20:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 11:20:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 11:20:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:20:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-09 11:20:40,552 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 37 [2024-11-09 11:20:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:20:40,554 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-09 11:20:40,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 11:20:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-09 11:20:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 11:20:40,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:20:40,555 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:20:40,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:20:40,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:20:40,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:20:40,557 INFO L85 PathProgramCache]: Analyzing trace with hash 393605245, now seen corresponding path program 1 times [2024-11-09 11:20:40,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:20:40,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963102716] [2024-11-09 11:20:40,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:20:40,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:20:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:20:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:20:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:20:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:20:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:20:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:20:40,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:20:40,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963102716] [2024-11-09 11:20:40,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963102716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:20:40,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:20:40,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 11:20:40,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248356988] [2024-11-09 11:20:40,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:20:40,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 11:20:40,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:20:40,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 11:20:40,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 11:20:40,961 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:20:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:20:41,146 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-09 11:20:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 11:20:41,147 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2024-11-09 11:20:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:20:41,148 INFO L225 Difference]: With dead ends: 38 [2024-11-09 11:20:41,148 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 11:20:41,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-09 11:20:41,149 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 67 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:20:41,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 90 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:20:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 11:20:41,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 11:20:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:20:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-09 11:20:41,168 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 38 [2024-11-09 11:20:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:20:41,170 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-09 11:20:41,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 11:20:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-09 11:20:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 11:20:41,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:20:41,171 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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 11:20:41,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:20:41,171 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:20:41,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:20:41,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1845654108, now seen corresponding path program 1 times [2024-11-09 11:20:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:20:41,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288480090] [2024-11-09 11:20:41,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:20:41,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:20:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:41,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:20:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:41,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:20:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:41,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:20:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:41,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:20:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:41,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:20:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:20:41,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:20:41,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288480090] [2024-11-09 11:20:41,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288480090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:20:41,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087057971] [2024-11-09 11:20:41,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:20:41,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:20:41,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:20:41,575 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 11:20:41,576 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 11:20:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:41,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 11:20:41,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:20:41,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 11:20:41,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-09 11:20:42,491 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 11:20:42,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 11:20:42,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2024-11-09 11:20:42,557 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:20:42,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:20:42,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087057971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:20:42,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:20:42,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-11-09 11:20:42,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19806650] [2024-11-09 11:20:42,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:20:42,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 11:20:42,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:20:42,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 11:20:42,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-09 11:20:42,945 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 11:20:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:20:43,201 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-09 11:20:43,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 11:20:43,201 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 42 [2024-11-09 11:20:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:20:43,202 INFO L225 Difference]: With dead ends: 42 [2024-11-09 11:20:43,203 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 11:20:43,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2024-11-09 11:20:43,204 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 80 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:20:43,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 119 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:20:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 11:20:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 11:20:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:20:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-09 11:20:43,220 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 42 [2024-11-09 11:20:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:20:43,220 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-09 11:20:43,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 11:20:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-09 11:20:43,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 11:20:43,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:20:43,225 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 11:20:43,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 11:20:43,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 11:20:43,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:20:43,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:20:43,430 INFO L85 PathProgramCache]: Analyzing trace with hash 395591499, now seen corresponding path program 2 times [2024-11-09 11:20:43,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:20:43,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191994301] [2024-11-09 11:20:43,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:20:43,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:20:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:43,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:20:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:43,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:20:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:43,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:20:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:43,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:20:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:43,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:20:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:20:43,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:20:43,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191994301] [2024-11-09 11:20:43,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191994301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:20:43,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867417254] [2024-11-09 11:20:43,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 11:20:43,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:20:43,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:20:43,836 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 11:20:43,838 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 11:20:43,916 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 11:20:43,916 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:20:43,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 11:20:43,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:20:43,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2024-11-09 11:20:44,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2024-11-09 11:20:44,457 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-11-09 11:20:44,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 57 [2024-11-09 11:20:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 11:20:44,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:20:51,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867417254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:20:51,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:20:51,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2024-11-09 11:20:51,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952636404] [2024-11-09 11:20:51,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:20:51,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 11:20:51,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:20:51,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 11:20:51,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=599, Unknown=1, NotChecked=0, Total=702 [2024-11-09 11:20:51,694 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 18 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 11:20:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:20:52,012 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2024-11-09 11:20:52,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 11:20:52,013 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 46 [2024-11-09 11:20:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:20:52,015 INFO L225 Difference]: With dead ends: 46 [2024-11-09 11:20:52,015 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 11:20:52,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=188, Invalid=867, Unknown=1, NotChecked=0, Total=1056 [2024-11-09 11:20:52,017 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 118 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:20:52,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 119 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:20:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 11:20:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-09 11:20:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 11:20:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2024-11-09 11:20:52,029 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 46 [2024-11-09 11:20:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:20:52,029 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-11-09 11:20:52,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 11:20:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-11-09 11:20:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 11:20:52,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:20:52,031 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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 11:20:52,049 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 11:20:52,235 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,SelfDestructingSolverStorable6 [2024-11-09 11:20:52,236 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-09 11:20:52,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:20:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1449409166, now seen corresponding path program 3 times [2024-11-09 11:20:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:20:52,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437633437] [2024-11-09 11:20:52,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:20:52,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:20:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:52,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:20:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:52,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 11:20:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 11:20:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:52,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 11:20:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:52,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:20:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 11:20:52,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:20:52,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437633437] [2024-11-09 11:20:52,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437633437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:20:52,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018731508] [2024-11-09 11:20:52,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 11:20:52,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:20:52,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:20:52,655 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 11:20:52,657 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 11:20:52,735 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 11:20:52,735 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 11:20:52,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 11:20:52,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:20:52,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 11:20:52,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-09 11:20:53,662 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 11:20:53,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 11:20:53,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2024-11-09 11:20:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 11:20:53,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 11:20:54,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018731508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:20:54,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 11:20:54,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 22 [2024-11-09 11:20:54,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988387479] [2024-11-09 11:20:54,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 11:20:54,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 11:20:54,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:20:54,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 11:20:54,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2024-11-09 11:20:54,376 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 11:20:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:20:55,113 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2024-11-09 11:20:55,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 11:20:55,113 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) Word has length 50 [2024-11-09 11:20:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:20:55,114 INFO L225 Difference]: With dead ends: 51 [2024-11-09 11:20:55,114 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:20:55,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=430, Invalid=1826, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 11:20:55,116 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 123 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:20:55,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 146 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:20:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:20:55,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:20:55,117 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 11:20:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:20:55,118 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-11-09 11:20:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:20:55,118 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:20:55,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 11:20:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:20:55,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:20:55,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-09 11:20:55,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-09 11:20:55,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-09 11:20:55,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-09 11:20:55,141 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 11:20:55,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:20:55,330 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-11-09 11:20:55,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:20:55,850 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:20:55,859 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,860 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,861 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] [2024-11-09 11:20:55,863 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,863 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,863 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] [2024-11-09 11:20:55,863 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!offset [2024-11-09 11:20:55,863 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!base [2024-11-09 11:20:55,863 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!base [2024-11-09 11:20:55,864 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,864 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,864 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-11-09 11:20:55,864 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,865 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,865 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-11-09 11:20:55,865 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!offset [2024-11-09 11:20:55,865 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!offset [2024-11-09 11:20:55,865 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!base [2024-11-09 11:20:55,865 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!offset [2024-11-09 11:20:55,866 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pa~0!base [2024-11-09 11:20:55,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] [2024-11-09 11:20:55,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,880 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,880 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] [2024-11-09 11:20:55,880 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!offset [2024-11-09 11:20:55,880 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!base [2024-11-09 11:20:55,880 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!base [2024-11-09 11:20:55,880 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,880 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-11-09 11:20:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-11-09 11:20:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!offset [2024-11-09 11:20:55,881 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,882 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,882 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] [2024-11-09 11:20:55,882 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,882 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,882 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] [2024-11-09 11:20:55,883 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!offset [2024-11-09 11:20:55,883 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!base [2024-11-09 11:20:55,883 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!base [2024-11-09 11:20:55,883 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,883 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,883 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-11-09 11:20:55,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,884 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-11-09 11:20:55,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!offset [2024-11-09 11:20:55,885 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-09 11:20:55,886 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-09 11:20:55,886 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!base [2024-11-09 11:20:55,886 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #res!offset [2024-11-09 11:20:55,896 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,896 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] [2024-11-09 11:20:55,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!offset [2024-11-09 11:20:55,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!base [2024-11-09 11:20:55,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!base [2024-11-09 11:20:55,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-11-09 11:20:55,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!offset [2024-11-09 11:20:55,897 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] [2024-11-09 11:20:55,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!offset [2024-11-09 11:20:55,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!base [2024-11-09 11:20:55,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!base [2024-11-09 11:20:55,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 11:20:55,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 11:20:55,898 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] [2024-11-09 11:20:55,899 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!offset [2024-11-09 11:20:55,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:20:55 BoogieIcfgContainer [2024-11-09 11:20:55,901 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:20:55,901 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:20:55,902 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:20:55,902 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:20:55,902 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:20:37" (3/4) ... [2024-11-09 11:20:55,904 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:20:55,907 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2024-11-09 11:20:55,908 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 11:20:55,911 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 11:20:55,912 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 11:20:55,912 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:20:55,912 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:20:56,005 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:20:56,005 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:20:56,006 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:20:56,006 INFO L158 Benchmark]: Toolchain (without parser) took 19433.04ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 151.2MB in the beginning and 184.0MB in the end (delta: -32.8MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2024-11-09 11:20:56,006 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 123.7MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:20:56,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.44ms. Allocated memory is still 182.5MB. Free memory was 151.2MB in the beginning and 138.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:20:56,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.99ms. Allocated memory is still 182.5MB. Free memory was 138.5MB in the beginning and 136.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:20:56,007 INFO L158 Benchmark]: Boogie Preprocessor took 48.73ms. Allocated memory is still 182.5MB. Free memory was 136.8MB in the beginning and 134.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:20:56,007 INFO L158 Benchmark]: RCFGBuilder took 419.64ms. Allocated memory is still 182.5MB. Free memory was 134.7MB in the beginning and 120.0MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 11:20:56,007 INFO L158 Benchmark]: TraceAbstraction took 18500.16ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 119.1MB in the beginning and 190.3MB in the end (delta: -71.3MB). Peak memory consumption was 126.9MB. Max. memory is 16.1GB. [2024-11-09 11:20:56,008 INFO L158 Benchmark]: Witness Printer took 104.23ms. Allocated memory is still 274.7MB. Free memory was 190.3MB in the beginning and 184.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 11:20:56,009 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.92ms. Allocated memory is still 123.7MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.44ms. Allocated memory is still 182.5MB. Free memory was 151.2MB in the beginning and 138.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.99ms. Allocated memory is still 182.5MB. Free memory was 138.5MB in the beginning and 136.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.73ms. Allocated memory is still 182.5MB. Free memory was 136.8MB in the beginning and 134.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 419.64ms. Allocated memory is still 182.5MB. Free memory was 134.7MB in the beginning and 120.0MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18500.16ms. Allocated memory was 182.5MB in the beginning and 274.7MB in the end (delta: 92.3MB). Free memory was 119.1MB in the beginning and 190.3MB in the end (delta: -71.3MB). Peak memory consumption was 126.9MB. Max. memory is 16.1GB. * Witness Printer took 104.23ms. Allocated memory is still 274.7MB. Free memory was 190.3MB in the beginning and 184.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pa~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #res!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[5]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IntegerLiteral[4]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!offset * 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: 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: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 496 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 488 mSDsluCounter, 850 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 648 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 849 IncrementalHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 202 mSDtfsCounter, 849 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 439 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=7, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 451 NumberOfCodeBlocks, 447 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 440 ConstructedInterpolants, 3 QuantifiedInterpolants, 4593 SizeOfPredicates, 19 NumberOfNonLiveVariables, 524 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 152/223 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (0 <= (i + 2147483648)) - ProcedureContractResult [Line: 28]: Procedure Contract for get_dummy Derived contract for procedure get_dummy. Ensures: ((d1 == \old(d1)) && (d2 == \old(d2))) - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((cond != 0) && ((d1 == \old(d1)) && (d2 == \old(d2)))) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:20:56,048 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