./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-28.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 bd298ce534de00beea346fb305edb551963d6d5842d9344f8b63a23a6d900658 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:49:36,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:49:36,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:49:36,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:49:36,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:49:36,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:49:36,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:49:36,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:49:36,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:49:36,667 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:49:36,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:49:36,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:49:36,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:49:36,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:49:36,671 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:49:36,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:49:36,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:49:36,673 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:49:36,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:49:36,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:49:36,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:49:36,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:49:36,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:49:36,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:49:36,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:49:36,679 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:49:36,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:49:36,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:49:36,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:49:36,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:49:36,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:49:36,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:49:36,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:49:36,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:49:36,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:49:36,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:49:36,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:49:36,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:49:36,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:49:36,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:49:36,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:49:36,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:49:36,685 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 -> bd298ce534de00beea346fb305edb551963d6d5842d9344f8b63a23a6d900658 [2024-11-22 10:49:36,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:49:36,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:49:37,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:49:37,002 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:49:37,002 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:49:37,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-28.i [2024-11-22 10:49:38,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:49:38,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:49:38,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-28.i [2024-11-22 10:49:38,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9b601b9/a22b1ad77dae42e089c11cfae0edfa64/FLAGd2b0c8c11 [2024-11-22 10:49:39,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9b601b9/a22b1ad77dae42e089c11cfae0edfa64 [2024-11-22 10:49:39,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:49:39,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:49:39,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:49:39,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:49:39,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:49:39,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:49:39" (1/1) ... [2024-11-22 10:49:39,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@835feee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39, skipping insertion in model container [2024-11-22 10:49:39,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:49:39" (1/1) ... [2024-11-22 10:49:39,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:49:39,322 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_loopvsstraightlinecode_25-while_file-28.i[915,928] [2024-11-22 10:49:39,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:49:39,393 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:49:39,406 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_loopvsstraightlinecode_25-while_file-28.i[915,928] [2024-11-22 10:49:39,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:49:39,462 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:49:39,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39 WrapperNode [2024-11-22 10:49:39,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:49:39,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:49:39,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:49:39,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:49:39,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39" (1/1) ... [2024-11-22 10:49:39,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39" (1/1) ... [2024-11-22 10:49:39,518 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-11-22 10:49:39,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:49:39,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:49:39,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:49:39,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:49:39,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39" (1/1) ... [2024-11-22 10:49:39,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39" (1/1) ... [2024-11-22 10:49:39,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39" (1/1) ... [2024-11-22 10:49:39,544 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-22 10:49:39,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39" (1/1) ... [2024-11-22 10:49:39,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39" (1/1) ... [2024-11-22 10:49:39,549 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39" (1/1) ... [2024-11-22 10:49:39,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39" (1/1) ... [2024-11-22 10:49:39,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39" (1/1) ... [2024-11-22 10:49:39,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39" (1/1) ... [2024-11-22 10:49:39,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:49:39,558 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:49:39,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:49:39,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:49:39,559 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39" (1/1) ... [2024-11-22 10:49:39,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:49:39,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:49:39,598 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-22 10:49:39,603 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-22 10:49:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:49:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:49:39,651 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:49:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:49:39,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:49:39,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:49:39,726 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:49:39,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:49:40,018 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-22 10:49:40,018 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:49:40,036 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:49:40,037 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:49:40,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:49:40 BoogieIcfgContainer [2024-11-22 10:49:40,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:49:40,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:49:40,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:49:40,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:49:40,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:49:39" (1/3) ... [2024-11-22 10:49:40,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b0bd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:49:40, skipping insertion in model container [2024-11-22 10:49:40,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:39" (2/3) ... [2024-11-22 10:49:40,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b0bd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:49:40, skipping insertion in model container [2024-11-22 10:49:40,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:49:40" (3/3) ... [2024-11-22 10:49:40,049 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-28.i [2024-11-22 10:49:40,067 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:49:40,067 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:49:40,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:49:40,135 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;@4854378c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:49:40,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:49:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 10:49:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-22 10:49:40,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:49:40,151 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:49:40,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:49:40,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:49:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1789399947, now seen corresponding path program 1 times [2024-11-22 10:49:40,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:49:40,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761843484] [2024-11-22 10:49:40,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:49:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:49:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:49:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-22 10:49:40,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:49:40,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761843484] [2024-11-22 10:49:40,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761843484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:49:40,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218533829] [2024-11-22 10:49:40,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:49:40,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:49:40,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:49:40,448 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-22 10:49:40,450 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-22 10:49:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:49:40,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:49:40,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:49:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-22 10:49:40,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:49:40,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218533829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:49:40,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:49:40,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:49:40,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374561767] [2024-11-22 10:49:40,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:49:40,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:49:40,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:49:40,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:49:40,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:49:40,715 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 10:49:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:49:40,758 INFO L93 Difference]: Finished difference Result 109 states and 178 transitions. [2024-11-22 10:49:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:49:40,763 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2024-11-22 10:49:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:49:40,770 INFO L225 Difference]: With dead ends: 109 [2024-11-22 10:49:40,770 INFO L226 Difference]: Without dead ends: 54 [2024-11-22 10:49:40,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-22 10:49:40,776 INFO L432 NwaCegarLoop]: 75 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, 75 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-22 10:49:40,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:49:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-22 10:49:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-22 10:49:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 10:49:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 75 transitions. [2024-11-22 10:49:40,810 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 75 transitions. Word has length 106 [2024-11-22 10:49:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:49:40,811 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 75 transitions. [2024-11-22 10:49:40,811 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 10:49:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 75 transitions. [2024-11-22 10:49:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-22 10:49:40,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:49:40,813 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:49:40,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 10:49:41,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 10:49:41,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:49:41,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:49:41,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1493523957, now seen corresponding path program 1 times [2024-11-22 10:49:41,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:49:41,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559380028] [2024-11-22 10:49:41,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:49:41,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:49:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:49:41,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 10:49:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:49:41,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 10:49:41,309 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 10:49:41,310 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:49:41,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:49:41,315 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-22 10:49:41,405 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:49:41,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:49:41 BoogieIcfgContainer [2024-11-22 10:49:41,412 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:49:41,412 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:49:41,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:49:41,413 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:49:41,413 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:49:40" (3/4) ... [2024-11-22 10:49:41,415 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 10:49:41,416 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:49:41,417 INFO L158 Benchmark]: Toolchain (without parser) took 2312.88ms. Allocated memory is still 186.6MB. Free memory was 157.0MB in the beginning and 122.0MB in the end (delta: 35.0MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-11-22 10:49:41,417 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 130.0MB. Free memory was 92.5MB in the beginning and 92.3MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:49:41,419 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.74ms. Allocated memory is still 186.6MB. Free memory was 157.0MB in the beginning and 142.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 10:49:41,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.91ms. Allocated memory is still 186.6MB. Free memory was 142.7MB in the beginning and 140.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:49:41,421 INFO L158 Benchmark]: Boogie Preprocessor took 36.95ms. Allocated memory is still 186.6MB. Free memory was 140.5MB in the beginning and 138.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:49:41,421 INFO L158 Benchmark]: RCFGBuilder took 480.46ms. Allocated memory is still 186.6MB. Free memory was 138.5MB in the beginning and 122.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 10:49:41,422 INFO L158 Benchmark]: TraceAbstraction took 1371.72ms. Allocated memory is still 186.6MB. Free memory was 121.7MB in the beginning and 123.0MB in the end (delta: -1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:49:41,422 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 186.6MB. Free memory was 123.0MB in the beginning and 122.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:49:41,424 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.22ms. Allocated memory is still 130.0MB. Free memory was 92.5MB in the beginning and 92.3MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.74ms. Allocated memory is still 186.6MB. Free memory was 157.0MB in the beginning and 142.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.91ms. Allocated memory is still 186.6MB. Free memory was 142.7MB in the beginning and 140.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.95ms. Allocated memory is still 186.6MB. Free memory was 140.5MB in the beginning and 138.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 480.46ms. Allocated memory is still 186.6MB. Free memory was 138.5MB in the beginning and 122.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1371.72ms. Allocated memory is still 186.6MB. Free memory was 121.7MB in the beginning and 123.0MB in the end (delta: -1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 186.6MB. Free memory was 123.0MB in the beginning and 122.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L23] float var_1_2 = 63.75; [L24] float var_1_3 = 255.75; [L25] signed char var_1_5 = 10; [L26] signed char var_1_6 = 4; [L27] signed char var_1_7 = -10; [L28] float var_1_8 = 4.75; [L29] float var_1_9 = 99.5; [L30] float var_1_10 = 255.9; [L31] float var_1_11 = 24.85; [L32] signed long int var_1_12 = -2; [L33] signed long int var_1_13 = 1629954775; [L34] signed long int var_1_14 = 1; [L35] signed long int var_1_15 = 1928642731; VAL [isInitial=0, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_2=255/4, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] FCALL updateLastVariables() [L95] CALL updateVariables() [L57] var_1_2 = __VERIFIER_nondet_float() [L58] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L58] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L59] var_1_3 = __VERIFIER_nondet_float() [L60] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L60] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L61] var_1_5 = __VERIFIER_nondet_char() [L62] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L62] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L63] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L63] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L64] var_1_6 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L65] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L66] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L66] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L67] var_1_7 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4, var_1_9=199/2] [L68] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4, var_1_9=199/2] [L69] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4, var_1_9=199/2] [L69] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4, var_1_9=199/2] [L70] var_1_9 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L71] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L72] var_1_10 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L73] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L74] var_1_13 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_13 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L75] RET assume_abort_if_not(var_1_13 >= 1073741822) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L76] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L76] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=1, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L77] var_1_14 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L78] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L79] CALL assume_abort_if_not(var_1_14 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L79] RET assume_abort_if_not(var_1_14 <= 1073741823) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1928642731, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L80] var_1_15 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L81] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L82] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L82] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L95] RET updateVariables() [L96] CALL step() [L39] signed long int stepLocal_0 = -4; VAL [isInitial=1, stepLocal_0=-4, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=19/4] [L40] COND TRUE stepLocal_0 < var_1_6 [L41] var_1_8 = ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, var_1_10=1928642736, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=1928642736, var_1_9=1928642736] [L43] var_1_11 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) [L44] signed long int stepLocal_1 = (((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)); VAL [isInitial=1, stepLocal_1=126, var_1_10=1928642736, var_1_11=1928642736, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=1928642736, var_1_9=1928642736] [L45] EXPR var_1_6 | 5 VAL [isInitial=1, stepLocal_1=126, var_1_10=1928642736, var_1_11=1928642736, var_1_12=-2, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=1928642736, var_1_9=1928642736] [L45] COND TRUE (var_1_6 | 5) <= stepLocal_1 [L46] var_1_12 = (((((var_1_6) < ((var_1_13 - var_1_14))) ? (var_1_6) : ((var_1_13 - var_1_14)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) VAL [isInitial=1, var_1_10=1928642736, var_1_11=1928642736, var_1_12=-1073741818, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=1, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=1928642736, var_1_9=1928642736] [L50] COND TRUE (var_1_2 - var_1_3) <= (- var_1_11) [L51] var_1_1 = (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))) VAL [isInitial=1, var_1_10=1928642736, var_1_11=1928642736, var_1_12=-1073741818, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=-5, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=1928642736, var_1_9=1928642736] [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR (((((var_1_2 - var_1_3) <= (- var_1_11)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((float) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_14))) ? (var_1_6) : ((var_1_13 - var_1_14)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) 4))) VAL [isInitial=1, var_1_10=1928642736, var_1_11=1928642736, var_1_12=-1073741818, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=-5, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=1928642736, var_1_9=1928642736] [L87-L88] return (((((var_1_2 - var_1_3) <= (- var_1_11)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((float) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_14))) ? (var_1_6) : ((var_1_13 - var_1_14)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) 4))) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1928642736, var_1_11=1928642736, var_1_12=-1073741818, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=-5, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=1928642736, var_1_9=1928642736] [L19] reach_error() VAL [isInitial=1, var_1_10=1928642736, var_1_11=1928642736, var_1_12=-1073741818, var_1_13=1073741822, var_1_14=0, var_1_15=1073741823, var_1_1=-5, var_1_5=0, var_1_6=5, var_1_7=126, var_1_8=1928642736, var_1_9=1928642736] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 16, 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, 75 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, 75 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 248 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 930/960 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-22 10:49:41,447 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-28.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 bd298ce534de00beea346fb305edb551963d6d5842d9344f8b63a23a6d900658 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:49:43,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:49:43,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 10:49:43,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:49:43,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:49:43,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:49:43,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:49:43,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:49:43,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:49:43,783 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:49:43,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:49:43,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:49:43,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:49:43,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:49:43,787 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:49:43,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:49:43,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:49:43,790 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:49:43,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:49:43,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:49:43,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:49:43,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:49:43,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:49:43,796 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 10:49:43,796 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 10:49:43,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:49:43,797 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 10:49:43,797 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:49:43,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:49:43,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:49:43,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:49:43,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:49:43,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:49:43,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:49:43,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:49:43,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:49:43,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:49:43,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:49:43,801 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 10:49:43,801 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 10:49:43,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:49:43,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:49:43,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:49:43,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:49:43,802 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 -> bd298ce534de00beea346fb305edb551963d6d5842d9344f8b63a23a6d900658 [2024-11-22 10:49:44,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:49:44,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:49:44,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:49:44,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:49:44,132 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:49:44,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-28.i [2024-11-22 10:49:45,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:49:45,990 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:49:45,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-28.i [2024-11-22 10:49:45,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65863f971/66471148ddb04598bd3776c576a2bee0/FLAGd699028ec [2024-11-22 10:49:46,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65863f971/66471148ddb04598bd3776c576a2bee0 [2024-11-22 10:49:46,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:49:46,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:49:46,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:49:46,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:49:46,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:49:46,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:49:46" (1/1) ... [2024-11-22 10:49:46,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@426f588b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46, skipping insertion in model container [2024-11-22 10:49:46,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:49:46" (1/1) ... [2024-11-22 10:49:46,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:49:46,235 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_loopvsstraightlinecode_25-while_file-28.i[915,928] [2024-11-22 10:49:46,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:49:46,317 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:49:46,331 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_loopvsstraightlinecode_25-while_file-28.i[915,928] [2024-11-22 10:49:46,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:49:46,385 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:49:46,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46 WrapperNode [2024-11-22 10:49:46,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:49:46,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:49:46,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:49:46,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:49:46,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46" (1/1) ... [2024-11-22 10:49:46,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46" (1/1) ... [2024-11-22 10:49:46,443 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-11-22 10:49:46,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:49:46,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:49:46,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:49:46,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:49:46,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46" (1/1) ... [2024-11-22 10:49:46,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46" (1/1) ... [2024-11-22 10:49:46,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46" (1/1) ... [2024-11-22 10:49:46,485 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-22 10:49:46,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46" (1/1) ... [2024-11-22 10:49:46,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46" (1/1) ... [2024-11-22 10:49:46,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46" (1/1) ... [2024-11-22 10:49:46,504 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46" (1/1) ... [2024-11-22 10:49:46,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46" (1/1) ... [2024-11-22 10:49:46,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46" (1/1) ... [2024-11-22 10:49:46,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:49:46,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:49:46,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:49:46,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:49:46,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46" (1/1) ... [2024-11-22 10:49:46,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:49:46,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:49:46,571 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-22 10:49:46,574 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-22 10:49:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:49:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 10:49:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:49:46,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:49:46,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:49:46,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:49:46,718 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:49:46,724 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:49:47,149 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-22 10:49:47,149 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:49:47,161 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:49:47,161 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:49:47,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:49:47 BoogieIcfgContainer [2024-11-22 10:49:47,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:49:47,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:49:47,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:49:47,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:49:47,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:49:46" (1/3) ... [2024-11-22 10:49:47,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a11fc6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:49:47, skipping insertion in model container [2024-11-22 10:49:47,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:46" (2/3) ... [2024-11-22 10:49:47,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a11fc6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:49:47, skipping insertion in model container [2024-11-22 10:49:47,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:49:47" (3/3) ... [2024-11-22 10:49:47,173 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-28.i [2024-11-22 10:49:47,187 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:49:47,187 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:49:47,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:49:47,258 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;@4cf7956a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:49:47,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:49:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 10:49:47,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-22 10:49:47,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:49:47,280 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:49:47,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:49:47,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:49:47,289 INFO L85 PathProgramCache]: Analyzing trace with hash -180577147, now seen corresponding path program 1 times [2024-11-22 10:49:47,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:49:47,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311450553] [2024-11-22 10:49:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:49:47,310 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-22 10:49:47,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:49:47,317 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-22 10:49:47,319 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-22 10:49:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:49:47,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:49:47,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:49:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-22 10:49:47,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:49:47,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:49:47,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311450553] [2024-11-22 10:49:47,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311450553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:49:47,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:49:47,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 10:49:47,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932719002] [2024-11-22 10:49:47,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:49:47,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:49:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:49:47,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:49:47,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:49:47,688 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 10:49:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:49:47,720 INFO L93 Difference]: Finished difference Result 91 states and 150 transitions. [2024-11-22 10:49:47,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:49:47,722 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-11-22 10:49:47,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:49:47,730 INFO L225 Difference]: With dead ends: 91 [2024-11-22 10:49:47,730 INFO L226 Difference]: Without dead ends: 45 [2024-11-22 10:49:47,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-22 10:49:47,740 INFO L432 NwaCegarLoop]: 63 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, 63 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-22 10:49:47,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:49:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-22 10:49:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-22 10:49:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 10:49:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2024-11-22 10:49:47,788 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 103 [2024-11-22 10:49:47,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:49:47,789 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-22 10:49:47,790 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 10:49:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2024-11-22 10:49:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-22 10:49:47,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:49:47,794 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:49:47,803 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-22 10:49:47,995 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-22 10:49:47,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:49:47,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:49:47,997 INFO L85 PathProgramCache]: Analyzing trace with hash -295658747, now seen corresponding path program 1 times [2024-11-22 10:49:47,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:49:47,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548608257] [2024-11-22 10:49:47,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:49:47,999 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-22 10:49:47,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:49:48,004 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-22 10:49:48,005 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-22 10:49:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:49:48,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 10:49:48,224 INFO L278 TraceCheckSpWp]: Computing forward predicates...