./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/float-benchs/zonotope_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/zonotope_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1619194307da84227512f62eb582bffd66266544ce804bd80ee6a40fe157ac7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 11:20:17,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:20:17,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:20:17,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:20:17,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:20:17,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:20:17,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:20:17,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:20:17,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:20:17,132 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:20:17,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:20:17,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:20:17,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:20:17,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:20:17,135 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:20:17,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:20:17,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:20:17,136 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:20:17,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:20:17,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:20:17,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:20:17,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:20:17,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:20:17,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:20:17,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:20:17,142 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:20:17,142 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:20:17,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:20:17,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:20:17,143 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:20:17,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:20:17,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:20:17,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:20:17,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:20:17,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:20:17,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:20:17,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:20:17,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:20:17,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:20:17,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:20:17,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:20:17,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:20:17,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:20:17,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:20:17,148 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1619194307da84227512f62eb582bffd66266544ce804bd80ee6a40fe157ac7 [2024-11-09 11:20:17,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:20:17,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:20:17,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:20:17,450 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:20:17,450 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:20:17,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/zonotope_3.c [2024-11-09 11:20:18,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:20:19,105 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:20:19,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_3.c [2024-11-09 11:20:19,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7dd20abc/ba3a9e3b7950457c9d240df094b17e1a/FLAGcc372f27c [2024-11-09 11:20:19,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7dd20abc/ba3a9e3b7950457c9d240df094b17e1a [2024-11-09 11:20:19,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:20:19,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:20:19,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:20:19,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:20:19,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:20:19,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:20:19" (1/1) ... [2024-11-09 11:20:19,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8c7469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19, skipping insertion in model container [2024-11-09 11:20:19,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:20:19" (1/1) ... [2024-11-09 11:20:19,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:20:19,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:20:19,425 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:20:19,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:20:19,463 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:20:19,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19 WrapperNode [2024-11-09 11:20:19,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:20:19,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:20:19,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:20:19,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:20:19,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19" (1/1) ... [2024-11-09 11:20:19,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19" (1/1) ... [2024-11-09 11:20:19,502 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 68 [2024-11-09 11:20:19,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:20:19,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:20:19,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:20:19,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:20:19,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19" (1/1) ... [2024-11-09 11:20:19,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19" (1/1) ... [2024-11-09 11:20:19,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19" (1/1) ... [2024-11-09 11:20:19,532 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 11:20:19,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19" (1/1) ... [2024-11-09 11:20:19,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19" (1/1) ... [2024-11-09 11:20:19,536 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19" (1/1) ... [2024-11-09 11:20:19,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19" (1/1) ... [2024-11-09 11:20:19,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19" (1/1) ... [2024-11-09 11:20:19,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19" (1/1) ... [2024-11-09 11:20:19,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:20:19,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:20:19,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:20:19,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:20:19,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19" (1/1) ... [2024-11-09 11:20:19,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:20:19,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:20:19,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 11:20:19,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 11:20:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:20:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 11:20:19,633 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 11:20:19,633 INFO L130 BoogieDeclarations]: Found specification of procedure g [2024-11-09 11:20:19,633 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2024-11-09 11:20:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:20:19,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:20:19,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:20:19,710 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:20:19,714 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:20:19,921 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-09 11:20:19,921 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:20:19,938 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:20:19,938 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 11:20:19,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:20:19 BoogieIcfgContainer [2024-11-09 11:20:19,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:20:19,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:20:19,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:20:19,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:20:19,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:20:19" (1/3) ... [2024-11-09 11:20:19,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5298ca2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:20:19, skipping insertion in model container [2024-11-09 11:20:19,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:20:19" (2/3) ... [2024-11-09 11:20:19,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5298ca2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:20:19, skipping insertion in model container [2024-11-09 11:20:19,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:20:19" (3/3) ... [2024-11-09 11:20:19,949 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_3.c [2024-11-09 11:20:19,966 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:20:19,966 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 11:20:20,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:20:20,038 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;@25507e87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:20:20,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 11:20:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:20:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 11:20:20,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:20:20,052 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:20:20,052 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:20:20,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:20:20,060 INFO L85 PathProgramCache]: Analyzing trace with hash 615464952, now seen corresponding path program 1 times [2024-11-09 11:20:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:20:20,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597583654] [2024-11-09 11:20:20,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:20:20,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:20:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:20:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:20:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:20:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:20:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:20:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 11:20:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:20:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 11:20:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 11:20:20,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:20:20,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597583654] [2024-11-09 11:20:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597583654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:20:20,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:20:20,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:20:20,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992417935] [2024-11-09 11:20:20,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:20:20,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 11:20:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:20:20,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 11:20:20,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:20:20,326 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 11:20:20,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:20:20,345 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2024-11-09 11:20:20,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 11:20:20,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 47 [2024-11-09 11:20:20,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:20:20,353 INFO L225 Difference]: With dead ends: 69 [2024-11-09 11:20:20,353 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 11:20:20,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 11:20:20,358 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:20:20,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:20:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 11:20:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 11:20:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:20:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-09 11:20:20,402 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 47 [2024-11-09 11:20:20,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:20:20,404 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-09 11:20:20,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 11:20:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-09 11:20:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 11:20:20,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:20:20,409 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:20:20,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:20:20,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:20:20,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:20:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash 481451446, now seen corresponding path program 1 times [2024-11-09 11:20:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:20:20,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428348952] [2024-11-09 11:20:20,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:20:20,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:20:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:20:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:20:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:20:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:20:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:20:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 11:20:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:20:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 11:20:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 11:20:20,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:20:20,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428348952] [2024-11-09 11:20:20,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428348952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:20:20,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:20:20,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:20:20,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343629328] [2024-11-09 11:20:20,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:20:20,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:20:20,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:20:20,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:20:20,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:20:20,669 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 11:20:20,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:20:20,718 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-11-09 11:20:20,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:20:20,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 47 [2024-11-09 11:20:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:20:20,722 INFO L225 Difference]: With dead ends: 48 [2024-11-09 11:20:20,722 INFO L226 Difference]: Without dead ends: 46 [2024-11-09 11:20:20,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:20:20,724 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:20:20,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:20:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-09 11:20:20,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-09 11:20:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 11:20:20,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-11-09 11:20:20,758 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 47 [2024-11-09 11:20:20,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:20:20,759 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-09 11:20:20,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 11:20:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-09 11:20:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 11:20:20,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:20:20,769 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:20:20,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:20:20,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:20:20,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:20:20,775 INFO L85 PathProgramCache]: Analyzing trace with hash -427375927, now seen corresponding path program 1 times [2024-11-09 11:20:20,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:20:20,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413463989] [2024-11-09 11:20:20,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:20:20,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:20:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:20:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:20:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:20:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:20:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:20:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 11:20:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:20:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 11:20:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 11:20:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 11:20:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 11:20:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 11:20:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-09 11:20:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:20:21,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413463989] [2024-11-09 11:20:21,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413463989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:20:21,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887538198] [2024-11-09 11:20:21,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:20:21,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:20:21,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:20:21,129 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 11:20:21,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:20:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 11:20:21,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:20:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-09 11:20:21,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 11:20:21,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887538198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:20:21,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 11:20:21,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 11:20:21,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065035258] [2024-11-09 11:20:21,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:20:21,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:20:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:20:21,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:20:21,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:20:21,409 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 11:20:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:20:21,477 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-11-09 11:20:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:20:21,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 73 [2024-11-09 11:20:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:20:21,481 INFO L225 Difference]: With dead ends: 46 [2024-11-09 11:20:21,481 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 11:20:21,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 11:20:21,482 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:20:21,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 190 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:20:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 11:20:21,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-09 11:20:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 11:20:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2024-11-09 11:20:21,493 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 73 [2024-11-09 11:20:21,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:20:21,494 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2024-11-09 11:20:21,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 11:20:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2024-11-09 11:20:21,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 11:20:21,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:20:21,496 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:20:21,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 11:20:21,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:20:21,701 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 11:20:21,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:20:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash -363751776, now seen corresponding path program 1 times [2024-11-09 11:20:21,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:20:21,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847321754] [2024-11-09 11:20:21,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:20:21,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:20:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 11:20:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 11:20:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:20:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 11:20:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 11:20:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 11:20:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 11:20:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 11:20:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 11:20:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 11:20:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 11:20:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 11:20:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:20:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 11:20:21,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:20:21,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847321754] [2024-11-09 11:20:21,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847321754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:20:21,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:20:21,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:20:21,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646395376] [2024-11-09 11:20:21,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:20:21,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:20:21,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:20:21,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:20:21,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:20:21,814 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 11:20:21,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:20:21,838 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2024-11-09 11:20:21,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:20:21,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 74 [2024-11-09 11:20:21,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:20:21,841 INFO L225 Difference]: With dead ends: 45 [2024-11-09 11:20:21,841 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 11:20:21,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:20:21,842 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:20:21,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:20:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 11:20:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 11:20:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:20:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 11:20:21,844 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2024-11-09 11:20:21,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:20:21,844 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 11:20:21,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 11:20:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 11:20:21,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 11:20:21,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 11:20:21,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 11:20:21,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:20:21,851 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 11:20:21,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 11:20:21,915 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 11:20:21,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:20:21 BoogieIcfgContainer [2024-11-09 11:20:21,940 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 11:20:21,941 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 11:20:21,941 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 11:20:21,941 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 11:20:21,942 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:20:19" (3/4) ... [2024-11-09 11:20:21,944 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 11:20:21,949 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2024-11-09 11:20:21,949 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2024-11-09 11:20:21,954 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 11:20:21,954 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 11:20:21,954 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 11:20:21,954 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 11:20:22,054 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 11:20:22,055 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 11:20:22,055 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 11:20:22,056 INFO L158 Benchmark]: Toolchain (without parser) took 2925.88ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 70.8MB in the beginning and 80.9MB in the end (delta: -10.1MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-11-09 11:20:22,056 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 142.6MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 11:20:22,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.05ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 70.7MB in the beginning and 151.6MB in the end (delta: -80.9MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-09 11:20:22,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.41ms. Allocated memory is still 182.5MB. Free memory was 151.6MB in the beginning and 149.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:20:22,057 INFO L158 Benchmark]: Boogie Preprocessor took 39.34ms. Allocated memory is still 182.5MB. Free memory was 149.5MB in the beginning and 147.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 11:20:22,057 INFO L158 Benchmark]: RCFGBuilder took 395.16ms. Allocated memory is still 182.5MB. Free memory was 147.4MB in the beginning and 134.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 11:20:22,057 INFO L158 Benchmark]: TraceAbstraction took 1999.47ms. Allocated memory is still 182.5MB. Free memory was 133.8MB in the beginning and 85.1MB in the end (delta: 48.6MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2024-11-09 11:20:22,058 INFO L158 Benchmark]: Witness Printer took 114.25ms. Allocated memory is still 182.5MB. Free memory was 85.1MB in the beginning and 80.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 11:20:22,059 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18ms. Allocated memory is still 142.6MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.05ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 70.7MB in the beginning and 151.6MB in the end (delta: -80.9MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.41ms. Allocated memory is still 182.5MB. Free memory was 151.6MB in the beginning and 149.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.34ms. Allocated memory is still 182.5MB. Free memory was 149.5MB in the beginning and 147.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 395.16ms. Allocated memory is still 182.5MB. Free memory was 147.4MB in the beginning and 134.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1999.47ms. Allocated memory is still 182.5MB. Free memory was 133.8MB in the beginning and 85.1MB in the end (delta: 48.6MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. * Witness Printer took 114.25ms. Allocated memory is still 182.5MB. Free memory was 85.1MB in the beginning and 80.9MB 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.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: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 40 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 157 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=2, InterpolantAutomatonStates: 16, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 175 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 369/382 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 2 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((1 < i) || (i == 1)) RESULT: Ultimate proved your program to be correct! [2024-11-09 11:20:22,082 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