./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/TelAviv-Amir-Minimum-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/TelAviv-Amir-Minimum-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 3924410932c0a11a3c37962c46d18333a5b413ea27c689570d00e33ef4d5ae4f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:20:52,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:20:52,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 20:20:52,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:20:52,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:20:52,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:20:52,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:20:52,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:20:52,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:20:52,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:20:52,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:20:52,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:20:52,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:20:52,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:20:52,734 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:20:52,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:20:52,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:20:52,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:20:52,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:20:52,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:20:52,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:20:52,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:20:52,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:20:52,742 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:20:52,742 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:20:52,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:20:52,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:20:52,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:20:52,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:20:52,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:20:52,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:20:52,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:20:52,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:20:52,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:20:52,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:20:52,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:20:52,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:20:52,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:20:52,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:20:52,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:20:52,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:20:52,752 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3924410932c0a11a3c37962c46d18333a5b413ea27c689570d00e33ef4d5ae4f [2024-10-14 20:20:53,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:20:53,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:20:53,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:20:53,035 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:20:53,036 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:20:53,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/TelAviv-Amir-Minimum-alloca-2.i [2024-10-14 20:20:54,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:20:54,792 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:20:54,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/TelAviv-Amir-Minimum-alloca-2.i [2024-10-14 20:20:54,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5b31227d/e32a0ecad1ab43edb79be03836b284ad/FLAG2774c597a [2024-10-14 20:20:54,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5b31227d/e32a0ecad1ab43edb79be03836b284ad [2024-10-14 20:20:54,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:20:54,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:20:54,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:20:54,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:20:54,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:20:54,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:20:54" (1/1) ... [2024-10-14 20:20:54,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70095f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:54, skipping insertion in model container [2024-10-14 20:20:54,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:20:54" (1/1) ... [2024-10-14 20:20:54,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:20:55,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:20:55,217 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:20:55,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:20:55,292 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:20:55,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:55 WrapperNode [2024-10-14 20:20:55,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:20:55,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:20:55,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:20:55,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:20:55,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:55" (1/1) ... [2024-10-14 20:20:55,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:55" (1/1) ... [2024-10-14 20:20:55,338 INFO L138 Inliner]: procedures = 110, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 82 [2024-10-14 20:20:55,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:20:55,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:20:55,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:20:55,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:20:55,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:55" (1/1) ... [2024-10-14 20:20:55,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:55" (1/1) ... [2024-10-14 20:20:55,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:55" (1/1) ... [2024-10-14 20:20:55,375 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [9, 9]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 8 writes are split as follows [4, 4]. [2024-10-14 20:20:55,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:55" (1/1) ... [2024-10-14 20:20:55,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:55" (1/1) ... [2024-10-14 20:20:55,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:55" (1/1) ... [2024-10-14 20:20:55,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:55" (1/1) ... [2024-10-14 20:20:55,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:55" (1/1) ... [2024-10-14 20:20:55,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:55" (1/1) ... [2024-10-14 20:20:55,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:20:55,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:20:55,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:20:55,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:20:55,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:55" (1/1) ... [2024-10-14 20:20:55,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:20:55,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:20:55,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 20:20:55,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 20:20:55,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 20:20:55,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 20:20:55,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 20:20:55,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 20:20:55,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 20:20:55,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 20:20:55,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:20:55,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:20:55,573 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:20:55,578 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:20:55,763 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 20:20:55,764 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:20:55,792 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:20:55,793 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 20:20:55,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:20:55 BoogieIcfgContainer [2024-10-14 20:20:55,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:20:55,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:20:55,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:20:55,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:20:55,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:20:54" (1/3) ... [2024-10-14 20:20:55,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7d041d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:20:55, skipping insertion in model container [2024-10-14 20:20:55,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:55" (2/3) ... [2024-10-14 20:20:55,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7d041d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:20:55, skipping insertion in model container [2024-10-14 20:20:55,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:20:55" (3/3) ... [2024-10-14 20:20:55,834 INFO L112 eAbstractionObserver]: Analyzing ICFG TelAviv-Amir-Minimum-alloca-2.i [2024-10-14 20:20:55,857 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:20:55,857 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-14 20:20:55,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:20:55,939 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;@694a999b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:20:55,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-14 20:20:55,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 20:20:55,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:55,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:55,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:20:55,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:55,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1143660164, now seen corresponding path program 1 times [2024-10-14 20:20:55,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:55,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819983137] [2024-10-14 20:20:55,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:55,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:56,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:56,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819983137] [2024-10-14 20:20:56,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819983137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:56,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:56,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:20:56,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555286172] [2024-10-14 20:20:56,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:56,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:20:56,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:56,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:20:56,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:20:56,547 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 26 states have internal predecessors, (32), 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) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:56,628 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-10-14 20:20:56,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:20:56,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 20:20:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:56,640 INFO L225 Difference]: With dead ends: 31 [2024-10-14 20:20:56,640 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 20:20:56,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:20:56,646 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:56,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 20:20:56,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-14 20:20:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-14 20:20:56,682 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 7 [2024-10-14 20:20:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:56,682 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-14 20:20:56,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-14 20:20:56,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 20:20:56,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:56,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:56,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:20:56,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:20:56,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:56,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1143660356, now seen corresponding path program 1 times [2024-10-14 20:20:56,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:56,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888171663] [2024-10-14 20:20:56,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:56,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:56,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:56,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888171663] [2024-10-14 20:20:56,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888171663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:56,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:56,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:20:56,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298199794] [2024-10-14 20:20:56,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:56,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:20:56,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:56,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:20:56,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:20:56,792 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:56,854 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-10-14 20:20:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:20:56,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 20:20:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:56,856 INFO L225 Difference]: With dead ends: 24 [2024-10-14 20:20:56,856 INFO L226 Difference]: Without dead ends: 23 [2024-10-14 20:20:56,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:20:56,858 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:56,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 36 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-14 20:20:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-14 20:20:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-14 20:20:56,865 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 7 [2024-10-14 20:20:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:56,866 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-14 20:20:56,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-10-14 20:20:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 20:20:56,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:56,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:56,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:20:56,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:20:56,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:56,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1143677045, now seen corresponding path program 1 times [2024-10-14 20:20:56,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:56,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232515641] [2024-10-14 20:20:56,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:56,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:56,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:56,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232515641] [2024-10-14 20:20:56,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232515641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:56,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:56,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:20:56,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775873312] [2024-10-14 20:20:56,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:56,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:20:56,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:56,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:20:56,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:20:56,994 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:57,049 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-10-14 20:20:57,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:20:57,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 20:20:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:57,051 INFO L225 Difference]: With dead ends: 24 [2024-10-14 20:20:57,052 INFO L226 Difference]: Without dead ends: 23 [2024-10-14 20:20:57,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:20:57,053 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:57,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 29 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:57,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-14 20:20:57,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-10-14 20:20:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-14 20:20:57,062 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 7 [2024-10-14 20:20:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:57,063 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-14 20:20:57,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-14 20:20:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 20:20:57,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:57,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:57,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:20:57,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:20:57,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:57,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1143677237, now seen corresponding path program 1 times [2024-10-14 20:20:57,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:57,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745536535] [2024-10-14 20:20:57,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:57,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:57,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745536535] [2024-10-14 20:20:57,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745536535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:57,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:57,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:20:57,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584104527] [2024-10-14 20:20:57,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:57,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:20:57,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:57,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:20:57,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:20:57,172 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:57,223 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-10-14 20:20:57,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:20:57,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 20:20:57,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:57,225 INFO L225 Difference]: With dead ends: 22 [2024-10-14 20:20:57,225 INFO L226 Difference]: Without dead ends: 21 [2024-10-14 20:20:57,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:20:57,228 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:57,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 30 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-14 20:20:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-14 20:20:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-14 20:20:57,234 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 7 [2024-10-14 20:20:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:57,234 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-14 20:20:57,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-14 20:20:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:20:57,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:57,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:57,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:20:57,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:20:57,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:57,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1093726774, now seen corresponding path program 1 times [2024-10-14 20:20:57,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:57,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804324717] [2024-10-14 20:20:57,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:57,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:57,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:57,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804324717] [2024-10-14 20:20:57,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804324717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:57,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:57,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:20:57,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776411251] [2024-10-14 20:20:57,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:57,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:20:57,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:57,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:20:57,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:20:57,360 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:57,398 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-10-14 20:20:57,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:20:57,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 20:20:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:57,400 INFO L225 Difference]: With dead ends: 21 [2024-10-14 20:20:57,400 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 20:20:57,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:20:57,401 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:57,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 20:20:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-14 20:20:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-14 20:20:57,409 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 8 [2024-10-14 20:20:57,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:57,410 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-14 20:20:57,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-14 20:20:57,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:20:57,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:57,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:57,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:20:57,411 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:20:57,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:57,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1093732732, now seen corresponding path program 1 times [2024-10-14 20:20:57,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:57,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233294443] [2024-10-14 20:20:57,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:57,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:57,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:57,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233294443] [2024-10-14 20:20:57,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233294443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:57,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:57,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:20:57,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090713288] [2024-10-14 20:20:57,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:57,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:20:57,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:57,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:20:57,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:20:57,502 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:57,535 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-10-14 20:20:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:20:57,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 20:20:57,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:57,537 INFO L225 Difference]: With dead ends: 20 [2024-10-14 20:20:57,537 INFO L226 Difference]: Without dead ends: 19 [2024-10-14 20:20:57,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:20:57,538 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:57,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:57,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-14 20:20:57,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-14 20:20:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-14 20:20:57,547 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 8 [2024-10-14 20:20:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:57,547 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-14 20:20:57,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-10-14 20:20:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:20:57,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:57,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:57,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 20:20:57,549 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:20:57,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1094250102, now seen corresponding path program 1 times [2024-10-14 20:20:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:57,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782543061] [2024-10-14 20:20:57,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:57,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:57,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:57,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782543061] [2024-10-14 20:20:57,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782543061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:57,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:57,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:20:57,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965997930] [2024-10-14 20:20:57,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:57,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:20:57,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:57,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:20:57,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:20:57,702 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:57,763 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2024-10-14 20:20:57,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:20:57,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 20:20:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:57,765 INFO L225 Difference]: With dead ends: 19 [2024-10-14 20:20:57,765 INFO L226 Difference]: Without dead ends: 18 [2024-10-14 20:20:57,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:20:57,766 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:57,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 26 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-14 20:20:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-14 20:20:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-10-14 20:20:57,773 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8 [2024-10-14 20:20:57,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:57,773 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-14 20:20:57,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-10-14 20:20:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:20:57,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:20:57,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:57,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 20:20:57,774 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:20:57,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:20:57,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1094256060, now seen corresponding path program 1 times [2024-10-14 20:20:57,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:20:57,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285220957] [2024-10-14 20:20:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:20:57,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:20:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:20:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:20:57,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:20:57,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285220957] [2024-10-14 20:20:57,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285220957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:20:57,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:20:57,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:20:57,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458983067] [2024-10-14 20:20:57,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:20:57,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:20:57,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:20:57,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:20:57,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:20:57,872 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:20:57,926 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2024-10-14 20:20:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:20:57,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 20:20:57,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:20:57,927 INFO L225 Difference]: With dead ends: 18 [2024-10-14 20:20:57,927 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:20:57,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:20:57,928 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:20:57,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 25 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:20:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:20:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:20:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:20:57,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2024-10-14 20:20:57,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:20:57,929 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:20:57,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:20:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:20:57,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:20:57,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-14 20:20:57,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-14 20:20:57,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-14 20:20:57,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-14 20:20:57,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-14 20:20:57,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-14 20:20:57,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-14 20:20:57,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-14 20:20:57,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 20:20:57,940 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:20:57,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:20:57,957 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:20:57,967 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-14 20:20:57,968 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-14 20:20:57,968 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~y~0!base,]]] [2024-10-14 20:20:57,970 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-14 20:20:57,970 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-14 20:20:57,970 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x~0!base,]]] [2024-10-14 20:20:57,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:20:57 BoogieIcfgContainer [2024-10-14 20:20:57,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:20:57,974 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:20:57,974 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:20:57,974 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:20:57,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:20:55" (3/4) ... [2024-10-14 20:20:57,977 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:20:57,984 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-14 20:20:57,984 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 20:20:57,985 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 20:20:57,985 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 20:20:58,063 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:20:58,064 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:20:58,064 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:20:58,064 INFO L158 Benchmark]: Toolchain (without parser) took 3239.55ms. Allocated memory is still 178.3MB. Free memory was 108.4MB in the beginning and 63.6MB in the end (delta: 44.8MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2024-10-14 20:20:58,065 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 113.2MB. Free memory was 73.4MB in the beginning and 73.3MB in the end (delta: 115.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:20:58,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.70ms. Allocated memory is still 178.3MB. Free memory was 108.1MB in the beginning and 90.7MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 20:20:58,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.60ms. Allocated memory is still 178.3MB. Free memory was 90.7MB in the beginning and 89.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:20:58,065 INFO L158 Benchmark]: Boogie Preprocessor took 53.72ms. Allocated memory is still 178.3MB. Free memory was 88.9MB in the beginning and 87.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:20:58,066 INFO L158 Benchmark]: RCFGBuilder took 398.83ms. Allocated memory is still 178.3MB. Free memory was 87.0MB in the beginning and 72.1MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 20:20:58,066 INFO L158 Benchmark]: TraceAbstraction took 2154.12ms. Allocated memory is still 178.3MB. Free memory was 148.3MB in the beginning and 67.8MB in the end (delta: 80.5MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. [2024-10-14 20:20:58,066 INFO L158 Benchmark]: Witness Printer took 90.36ms. Allocated memory is still 178.3MB. Free memory was 67.8MB in the beginning and 63.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:20:58,068 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.21ms. Allocated memory is still 113.2MB. Free memory was 73.4MB in the beginning and 73.3MB in the end (delta: 115.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.70ms. Allocated memory is still 178.3MB. Free memory was 108.1MB in the beginning and 90.7MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.60ms. Allocated memory is still 178.3MB. Free memory was 90.7MB in the beginning and 89.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.72ms. Allocated memory is still 178.3MB. Free memory was 88.9MB in the beginning and 87.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.83ms. Allocated memory is still 178.3MB. Free memory was 87.0MB in the beginning and 72.1MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2154.12ms. Allocated memory is still 178.3MB. Free memory was 148.3MB in the beginning and 67.8MB in the end (delta: 80.5MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. * Witness Printer took 90.36ms. Allocated memory is still 178.3MB. Free memory was 67.8MB in the beginning and 63.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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],[IdentifierExpression[~y~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x~0!base,]]] * 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: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 564]: 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 1 procedures, 27 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 234 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 105 mSDtfsCounter, 234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 38, 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, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 300 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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 8 specifications checked. All of them hold - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-10-14 20:20:58,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE