./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-09 01:26:37,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:26:37,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:26:37,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:26:37,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:26:37,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:26:37,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:26:37,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:26:37,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:26:37,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:26:37,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:26:37,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:26:37,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:26:37,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:26:37,641 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:26:37,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:26:37,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:26:37,643 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:26:37,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:26:37,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:26:37,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:26:37,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:26:37,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:26:37,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:26:37,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:26:37,649 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:26:37,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:26:37,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:26:37,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:26:37,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:26:37,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:26:37,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:26:37,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:26:37,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:26:37,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:26:37,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:26:37,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:26:37,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:26:37,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:26:37,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:26:37,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:26:37,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:26:37,654 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-11-09 01:26:37,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:26:37,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:26:37,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:26:37,938 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:26:37,940 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:26:37,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i [2024-11-09 01:26:39,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:26:39,583 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:26:39,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i [2024-11-09 01:26:39,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e416f16/e89dfc2af09d417a83ad98f9b3744448/FLAG6ba1655a2 [2024-11-09 01:26:39,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e416f16/e89dfc2af09d417a83ad98f9b3744448 [2024-11-09 01:26:39,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:26:39,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:26:39,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:39,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:26:39,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:26:39,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:39" (1/1) ... [2024-11-09 01:26:39,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11be14cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:39, skipping insertion in model container [2024-11-09 01:26:39,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:39" (1/1) ... [2024-11-09 01:26:39,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:26:40,271 WARN L250 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-11-09 01:26:40,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:40,330 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:26:40,341 WARN L250 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-11-09 01:26:40,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:40,381 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:26:40,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40 WrapperNode [2024-11-09 01:26:40,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:40,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:40,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:26:40,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:26:40,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40" (1/1) ... [2024-11-09 01:26:40,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40" (1/1) ... [2024-11-09 01:26:40,421 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-11-09 01:26:40,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:40,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:26:40,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:26:40,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:26:40,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40" (1/1) ... [2024-11-09 01:26:40,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40" (1/1) ... [2024-11-09 01:26:40,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40" (1/1) ... [2024-11-09 01:26:40,450 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 01:26:40,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40" (1/1) ... [2024-11-09 01:26:40,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40" (1/1) ... [2024-11-09 01:26:40,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40" (1/1) ... [2024-11-09 01:26:40,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40" (1/1) ... [2024-11-09 01:26:40,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40" (1/1) ... [2024-11-09 01:26:40,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40" (1/1) ... [2024-11-09 01:26:40,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:26:40,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:26:40,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:26:40,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:26:40,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40" (1/1) ... [2024-11-09 01:26:40,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:26:40,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:26:40,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:26:40,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:26:40,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:26:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:26:40,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:26:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:26:40,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:26:40,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:26:40,616 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:26:40,617 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:26:40,840 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 01:26:40,841 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:26:40,860 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:26:40,860 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:26:40,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:40 BoogieIcfgContainer [2024-11-09 01:26:40,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:26:40,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:26:40,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:26:40,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:26:40,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:26:39" (1/3) ... [2024-11-09 01:26:40,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f13faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:40, skipping insertion in model container [2024-11-09 01:26:40,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:40" (2/3) ... [2024-11-09 01:26:40,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f13faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:40, skipping insertion in model container [2024-11-09 01:26:40,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:40" (3/3) ... [2024-11-09 01:26:40,872 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-98.i [2024-11-09 01:26:40,888 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:26:40,888 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:26:40,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:26:40,954 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;@67e07c9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:26:40,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:26:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 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-11-09 01:26:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 01:26:40,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:40,974 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, 1, 1, 1, 1] [2024-11-09 01:26:40,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:40,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash -976910221, now seen corresponding path program 1 times [2024-11-09 01:26:40,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:40,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217299992] [2024-11-09 01:26:40,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:40,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:26:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:26:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:26:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 01:26:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:26:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:26:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:26:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:26:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 01:26:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 01:26:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 01:26:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 01:26:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 01:26:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 01:26:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 01:26:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 01:26:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:26:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-09 01:26:41,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:26:41,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217299992] [2024-11-09 01:26:41,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217299992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:41,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:41,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:26:41,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788149355] [2024-11-09 01:26:41,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:41,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:26:41,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:26:41,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:26:41,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:26:41,434 INFO L87 Difference]: Start difference. First operand has 60 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-09 01:26:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:41,466 INFO L93 Difference]: Finished difference Result 113 states and 185 transitions. [2024-11-09 01:26:41,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:26:41,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 112 [2024-11-09 01:26:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:41,476 INFO L225 Difference]: With dead ends: 113 [2024-11-09 01:26:41,477 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 01:26:41,480 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-11-09 01:26:41,483 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:41,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:26:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 01:26:41,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 01:26:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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-11-09 01:26:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2024-11-09 01:26:41,520 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 112 [2024-11-09 01:26:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:41,521 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2024-11-09 01:26:41,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-11-09 01:26:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2024-11-09 01:26:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 01:26:41,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:41,524 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, 1, 1, 1, 1] [2024-11-09 01:26:41,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:26:41,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:41,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1823936749, now seen corresponding path program 1 times [2024-11-09 01:26:41,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266592755] [2024-11-09 01:26:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:41,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:26:41,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986956514] [2024-11-09 01:26:41,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:41,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:26:41,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:26:41,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:26:41,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:26:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:26:42,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:26:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:26:42,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:26:42,132 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:26:42,136 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:26:42,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:26:42,338 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-11-09 01:26:42,341 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 01:26:42,428 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:26:42,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:26:42 BoogieIcfgContainer [2024-11-09 01:26:42,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:26:42,432 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:26:42,433 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:26:42,433 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:26:42,433 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:40" (3/4) ... [2024-11-09 01:26:42,436 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:26:42,437 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:26:42,437 INFO L158 Benchmark]: Toolchain (without parser) took 2494.84ms. Allocated memory is still 157.3MB. Free memory was 92.0MB in the beginning and 100.7MB in the end (delta: -8.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:26:42,437 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 46.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:26:42,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.48ms. Allocated memory is still 157.3MB. Free memory was 91.6MB in the beginning and 119.9MB in the end (delta: -28.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:26:42,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.62ms. Allocated memory is still 157.3MB. Free memory was 119.9MB in the beginning and 117.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:26:42,438 INFO L158 Benchmark]: Boogie Preprocessor took 54.52ms. Allocated memory is still 157.3MB. Free memory was 117.8MB in the beginning and 115.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:26:42,439 INFO L158 Benchmark]: RCFGBuilder took 383.01ms. Allocated memory is still 157.3MB. Free memory was 115.7MB in the beginning and 100.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:26:42,439 INFO L158 Benchmark]: TraceAbstraction took 1566.28ms. Allocated memory is still 157.3MB. Free memory was 98.9MB in the beginning and 101.7MB in the end (delta: -2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:26:42,440 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 157.3MB. Free memory was 101.7MB in the beginning and 100.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:26:42,442 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.19ms. Allocated memory is still 100.7MB. Free memory is still 46.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.48ms. Allocated memory is still 157.3MB. Free memory was 91.6MB in the beginning and 119.9MB in the end (delta: -28.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.62ms. Allocated memory is still 157.3MB. Free memory was 119.9MB in the beginning and 117.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.52ms. Allocated memory is still 157.3MB. Free memory was 117.8MB in the beginning and 115.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 383.01ms. Allocated memory is still 157.3MB. Free memory was 115.7MB in the beginning and 100.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1566.28ms. Allocated memory is still 157.3MB. Free memory was 98.9MB in the beginning and 101.7MB in the end (delta: -2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 157.3MB. Free memory was 101.7MB in the beginning and 100.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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; VAL [isInitial=0, 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_2=127/2, 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] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_15 = var_1_15 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_2=127/2, 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] [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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, 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, 80 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 80 mSDtfsCounter, 0 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=60occurred 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.4s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 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-11-09 01:26:42,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-09 01:26:44,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:26:44,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:26:44,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:26:44,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:26:44,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:26:44,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:26:44,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:26:44,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:26:44,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:26:44,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:26:44,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:26:44,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:26:44,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:26:44,854 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:26:44,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:26:44,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:26:44,857 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:26:44,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:26:44,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:26:44,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:26:44,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:26:44,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:26:44,860 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:26:44,860 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:26:44,860 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:26:44,860 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:26:44,861 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:26:44,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:26:44,861 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:26:44,861 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:26:44,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:26:44,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:26:44,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:26:44,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:26:44,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:26:44,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:26:44,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:26:44,865 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:26:44,866 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:26:44,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:26:44,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:26:44,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:26:44,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:26:44,867 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-11-09 01:26:45,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:26:45,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:26:45,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:26:45,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:26:45,254 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:26:45,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i [2024-11-09 01:26:46,868 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:26:47,089 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:26:47,090 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-98.i [2024-11-09 01:26:47,100 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da53e7f7a/1c935cf99d5c480abc1a98d9c363a9c9/FLAG8e558964d [2024-11-09 01:26:47,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da53e7f7a/1c935cf99d5c480abc1a98d9c363a9c9 [2024-11-09 01:26:47,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:26:47,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:26:47,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:47,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:26:47,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:26:47,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f935776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47, skipping insertion in model container [2024-11-09 01:26:47,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:26:47,355 WARN L250 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-11-09 01:26:47,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:47,440 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:26:47,454 WARN L250 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-11-09 01:26:47,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:26:47,510 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:26:47,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47 WrapperNode [2024-11-09 01:26:47,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:26:47,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:47,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:26:47,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:26:47,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,565 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-11-09 01:26:47,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:26:47,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:26:47,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:26:47,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:26:47,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,609 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 01:26:47,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:26:47,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:26:47,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:26:47,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:26:47,639 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (1/1) ... [2024-11-09 01:26:47,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:26:47,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:26:47,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:26:47,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:26:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:26:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:26:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:26:47,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:26:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:26:47,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:26:47,810 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:26:47,812 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:26:56,416 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 01:26:56,416 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:26:56,428 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:26:56,429 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:26:56,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:56 BoogieIcfgContainer [2024-11-09 01:26:56,429 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:26:56,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:26:56,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:26:56,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:26:56,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:26:47" (1/3) ... [2024-11-09 01:26:56,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0f45df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:56, skipping insertion in model container [2024-11-09 01:26:56,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:26:47" (2/3) ... [2024-11-09 01:26:56,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0f45df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:26:56, skipping insertion in model container [2024-11-09 01:26:56,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:26:56" (3/3) ... [2024-11-09 01:26:56,438 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-98.i [2024-11-09 01:26:56,453 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:26:56,453 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:26:56,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:26:56,513 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;@47dce53f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:26:56,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:26:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 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-11-09 01:26:56,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:26:56,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:56,531 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, 1] [2024-11-09 01:26:56,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:56,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1967116166, now seen corresponding path program 1 times [2024-11-09 01:26:56,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:26:56,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49012094] [2024-11-09 01:26:56,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:56,548 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-11-09 01:26:56,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:26:56,551 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-11-09 01:26:56,552 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-11-09 01:26:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:57,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:26:57,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-09 01:26:57,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:26:57,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:26:57,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49012094] [2024-11-09 01:26:57,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49012094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:57,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:57,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:26:57,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947319435] [2024-11-09 01:26:57,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:57,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:26:57,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:26:57,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:26:57,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:26:57,125 INFO L87 Difference]: Start difference. First operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 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 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-11-09 01:26:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:57,154 INFO L93 Difference]: Finished difference Result 99 states and 165 transitions. [2024-11-09 01:26:57,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:26:57,156 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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 109 [2024-11-09 01:26:57,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:57,162 INFO L225 Difference]: With dead ends: 99 [2024-11-09 01:26:57,163 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 01:26:57,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:26:57,170 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:57,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:26:57,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 01:26:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-09 01:26:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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-11-09 01:26:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-09 01:26:57,209 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 109 [2024-11-09 01:26:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:57,209 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-09 01:26:57,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-11-09 01:26:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-09 01:26:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 01:26:57,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:57,212 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, 1] [2024-11-09 01:26:57,228 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-11-09 01:26:57,413 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-11-09 01:26:57,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:57,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:57,414 INFO L85 PathProgramCache]: Analyzing trace with hash 61737536, now seen corresponding path program 1 times [2024-11-09 01:26:57,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:26:57,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899127677] [2024-11-09 01:26:57,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:57,416 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-11-09 01:26:57,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:26:57,418 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-11-09 01:26:57,419 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-11-09 01:26:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:58,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 01:26:58,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:06,730 WARN L286 SmtUtils]: Spent 8.21s 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-11-09 01:28:14,812 WARN L286 SmtUtils]: Spent 8.08s 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)