./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-66.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 bf87e1196d75253bcac685a2c2730327c9154a0ef878663ed8ae9aa04b751e94 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:38:19,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:38:20,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:38:20,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:38:20,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:38:20,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:38:20,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:38:20,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:38:20,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:38:20,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:38:20,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:38:20,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:38:20,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:38:20,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:38:20,103 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:38:20,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:38:20,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:38:20,103 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:38:20,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:38:20,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:38:20,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:38:20,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:38:20,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:38:20,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:38:20,109 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:38:20,109 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:38:20,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:38:20,109 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:38:20,109 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:38:20,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:38:20,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:38:20,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:38:20,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:38:20,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:38:20,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:38:20,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:38:20,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:38:20,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:38:20,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:38:20,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:38:20,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:38:20,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:38:20,115 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 -> bf87e1196d75253bcac685a2c2730327c9154a0ef878663ed8ae9aa04b751e94 [2024-11-10 07:38:20,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:38:20,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:38:20,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:38:20,340 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:38:20,340 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:38:20,341 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-66.i [2024-11-10 07:38:21,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:38:21,889 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:38:21,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-66.i [2024-11-10 07:38:21,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ad3e20d/0de67564929e4267a8c647ff0013a72a/FLAGca400067f [2024-11-10 07:38:22,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67ad3e20d/0de67564929e4267a8c647ff0013a72a [2024-11-10 07:38:22,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:38:22,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:38:22,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:38:22,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:38:22,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:38:22,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:38:22" (1/1) ... [2024-11-10 07:38:22,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f4e01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22, skipping insertion in model container [2024-11-10 07:38:22,248 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:38:22" (1/1) ... [2024-11-10 07:38:22,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:38:22,443 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-66.i[915,928] [2024-11-10 07:38:22,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:38:22,484 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:38:22,493 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-66.i[915,928] [2024-11-10 07:38:22,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:38:22,520 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:38:22,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22 WrapperNode [2024-11-10 07:38:22,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:38:22,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:38:22,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:38:22,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:38:22,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22" (1/1) ... [2024-11-10 07:38:22,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22" (1/1) ... [2024-11-10 07:38:22,579 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-10 07:38:22,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:38:22,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:38:22,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:38:22,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:38:22,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22" (1/1) ... [2024-11-10 07:38:22,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22" (1/1) ... [2024-11-10 07:38:22,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22" (1/1) ... [2024-11-10 07:38:22,619 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-10 07:38:22,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22" (1/1) ... [2024-11-10 07:38:22,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22" (1/1) ... [2024-11-10 07:38:22,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22" (1/1) ... [2024-11-10 07:38:22,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22" (1/1) ... [2024-11-10 07:38:22,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22" (1/1) ... [2024-11-10 07:38:22,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22" (1/1) ... [2024-11-10 07:38:22,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:38:22,642 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:38:22,642 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:38:22,642 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:38:22,643 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22" (1/1) ... [2024-11-10 07:38:22,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:38:22,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:38:22,676 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-10 07:38:22,679 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-10 07:38:22,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:38:22,712 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:38:22,712 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:38:22,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:38:22,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:38:22,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:38:22,778 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:38:22,779 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:38:23,003 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 07:38:23,004 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:38:23,016 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:38:23,017 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:38:23,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:38:23 BoogieIcfgContainer [2024-11-10 07:38:23,017 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:38:23,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:38:23,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:38:23,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:38:23,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:38:22" (1/3) ... [2024-11-10 07:38:23,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158eaaa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:38:23, skipping insertion in model container [2024-11-10 07:38:23,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:22" (2/3) ... [2024-11-10 07:38:23,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158eaaa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:38:23, skipping insertion in model container [2024-11-10 07:38:23,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:38:23" (3/3) ... [2024-11-10 07:38:23,028 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-66.i [2024-11-10 07:38:23,044 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:38:23,044 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:38:23,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:38:23,107 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;@555f52b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:38:23,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:38:23,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 07:38:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 07:38:23,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:38:23,122 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:38:23,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:38:23,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:38:23,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1949263632, now seen corresponding path program 1 times [2024-11-10 07:38:23,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:38:23,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83285329] [2024-11-10 07:38:23,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:38:23,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:38:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:38:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:38:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:38:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:38:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:38:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:38:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:38:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:38:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:38:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:38:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:38:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:38:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:38:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 07:38:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:38:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 07:38:23,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:38:23,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83285329] [2024-11-10 07:38:23,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83285329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:38:23,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:38:23,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:38:23,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398270751] [2024-11-10 07:38:23,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:38:23,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:38:23,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:38:23,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:38:23,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:38:23,402 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 07:38:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:38:23,420 INFO L93 Difference]: Finished difference Result 94 states and 154 transitions. [2024-11-10 07:38:23,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:38:23,422 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-11-10 07:38:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:38:23,427 INFO L225 Difference]: With dead ends: 94 [2024-11-10 07:38:23,428 INFO L226 Difference]: Without dead ends: 46 [2024-11-10 07:38:23,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-10 07:38:23,433 INFO L432 NwaCegarLoop]: 64 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, 64 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-10 07:38:23,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:38:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-10 07:38:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-10 07:38:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 07:38:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-11-10 07:38:23,502 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 98 [2024-11-10 07:38:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:38:23,503 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-11-10 07:38:23,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 07:38:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-11-10 07:38:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 07:38:23,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:38:23,531 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:38:23,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:38:23,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:38:23,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:38:23,536 INFO L85 PathProgramCache]: Analyzing trace with hash -109094285, now seen corresponding path program 1 times [2024-11-10 07:38:23,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:38:23,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264678431] [2024-11-10 07:38:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:38:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:38:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:38:23,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491603998] [2024-11-10 07:38:23,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:38:23,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:38:23,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:38:23,684 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-10 07:38:23,685 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-10 07:38:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:38:23,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:38:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:38:23,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:38:23,877 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:38:23,878 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:38:23,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 07:38:24,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:38:24,083 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 07:38:24,147 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:38:24,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:38:24 BoogieIcfgContainer [2024-11-10 07:38:24,154 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:38:24,155 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:38:24,155 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:38:24,155 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:38:24,155 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:38:23" (3/4) ... [2024-11-10 07:38:24,157 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:38:24,158 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:38:24,159 INFO L158 Benchmark]: Toolchain (without parser) took 1921.93ms. Allocated memory is still 190.8MB. Free memory was 161.8MB in the beginning and 129.2MB in the end (delta: 32.6MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-11-10 07:38:24,159 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 136.3MB. Free memory was 101.3MB in the beginning and 101.2MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:38:24,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.76ms. Allocated memory is still 190.8MB. Free memory was 161.6MB in the beginning and 151.2MB in the end (delta: 10.4MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-10 07:38:24,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.27ms. Allocated memory is still 190.8MB. Free memory was 151.2MB in the beginning and 147.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:38:24,160 INFO L158 Benchmark]: Boogie Preprocessor took 61.17ms. Allocated memory is still 190.8MB. Free memory was 147.8MB in the beginning and 144.5MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:38:24,160 INFO L158 Benchmark]: IcfgBuilder took 375.44ms. Allocated memory is still 190.8MB. Free memory was 144.5MB in the beginning and 127.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 07:38:24,161 INFO L158 Benchmark]: TraceAbstraction took 1135.03ms. Allocated memory is still 190.8MB. Free memory was 126.9MB in the beginning and 129.2MB in the end (delta: -2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:38:24,161 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 190.8MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:38:24,163 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.15ms. Allocated memory is still 136.3MB. Free memory was 101.3MB in the beginning and 101.2MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.76ms. Allocated memory is still 190.8MB. Free memory was 161.6MB in the beginning and 151.2MB in the end (delta: 10.4MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.27ms. Allocated memory is still 190.8MB. Free memory was 151.2MB in the beginning and 147.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.17ms. Allocated memory is still 190.8MB. Free memory was 147.8MB in the beginning and 144.5MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 375.44ms. Allocated memory is still 190.8MB. Free memory was 144.5MB in the beginning and 127.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1135.03ms. Allocated memory is still 190.8MB. Free memory was 126.9MB in the beginning and 129.2MB in the end (delta: -2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 190.8MB. Free memory is still 129.2MB. 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 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] unsigned short int var_1_4 = 4; [L24] unsigned short int var_1_7 = 10000; [L25] unsigned short int var_1_9 = 38382; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 100; [L29] double var_1_13 = 5.9; [L30] float var_1_15 = 9.375; [L31] double var_1_16 = 64.75; [L32] double var_1_17 = 99.5; [L33] float var_1_18 = 0.75; [L34] unsigned char last_1_var_1_10 = 0; [L35] double last_1_var_1_13 = 5.9; VAL [isInitial=0, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=4, var_1_7=10000, var_1_9=38382] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 [L87] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=4, var_1_7=10000, var_1_9=38382] [L97] RET updateLastVariables() [L98] CALL updateVariables() [L60] var_1_4 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_7=10000, var_1_9=38382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_7=10000, var_1_9=38382] [L61] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_7=10000, var_1_9=38382] [L62] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=10000, var_1_9=38382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=10000, var_1_9=38382] [L62] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=10000, var_1_9=38382] [L63] var_1_7 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=38382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=38382] [L64] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=38382] [L65] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=38382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=38382] [L65] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=38382] [L66] var_1_9 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_9 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L67] RET assume_abort_if_not(var_1_9 >= 32767) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L68] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L68] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L69] var_1_11 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L70] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L71] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L71] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L72] var_1_12 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L73] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L74] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L74] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L75] var_1_15 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L76] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L77] var_1_16 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L78] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L79] var_1_17 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L80] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L81] var_1_18 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L82] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L83] CALL assume_abort_if_not(var_1_18 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L83] RET assume_abort_if_not(var_1_18 != 0.0F) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=8, var_1_4=0, var_1_7=16383, var_1_9=32767] [L98] RET updateVariables() [L99] CALL step() [L39] COND TRUE last_1_var_1_10 <= last_1_var_1_10 [L40] var_1_1 = (last_1_var_1_10 + ((last_1_var_1_10 + last_1_var_1_10) + (var_1_7 - last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=16383, var_1_4=0, var_1_7=16383, var_1_9=32767] [L44] COND FALSE !(\read(var_1_11)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=16383, var_1_4=0, var_1_7=16383, var_1_9=32767] [L49] COND TRUE (last_1_var_1_13 + var_1_15) < 16.75f [L50] var_1_13 = ((((((((2.625) > (var_1_16)) ? (2.625) : (var_1_16)))) < (var_1_17)) ? (((((2.625) > (var_1_16)) ? (2.625) : (var_1_16)))) : (var_1_17))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=21/8, var_1_16=0, var_1_17=0, var_1_1=16383, var_1_4=0, var_1_7=16383, var_1_9=32767] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return (((last_1_var_1_10 <= last_1_var_1_10) ? (var_1_1 == ((unsigned short int) (last_1_var_1_10 + ((last_1_var_1_10 + last_1_var_1_10) + (var_1_7 - last_1_var_1_10))))) : (var_1_1 == ((unsigned short int) (var_1_9 - var_1_7)))) && (var_1_11 ? ((((var_1_4 % var_1_9) * var_1_1) >= var_1_7) ? (var_1_10 == ((unsigned char) var_1_12)) : 1) : 1)) && (((last_1_var_1_13 + var_1_15) < 16.75f) ? (var_1_13 == ((double) ((((((((2.625) > (var_1_16)) ? (2.625) : (var_1_16)))) < (var_1_17)) ? (((((2.625) > (var_1_16)) ? (2.625) : (var_1_16)))) : (var_1_17))))) : (((var_1_17 / var_1_18) <= 49.6) ? (var_1_13 == ((double) var_1_17)) : (var_1_13 == ((double) var_1_16)))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=21/8, var_1_16=0, var_1_17=0, var_1_1=16383, var_1_4=0, var_1_7=16383, var_1_9=32767] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=21/8, var_1_16=0, var_1_17=0, var_1_1=16383, var_1_4=0, var_1_7=16383, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=21/8, var_1_16=0, var_1_17=0, var_1_1=16383, var_1_4=0, var_1_7=16383, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 15, 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, 64 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, 64 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred 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.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 97 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 420/420 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-10 07:38:24,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-66.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 bf87e1196d75253bcac685a2c2730327c9154a0ef878663ed8ae9aa04b751e94 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:38:26,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:38:26,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:38:26,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:38:26,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:38:26,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:38:26,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:38:26,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:38:26,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:38:26,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:38:26,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:38:26,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:38:26,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:38:26,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:38:26,289 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:38:26,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:38:26,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:38:26,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:38:26,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:38:26,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:38:26,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:38:26,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:38:26,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:38:26,294 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:38:26,294 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:38:26,294 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:38:26,294 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:38:26,294 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:38:26,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:38:26,295 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:38:26,295 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:38:26,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:38:26,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:38:26,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:38:26,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:38:26,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:38:26,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:38:26,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:38:26,297 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:38:26,297 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:38:26,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:38:26,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:38:26,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:38:26,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:38:26,298 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 -> bf87e1196d75253bcac685a2c2730327c9154a0ef878663ed8ae9aa04b751e94 [2024-11-10 07:38:26,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:38:26,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:38:26,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:38:26,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:38:26,606 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:38:26,607 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-66.i [2024-11-10 07:38:28,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:38:28,200 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:38:28,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-66.i [2024-11-10 07:38:28,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d780d2e/55e31fa6fafe4e34aa2ffd2424d8244e/FLAG242d16327 [2024-11-10 07:38:28,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d780d2e/55e31fa6fafe4e34aa2ffd2424d8244e [2024-11-10 07:38:28,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:38:28,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:38:28,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:38:28,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:38:28,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:38:28,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@524e2e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28, skipping insertion in model container [2024-11-10 07:38:28,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:38:28,395 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-66.i[915,928] [2024-11-10 07:38:28,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:38:28,459 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:38:28,471 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-66.i[915,928] [2024-11-10 07:38:28,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:38:28,508 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:38:28,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28 WrapperNode [2024-11-10 07:38:28,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:38:28,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:38:28,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:38:28,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:38:28,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,548 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-10 07:38:28,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:38:28,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:38:28,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:38:28,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:38:28,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,587 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-10 07:38:28,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:38:28,607 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:38:28,607 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:38:28,608 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:38:28,612 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (1/1) ... [2024-11-10 07:38:28,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:38:28,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:38:28,648 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-10 07:38:28,654 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-10 07:38:28,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:38:28,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:38:28,694 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:38:28,695 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:38:28,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:38:28,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:38:28,774 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:38:28,776 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:38:42,211 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 07:38:42,212 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:38:42,222 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:38:42,222 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:38:42,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:38:42 BoogieIcfgContainer [2024-11-10 07:38:42,223 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:38:42,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:38:42,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:38:42,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:38:42,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:38:28" (1/3) ... [2024-11-10 07:38:42,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439df029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:38:42, skipping insertion in model container [2024-11-10 07:38:42,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:38:28" (2/3) ... [2024-11-10 07:38:42,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439df029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:38:42, skipping insertion in model container [2024-11-10 07:38:42,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:38:42" (3/3) ... [2024-11-10 07:38:42,230 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-66.i [2024-11-10 07:38:42,244 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:38:42,244 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:38:42,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:38:42,296 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;@792a54b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:38:42,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:38:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 07:38:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 07:38:42,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:38:42,308 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:38:42,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:38:42,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:38:42,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1949263632, now seen corresponding path program 1 times [2024-11-10 07:38:42,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:38:42,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194531300] [2024-11-10 07:38:42,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:38:42,324 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-10 07:38:42,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:38:42,338 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-10 07:38:42,339 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-10 07:38:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:43,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:38:43,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:38:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-10 07:38:43,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:38:43,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:38:43,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194531300] [2024-11-10 07:38:43,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194531300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:38:43,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:38:43,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:38:43,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559070806] [2024-11-10 07:38:43,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:38:43,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:38:43,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:38:43,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:38:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:38:43,195 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 07:38:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:38:43,217 INFO L93 Difference]: Finished difference Result 94 states and 154 transitions. [2024-11-10 07:38:43,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:38:43,219 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-11-10 07:38:43,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:38:43,224 INFO L225 Difference]: With dead ends: 94 [2024-11-10 07:38:43,225 INFO L226 Difference]: Without dead ends: 46 [2024-11-10 07:38:43,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-10 07:38:43,230 INFO L432 NwaCegarLoop]: 64 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, 64 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-10 07:38:43,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:38:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-10 07:38:43,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-10 07:38:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 07:38:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-11-10 07:38:43,263 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 98 [2024-11-10 07:38:43,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:38:43,264 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-11-10 07:38:43,264 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 07:38:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-11-10 07:38:43,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 07:38:43,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:38:43,267 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:38:43,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 07:38:43,471 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-10 07:38:43,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:38:43,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:38:43,473 INFO L85 PathProgramCache]: Analyzing trace with hash -109094285, now seen corresponding path program 1 times [2024-11-10 07:38:43,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:38:43,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121408667] [2024-11-10 07:38:43,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:38:43,474 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-10 07:38:43,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:38:43,476 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-10 07:38:43,477 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-10 07:38:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:38:44,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 07:38:44,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:39:38,352 WARN L286 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)