./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/hardness-nfm22/hardness_variablewrapping_normal_file-98.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 391f5d8b898ab2981d898384ae502b469bbad72d3843c4719f1b24203d9f9914 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:12:05,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:12:05,348 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:12:05,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:12:05,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:12:05,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:12:05,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:12:05,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:12:05,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:12:05,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:12:05,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:12:05,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:12:05,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:12:05,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:12:05,375 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:12:05,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:12:05,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:12:05,376 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:12:05,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:12:05,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:12:05,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:12:05,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:12:05,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:12:05,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:12:05,378 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:12:05,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:12:05,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:12:05,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:12:05,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:12:05,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:12:05,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:12:05,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:12:05,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:12:05,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:12:05,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:12:05,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:12:05,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:12:05,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:12:05,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:12:05,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:12:05,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:12:05,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:12:05,383 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 ! call(reach_error())) ) 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 -> 391f5d8b898ab2981d898384ae502b469bbad72d3843c4719f1b24203d9f9914 [2024-10-24 11:12:05,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:12:05,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:12:05,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:12:05,652 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:12:05,653 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:12:05,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i [2024-10-24 11:12:07,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:12:07,274 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:12:07,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i [2024-10-24 11:12:07,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd353732/4e7ab16fe37048aeb7206145f1810096/FLAG77ae1e30c [2024-10-24 11:12:07,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd353732/4e7ab16fe37048aeb7206145f1810096 [2024-10-24 11:12:07,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:12:07,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:12:07,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:12:07,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:12:07,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:12:07,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:12:07" (1/1) ... [2024-10-24 11:12:07,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d21dfd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07, skipping insertion in model container [2024-10-24 11:12:07,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:12:07" (1/1) ... [2024-10-24 11:12:07,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:12:07,453 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i[913,926] [2024-10-24 11:12:07,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:12:07,514 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:12:07,523 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i[913,926] [2024-10-24 11:12:07,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:12:07,552 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:12:07,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07 WrapperNode [2024-10-24 11:12:07,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:12:07,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:12:07,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:12:07,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:12:07,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07" (1/1) ... [2024-10-24 11:12:07,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07" (1/1) ... [2024-10-24 11:12:07,588 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-10-24 11:12:07,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:12:07,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:12:07,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:12:07,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:12:07,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07" (1/1) ... [2024-10-24 11:12:07,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07" (1/1) ... [2024-10-24 11:12:07,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07" (1/1) ... [2024-10-24 11:12:07,613 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 11:12:07,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07" (1/1) ... [2024-10-24 11:12:07,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07" (1/1) ... [2024-10-24 11:12:07,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07" (1/1) ... [2024-10-24 11:12:07,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07" (1/1) ... [2024-10-24 11:12:07,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07" (1/1) ... [2024-10-24 11:12:07,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07" (1/1) ... [2024-10-24 11:12:07,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:12:07,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:12:07,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:12:07,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:12:07,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07" (1/1) ... [2024-10-24 11:12:07,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:12:07,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:12:07,667 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-24 11:12:07,668 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-24 11:12:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:12:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:12:07,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:12:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:12:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:12:07,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:12:07,757 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:12:07,759 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:12:07,960 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 11:12:07,960 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:12:08,052 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:12:08,052 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:12:08,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:12:08 BoogieIcfgContainer [2024-10-24 11:12:08,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:12:08,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:12:08,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:12:08,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:12:08,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:12:07" (1/3) ... [2024-10-24 11:12:08,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f10585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:12:08, skipping insertion in model container [2024-10-24 11:12:08,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:07" (2/3) ... [2024-10-24 11:12:08,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f10585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:12:08, skipping insertion in model container [2024-10-24 11:12:08,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:12:08" (3/3) ... [2024-10-24 11:12:08,088 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-98.i [2024-10-24 11:12:08,102 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:12:08,103 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:12:08,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:12:08,174 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;@4bc1beeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:12:08,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:12:08,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:12:08,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:12:08,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:12:08,199 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:12:08,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:12:08,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:12:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash 247280691, now seen corresponding path program 1 times [2024-10-24 11:12:08,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:12:08,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091840519] [2024-10-24 11:12:08,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:12:08,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:12:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:12:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:12:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:12:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 11:12:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 11:12:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:12:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:12:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:12:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:12:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:12:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:12:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:12:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 11:12:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 11:12:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 11:12:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 11:12:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:12:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:12:08,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:12:08,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091840519] [2024-10-24 11:12:08,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091840519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:12:08,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:12:08,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:12:08,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443909771] [2024-10-24 11:12:08,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:12:08,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:12:08,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:12:08,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:12:08,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:12:08,553 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:12:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:12:08,587 INFO L93 Difference]: Finished difference Result 105 states and 177 transitions. [2024-10-24 11:12:08,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:12:08,590 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-10-24 11:12:08,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:12:08,597 INFO L225 Difference]: With dead ends: 105 [2024-10-24 11:12:08,597 INFO L226 Difference]: Without dead ends: 52 [2024-10-24 11:12:08,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:12:08,606 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:12:08,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:12:08,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-24 11:12:08,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-24 11:12:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:12:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-10-24 11:12:08,650 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 108 [2024-10-24 11:12:08,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:12:08,651 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-10-24 11:12:08,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:12:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-10-24 11:12:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 11:12:08,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:12:08,656 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:12:08,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:12:08,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:12:08,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:12:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash 60535929, now seen corresponding path program 1 times [2024-10-24 11:12:08,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:12:08,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894180538] [2024-10-24 11:12:08,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:12:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:12:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:12:08,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805707135] [2024-10-24 11:12:08,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:12:08,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:12:08,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:12:08,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:12:08,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:12:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:12:09,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:12:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:12:09,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:12:09,110 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:12:09,111 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:12:09,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:12:09,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:12:09,317 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 11:12:09,371 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:12:09,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:12:09 BoogieIcfgContainer [2024-10-24 11:12:09,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:12:09,374 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:12:09,374 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:12:09,375 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:12:09,375 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:12:08" (3/4) ... [2024-10-24 11:12:09,377 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:12:09,378 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:12:09,378 INFO L158 Benchmark]: Toolchain (without parser) took 2077.50ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 98.3MB in the beginning and 102.7MB in the end (delta: -4.3MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2024-10-24 11:12:09,379 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory was 115.4MB in the beginning and 115.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:12:09,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.49ms. Allocated memory is still 155.2MB. Free memory was 97.9MB in the beginning and 84.1MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 11:12:09,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.02ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 82.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:12:09,381 INFO L158 Benchmark]: Boogie Preprocessor took 39.43ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 79.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:12:09,381 INFO L158 Benchmark]: RCFGBuilder took 419.66ms. Allocated memory is still 155.2MB. Free memory was 79.5MB in the beginning and 122.7MB in the end (delta: -43.2MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-10-24 11:12:09,382 INFO L158 Benchmark]: TraceAbstraction took 1294.76ms. Allocated memory is still 205.5MB. Free memory was 176.1MB in the beginning and 102.7MB in the end (delta: 73.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-10-24 11:12:09,382 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 205.5MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:12:09,384 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.18ms. Allocated memory is still 155.2MB. Free memory was 115.4MB in the beginning and 115.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.49ms. Allocated memory is still 155.2MB. Free memory was 97.9MB in the beginning and 84.1MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.02ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 82.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.43ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 79.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 419.66ms. Allocated memory is still 155.2MB. Free memory was 79.5MB in the beginning and 122.7MB in the end (delta: -43.2MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1294.76ms. Allocated memory is still 205.5MB. Free memory was 176.1MB in the beginning and 102.7MB in the end (delta: 73.4MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 205.5MB. Free memory is still 102.7MB. There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryArithmeticDOUBLEoperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 4.8; [L23] double var_1_2 = 63.5; [L24] double var_1_3 = 9999999.5; [L25] double var_1_4 = 0.6; [L26] signed short int var_1_6 = 10; [L27] signed long int var_1_7 = -1; [L28] double var_1_8 = 4.4; [L29] double var_1_9 = 7.25; [L30] double var_1_10 = 7.5; [L31] double var_1_11 = 2.3; [L32] unsigned long int var_1_12 = 128; [L33] unsigned long int var_1_13 = 0; [L34] unsigned long int var_1_14 = 4078799264; [L35] unsigned long int var_1_15 = 500; [L36] unsigned long int var_1_16 = 25; [L37] unsigned long int last_1_var_1_15 = 500; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_15 = var_1_15 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L65] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_3=19999999/2, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L66] var_1_3 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L67] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=10, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L68] var_1_6 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L70] CALL assume_abort_if_not(var_1_6 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L70] RET assume_abort_if_not(var_1_6 <= 32) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=-1, var_1_8=22/5, var_1_9=29/4] [L71] var_1_7 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L72] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L73] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L73] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L74] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L74] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_8=22/5, var_1_9=29/4] [L75] var_1_8 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=29/4] [L76] RET assume_abort_if_not((var_1_8 >= -115292.1504606845700e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 1152921.504606845700e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1, var_1_9=29/4] [L77] var_1_9 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_9 >= -115292.1504606845700e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 1152921.504606845700e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L78] RET assume_abort_if_not((var_1_9 >= -115292.1504606845700e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 1152921.504606845700e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=500, var_1_10=15/2, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L79] var_1_10 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L80] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=500, var_1_11=23/10, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L81] var_1_11 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L82] RET assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L83] var_1_13 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L84] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L85] CALL assume_abort_if_not(var_1_13 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L85] RET assume_abort_if_not(var_1_13 <= 4294967294) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=4078799264, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L86] var_1_14 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L87] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L88] CALL assume_abort_if_not(var_1_14 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L88] RET assume_abort_if_not(var_1_14 <= 4294967294) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=25, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L89] var_1_16 = __VERIFIER_nondet_ulong() [L90] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L90] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L91] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=-4294967287, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=-4294967287, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L91] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=-4294967287, var_1_1=24/5, var_1_4=3/5, var_1_6=0, var_1_7=1] [L105] RET updateVariables() [L106] CALL step() [L41] var_1_1 = (var_1_2 - var_1_3) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=500, var_1_16=-4294967287, var_1_4=3/5, var_1_6=0, var_1_7=1] [L42] COND FALSE !(((((-128) < (last_1_var_1_15)) ? (-128) : (last_1_var_1_15))) < var_1_13) [L49] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=-4294967287, var_1_16=-4294967287, var_1_4=3/5, var_1_6=0, var_1_7=1] [L51] EXPR var_1_15 >> var_1_6 VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=-4294967287, var_1_16=-4294967287, var_1_4=3/5, var_1_6=0, var_1_7=1] [L51] unsigned long int stepLocal_0 = (var_1_15 >> var_1_6) / var_1_7; [L52] COND TRUE 8 < stepLocal_0 [L53] var_1_4 = (((var_1_8 + var_1_9) + ((((var_1_10) < (1.9)) ? (var_1_10) : (1.9)))) + (99.125 + var_1_11)) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=-4294967287, var_1_16=-4294967287, var_1_6=0, var_1_7=1] [L55] COND FALSE !(var_1_2 < var_1_8) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=-4294967287, var_1_16=-4294967287, var_1_6=0, var_1_7=1] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR (var_1_1 == ((double) (var_1_2 - var_1_3))) && ((8 < ((var_1_15 >> var_1_6) / var_1_7)) ? (var_1_4 == ((double) (((var_1_8 + var_1_9) + ((((var_1_10) < (1.9)) ? (var_1_10) : (1.9)))) + (99.125 + var_1_11)))) : 1) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=-4294967287, var_1_16=-4294967287, var_1_6=0, var_1_7=1] [L97-L98] return (((var_1_1 == ((double) (var_1_2 - var_1_3))) && ((8 < ((var_1_15 >> var_1_6) / var_1_7)) ? (var_1_4 == ((double) (((var_1_8 + var_1_9) + ((((var_1_10) < (1.9)) ? (var_1_10) : (1.9)))) + (99.125 + var_1_11)))) : 1)) && ((var_1_2 < var_1_8) ? ((((- var_1_15) <= var_1_6) || (var_1_4 < var_1_10)) ? (var_1_12 == ((unsigned long int) ((((var_1_6) < (var_1_13)) ? (var_1_6) : (var_1_13))))) : (var_1_12 == ((unsigned long int) (var_1_14 - var_1_6)))) : 1)) && ((((((-128) < (last_1_var_1_15)) ? (-128) : (last_1_var_1_15))) < var_1_13) ? ((last_1_var_1_15 > var_1_7) ? (var_1_15 == ((unsigned long int) (var_1_6 + var_1_16))) : (var_1_15 == ((unsigned long int) var_1_14))) : (var_1_15 == ((unsigned long int) var_1_16))) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=-4294967287, var_1_16=-4294967287, var_1_6=0, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=500, var_1_12=128, var_1_13=0, var_1_14=2147483647, var_1_15=-4294967287, var_1_16=-4294967287, var_1_6=0, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 73 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 544/544 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:12:09,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardness-nfm22/hardness_variablewrapping_normal_file-98.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 391f5d8b898ab2981d898384ae502b469bbad72d3843c4719f1b24203d9f9914 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:12:11,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:12:11,656 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:12:11,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:12:11,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:12:11,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:12:11,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:12:11,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:12:11,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:12:11,686 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:12:11,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:12:11,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:12:11,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:12:11,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:12:11,689 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:12:11,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:12:11,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:12:11,690 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:12:11,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:12:11,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:12:11,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:12:11,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:12:11,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:12:11,694 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:12:11,694 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:12:11,694 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:12:11,695 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:12:11,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:12:11,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:12:11,695 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:12:11,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:12:11,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:12:11,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:12:11,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:12:11,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:12:11,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:12:11,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:12:11,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:12:11,697 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:12:11,697 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:12:11,698 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:12:11,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:12:11,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:12:11,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:12:11,699 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:12:11,699 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 ! call(reach_error())) ) 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 -> 391f5d8b898ab2981d898384ae502b469bbad72d3843c4719f1b24203d9f9914 [2024-10-24 11:12:11,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:12:11,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:12:11,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:12:11,984 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:12:11,985 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:12:11,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i [2024-10-24 11:12:13,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:12:13,485 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:12:13,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i [2024-10-24 11:12:13,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a8576c0/aa49089bec984550896fbdf8dbe51725/FLAG12b877144 [2024-10-24 11:12:13,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a8576c0/aa49089bec984550896fbdf8dbe51725 [2024-10-24 11:12:13,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:12:13,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:12:13,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:12:13,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:12:13,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:12:13,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:12:13" (1/1) ... [2024-10-24 11:12:13,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f869793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13, skipping insertion in model container [2024-10-24 11:12:13,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:12:13" (1/1) ... [2024-10-24 11:12:13,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:12:13,717 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i[913,926] [2024-10-24 11:12:13,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:12:13,777 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:12:13,789 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i[913,926] [2024-10-24 11:12:13,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:12:13,834 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:12:13,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13 WrapperNode [2024-10-24 11:12:13,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:12:13,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:12:13,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:12:13,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:12:13,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13" (1/1) ... [2024-10-24 11:12:13,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13" (1/1) ... [2024-10-24 11:12:13,884 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-10-24 11:12:13,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:12:13,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:12:13,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:12:13,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:12:13,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13" (1/1) ... [2024-10-24 11:12:13,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13" (1/1) ... [2024-10-24 11:12:13,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13" (1/1) ... [2024-10-24 11:12:13,913 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 11:12:13,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13" (1/1) ... [2024-10-24 11:12:13,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13" (1/1) ... [2024-10-24 11:12:13,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13" (1/1) ... [2024-10-24 11:12:13,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13" (1/1) ... [2024-10-24 11:12:13,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13" (1/1) ... [2024-10-24 11:12:13,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13" (1/1) ... [2024-10-24 11:12:13,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:12:13,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:12:13,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:12:13,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:12:13,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13" (1/1) ... [2024-10-24 11:12:13,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:12:13,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:12:13,975 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-24 11:12:13,977 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-24 11:12:14,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:12:14,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:12:14,014 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:12:14,014 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:12:14,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:12:14,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:12:14,093 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:12:14,095 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:12:22,656 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 11:12:22,656 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:12:22,690 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:12:22,691 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:12:22,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:12:22 BoogieIcfgContainer [2024-10-24 11:12:22,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:12:22,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:12:22,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:12:22,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:12:22,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:12:13" (1/3) ... [2024-10-24 11:12:22,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3a6902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:12:22, skipping insertion in model container [2024-10-24 11:12:22,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:12:13" (2/3) ... [2024-10-24 11:12:22,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3a6902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:12:22, skipping insertion in model container [2024-10-24 11:12:22,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:12:22" (3/3) ... [2024-10-24 11:12:22,697 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-98.i [2024-10-24 11:12:22,710 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:12:22,710 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:12:22,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:12:22,769 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;@127c78a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:12:22,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:12:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:12:22,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:12:22,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:12:22,785 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:12:22,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:12:22,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:12:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash 651518210, now seen corresponding path program 1 times [2024-10-24 11:12:22,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:12:22,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021190809] [2024-10-24 11:12:22,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:12:22,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:12:22,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:12:22,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:12:22,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:12:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:23,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:12:23,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:12:23,291 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-24 11:12:23,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:12:23,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:12:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021190809] [2024-10-24 11:12:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021190809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:12:23,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:12:23,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:12:23,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388522918] [2024-10-24 11:12:23,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:12:23,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:12:23,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:12:23,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:12:23,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:12:23,324 INFO L87 Difference]: Start difference. First operand has 47 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:12:27,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:12:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:12:27,467 INFO L93 Difference]: Finished difference Result 91 states and 157 transitions. [2024-10-24 11:12:27,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:12:27,513 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 105 [2024-10-24 11:12:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:12:27,519 INFO L225 Difference]: With dead ends: 91 [2024-10-24 11:12:27,519 INFO L226 Difference]: Without dead ends: 45 [2024-10-24 11:12:27,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:12:27,524 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:12:27,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-24 11:12:27,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-24 11:12:27,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-24 11:12:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:12:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2024-10-24 11:12:27,572 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 105 [2024-10-24 11:12:27,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:12:27,573 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2024-10-24 11:12:27,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:12:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2024-10-24 11:12:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 11:12:27,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:12:27,581 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:12:27,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:12:27,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:12:27,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:12:27,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:12:27,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1132607100, now seen corresponding path program 1 times [2024-10-24 11:12:27,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:12:27,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466457135] [2024-10-24 11:12:27,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:12:27,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:12:27,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:12:27,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:12:27,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:12:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:12:28,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:12:28,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:13:42,058 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 11:13:50,151 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)