./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.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 a8b70edc51f7e2052ea5af42ef22b470e7ca8ff27d9c5bbc8f8b46c1568f3646 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:34:37,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:34:37,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:34:37,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:34:37,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:34:37,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:34:37,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:34:37,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:34:37,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:34:37,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:34:37,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:34:37,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:34:37,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:34:37,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:34:37,319 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:34:37,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:34:37,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:34:37,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:34:37,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:34:37,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:34:37,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:34:37,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:34:37,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:34:37,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:34:37,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:34:37,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:34:37,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:34:37,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:34:37,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:34:37,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:34:37,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:34:37,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:34:37,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:34:37,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:34:37,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:34:37,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:34:37,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:34:37,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:34:37,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:34:37,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:34:37,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:34:37,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:34:37,332 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 -> a8b70edc51f7e2052ea5af42ef22b470e7ca8ff27d9c5bbc8f8b46c1568f3646 [2024-10-13 04:34:37,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:34:37,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:34:37,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:34:37,579 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:34:37,580 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:34:37,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i [2024-10-13 04:34:38,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:34:39,042 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:34:39,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i [2024-10-13 04:34:39,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bfa2668a/ba5e7f2a77d24f9cbdc2a64b1ae2db1a/FLAG699148a83 [2024-10-13 04:34:39,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bfa2668a/ba5e7f2a77d24f9cbdc2a64b1ae2db1a [2024-10-13 04:34:39,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:34:39,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:34:39,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:34:39,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:34:39,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:34:39,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:34:39" (1/1) ... [2024-10-13 04:34:39,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226a47eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39, skipping insertion in model container [2024-10-13 04:34:39,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:34:39" (1/1) ... [2024-10-13 04:34:39,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:34:39,604 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i[915,928] [2024-10-13 04:34:39,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:34:39,648 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:34:39,657 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i[915,928] [2024-10-13 04:34:39,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:34:39,708 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:34:39,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39 WrapperNode [2024-10-13 04:34:39,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:34:39,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:34:39,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:34:39,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:34:39,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39" (1/1) ... [2024-10-13 04:34:39,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39" (1/1) ... [2024-10-13 04:34:39,779 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-10-13 04:34:39,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:34:39,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:34:39,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:34:39,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:34:39,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39" (1/1) ... [2024-10-13 04:34:39,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39" (1/1) ... [2024-10-13 04:34:39,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39" (1/1) ... [2024-10-13 04:34:39,860 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:34:39,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39" (1/1) ... [2024-10-13 04:34:39,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39" (1/1) ... [2024-10-13 04:34:39,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39" (1/1) ... [2024-10-13 04:34:39,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39" (1/1) ... [2024-10-13 04:34:39,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39" (1/1) ... [2024-10-13 04:34:39,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39" (1/1) ... [2024-10-13 04:34:39,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:34:39,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:34:39,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:34:39,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:34:39,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39" (1/1) ... [2024-10-13 04:34:39,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:34:39,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:34:39,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:34:39,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:34:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:34:39,992 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:34:39,993 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:34:39,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:34:39,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:34:39,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:34:40,066 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:34:40,068 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:34:40,340 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 04:34:40,341 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:34:40,371 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:34:40,372 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:34:40,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:34:40 BoogieIcfgContainer [2024-10-13 04:34:40,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:34:40,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:34:40,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:34:40,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:34:40,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:34:39" (1/3) ... [2024-10-13 04:34:40,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d4c419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:34:40, skipping insertion in model container [2024-10-13 04:34:40,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:39" (2/3) ... [2024-10-13 04:34:40,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d4c419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:34:40, skipping insertion in model container [2024-10-13 04:34:40,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:34:40" (3/3) ... [2024-10-13 04:34:40,382 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-82.i [2024-10-13 04:34:40,407 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:34:40,407 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:34:40,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:34:40,477 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;@27700f2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:34:40,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:34:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:34:40,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 04:34:40,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:34:40,492 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:34:40,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:34:40,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:34:40,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1204624591, now seen corresponding path program 1 times [2024-10-13 04:34:40,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:34:40,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595314887] [2024-10-13 04:34:40,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:34:40,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:34:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:34:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:34:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 04:34:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 04:34:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 04:34:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 04:34:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 04:34:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 04:34:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 04:34:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:34:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 04:34:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:34:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 04:34:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:34:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 04:34:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:34:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 04:34:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:34:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 04:34:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:34:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:34:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 04:34:40,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:34:40,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595314887] [2024-10-13 04:34:40,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595314887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:34:40,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:34:40,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:34:40,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971488845] [2024-10-13 04:34:40,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:34:40,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:34:40,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:34:40,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:34:40,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:34:40,916 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 04:34:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:34:40,953 INFO L93 Difference]: Finished difference Result 111 states and 191 transitions. [2024-10-13 04:34:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:34:40,957 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2024-10-13 04:34:40,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:34:40,963 INFO L225 Difference]: With dead ends: 111 [2024-10-13 04:34:40,963 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 04:34:40,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:34:40,972 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:34:40,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:34:40,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 04:34:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 04:34:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:34:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2024-10-13 04:34:41,029 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 81 transitions. Word has length 124 [2024-10-13 04:34:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:34:41,029 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 81 transitions. [2024-10-13 04:34:41,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 04:34:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 81 transitions. [2024-10-13 04:34:41,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 04:34:41,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:34:41,033 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:34:41,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:34:41,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:34:41,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:34:41,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1279934761, now seen corresponding path program 1 times [2024-10-13 04:34:41,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:34:41,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666991025] [2024-10-13 04:34:41,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:34:41,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:34:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:34:41,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:34:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:34:41,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:34:41,368 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:34:41,369 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:34:41,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:34:41,374 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 04:34:41,446 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:34:41,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:34:41 BoogieIcfgContainer [2024-10-13 04:34:41,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:34:41,450 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:34:41,450 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:34:41,450 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:34:41,451 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:34:40" (3/4) ... [2024-10-13 04:34:41,452 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:34:41,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:34:41,454 INFO L158 Benchmark]: Toolchain (without parser) took 2015.09ms. Allocated memory was 176.2MB in the beginning and 251.7MB in the end (delta: 75.5MB). Free memory was 103.7MB in the beginning and 177.8MB in the end (delta: -74.0MB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. [2024-10-13 04:34:41,454 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 176.2MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:34:41,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.78ms. Allocated memory is still 176.2MB. Free memory was 103.6MB in the beginning and 88.7MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 04:34:41,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.79ms. Allocated memory is still 176.2MB. Free memory was 88.7MB in the beginning and 142.9MB in the end (delta: -54.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 04:34:41,455 INFO L158 Benchmark]: Boogie Preprocessor took 118.26ms. Allocated memory is still 176.2MB. Free memory was 142.8MB in the beginning and 142.9MB in the end (delta: -39.4kB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-10-13 04:34:41,456 INFO L158 Benchmark]: RCFGBuilder took 458.12ms. Allocated memory is still 176.2MB. Free memory was 142.9MB in the beginning and 121.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 04:34:41,460 INFO L158 Benchmark]: TraceAbstraction took 1075.64ms. Allocated memory was 176.2MB in the beginning and 251.7MB in the end (delta: 75.5MB). Free memory was 120.8MB in the beginning and 178.8MB in the end (delta: -58.0MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-10-13 04:34:41,462 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 251.7MB. Free memory is still 177.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:34:41,464 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.40ms. Allocated memory is still 176.2MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.78ms. Allocated memory is still 176.2MB. Free memory was 103.6MB in the beginning and 88.7MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.79ms. Allocated memory is still 176.2MB. Free memory was 88.7MB in the beginning and 142.9MB in the end (delta: -54.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.26ms. Allocated memory is still 176.2MB. Free memory was 142.8MB in the beginning and 142.9MB in the end (delta: -39.4kB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * RCFGBuilder took 458.12ms. Allocated memory is still 176.2MB. Free memory was 142.9MB in the beginning and 121.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1075.64ms. Allocated memory was 176.2MB in the beginning and 251.7MB in the end (delta: 75.5MB). Free memory was 120.8MB in the beginning and 178.8MB in the end (delta: -58.0MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 251.7MB. Free memory is still 177.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryArithmeticDOUBLEoperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10.8; [L23] double var_1_4 = 5.5; [L24] float var_1_5 = 49.2; [L25] double var_1_7 = 49.5; [L26] double var_1_8 = 999999999999.4; [L27] double var_1_9 = 255.3; [L28] unsigned char var_1_10 = 1; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_13 = 1; [L31] signed long int var_1_14 = -16; [L32] signed long int var_1_15 = 25; [L33] signed long int var_1_16 = -8; [L34] signed long int var_1_17 = 1000000000; [L35] signed long int var_1_18 = 256; [L36] signed long int var_1_19 = 25; [L37] signed long int var_1_20 = 4; [L38] unsigned char var_1_21 = 1; [L39] unsigned char var_1_22 = 0; [L40] signed long int var_1_23 = 50; [L41] double last_1_var_1_7 = 49.5; [L42] signed long int last_1_var_1_14 = -16; [L43] signed long int last_1_var_1_23 = 50; [L131] isInitial = 1 [L132] FCALL initially() [L133] int k_loop; [L134] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_4=11/2, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L134] COND TRUE k_loop < 1 [L135] CALL updateLastVariables() [L122] last_1_var_1_7 = var_1_7 [L123] last_1_var_1_14 = var_1_14 [L124] last_1_var_1_23 = var_1_23 [L135] RET updateLastVariables() [L136] CALL updateVariables() [L88] var_1_4 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L89] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_5=246/5, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L90] var_1_5 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L91] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_8=4999999999997/5, var_1_9=2553/10] [L92] var_1_8 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_9=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_9=2553/10] [L93] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2, var_1_9=2553/10] [L94] var_1_9 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L95] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=0, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L96] var_1_11 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L97] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L98] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L98] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L99] var_1_13 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L100] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L101] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L101] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=25, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L102] var_1_15 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_15 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L103] RET assume_abort_if_not(var_1_15 >= -1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L104] CALL assume_abort_if_not(var_1_15 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L104] RET assume_abort_if_not(var_1_15 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=1000000000, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L105] var_1_17 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_17 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L106] RET assume_abort_if_not(var_1_17 >= 536870911) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L107] CALL assume_abort_if_not(var_1_17 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L107] RET assume_abort_if_not(var_1_17 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=256, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L108] var_1_18 = __VERIFIER_nondet_long() [L109] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L109] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L110] CALL assume_abort_if_not(var_1_18 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L110] RET assume_abort_if_not(var_1_18 <= 536870911) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=25, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L111] var_1_19 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L112] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L113] CALL assume_abort_if_not(var_1_19 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L113] RET assume_abort_if_not(var_1_19 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=4, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L114] var_1_20 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L115] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L116] CALL assume_abort_if_not(var_1_20 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L116] RET assume_abort_if_not(var_1_20 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=0, var_1_23=50, var_1_7=99/2] [L117] var_1_22 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L118] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L119] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L119] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=1, var_1_23=50, var_1_7=99/2] [L136] RET updateVariables() [L137] CALL step() [L47] var_1_23 = last_1_var_1_14 [L48] var_1_7 = (var_1_4 - (var_1_8 + var_1_9)) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-8, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=1, var_1_23=-16] [L49] COND TRUE var_1_8 <= (((((var_1_5 * 1.25)) > ((last_1_var_1_7 * var_1_9))) ? ((var_1_5 * 1.25)) : ((last_1_var_1_7 * var_1_9)))) [L50] var_1_16 = ((((((last_1_var_1_23) < 0 ) ? -(last_1_var_1_23) : (last_1_var_1_23))) + last_1_var_1_23) + ((var_1_17 - var_1_18) - ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))))) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=1, var_1_23=-16] [L56] signed long int stepLocal_0 = var_1_23; VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, stepLocal_0=-16, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_1=54/5, var_1_20=115, var_1_21=1, var_1_22=1, var_1_23=-16] [L57] COND TRUE stepLocal_0 == var_1_16 [L58] var_1_1 = (var_1_4 - 4.531) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_20=115, var_1_21=1, var_1_22=1, var_1_23=-16] [L66] signed long int stepLocal_1 = (50 / -10) + var_1_23; VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, stepLocal_1=-21, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_20=115, var_1_21=1, var_1_22=1, var_1_23=-16] [L67] COND FALSE !(stepLocal_1 >= var_1_16) [L74] var_1_21 = var_1_11 VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_20=115, var_1_21=-255, var_1_22=1, var_1_23=-16] [L76] var_1_10 = (var_1_11 && (var_1_21 || var_1_13)) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_20=115, var_1_21=-255, var_1_22=1, var_1_23=-16] [L77] COND FALSE !(var_1_8 <= ((((var_1_4) > ((var_1_1 + var_1_5))) ? (var_1_4) : ((var_1_1 + var_1_5))))) [L84] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_20=115, var_1_21=-255, var_1_22=1, var_1_23=-16] [L137] RET step() [L138] CALL, EXPR property() [L127-L128] return (((((((var_1_23 == var_1_16) ? (var_1_1 == ((double) (var_1_4 - 4.531))) : (((var_1_4 - var_1_5) > var_1_7) ? (var_1_1 == ((double) var_1_4)) : (var_1_1 == ((double) var_1_4)))) && (var_1_7 == ((double) (var_1_4 - (var_1_8 + var_1_9))))) && (var_1_10 == ((unsigned char) (var_1_11 && (var_1_21 || var_1_13))))) && ((var_1_8 <= ((((var_1_4) > ((var_1_1 + var_1_5))) ? (var_1_4) : ((var_1_1 + var_1_5))))) ? (var_1_10 ? (var_1_14 == ((signed long int) (var_1_15 + (8 + var_1_16)))) : (var_1_14 == ((signed long int) -256))) : (var_1_14 == ((signed long int) var_1_16)))) && ((var_1_8 <= (((((var_1_5 * 1.25)) > ((last_1_var_1_7 * var_1_9))) ? ((var_1_5 * 1.25)) : ((last_1_var_1_7 * var_1_9))))) ? (var_1_16 == ((signed long int) ((((((last_1_var_1_23) < 0 ) ? -(last_1_var_1_23) : (last_1_var_1_23))) + last_1_var_1_23) + ((var_1_17 - var_1_18) - ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))))))) : ((var_1_4 <= last_1_var_1_7) ? (var_1_16 == ((signed long int) var_1_17)) : 1))) && ((((50 / -10) + var_1_23) >= var_1_16) ? (var_1_13 ? (var_1_21 == ((unsigned char) (var_1_11 && var_1_22))) : (var_1_21 == ((unsigned char) var_1_11))) : (var_1_21 == ((unsigned char) var_1_11)))) && (var_1_23 == ((signed long int) last_1_var_1_14)) ; [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_20=115, var_1_21=-255, var_1_22=1, var_1_23=-16] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-16, last_1_var_1_23=50, last_1_var_1_7=99/2, var_1_10=1, var_1_11=-255, var_1_13=1, var_1_14=-16, var_1_15=1073741823, var_1_16=-16, var_1_17=536870911, var_1_18=536870911, var_1_19=116, var_1_20=115, var_1_21=-255, var_1_22=1, var_1_23=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 20, 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, 78 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 78 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 123 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 760/760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 04:34:41,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.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 a8b70edc51f7e2052ea5af42ef22b470e7ca8ff27d9c5bbc8f8b46c1568f3646 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:34:43,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:34:43,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:34:43,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:34:43,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:34:43,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:34:43,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:34:43,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:34:43,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:34:43,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:34:43,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:34:43,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:34:43,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:34:43,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:34:43,545 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:34:43,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:34:43,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:34:43,546 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:34:43,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:34:43,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:34:43,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:34:43,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:34:43,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:34:43,553 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:34:43,553 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:34:43,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:34:43,553 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:34:43,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:34:43,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:34:43,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:34:43,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:34:43,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:34:43,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:34:43,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:34:43,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:34:43,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:34:43,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:34:43,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:34:43,557 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:34:43,557 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:34:43,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:34:43,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:34:43,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:34:43,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:34:43,558 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:34:43,559 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 -> a8b70edc51f7e2052ea5af42ef22b470e7ca8ff27d9c5bbc8f8b46c1568f3646 [2024-10-13 04:34:43,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:34:43,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:34:43,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:34:43,875 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:34:43,875 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:34:43,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i [2024-10-13 04:34:45,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:34:45,624 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:34:45,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i [2024-10-13 04:34:45,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/808d5a192/1d36a71bc53c4ad9af6f7e57834fc35b/FLAG0f37dfc12 [2024-10-13 04:34:45,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/808d5a192/1d36a71bc53c4ad9af6f7e57834fc35b [2024-10-13 04:34:45,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:34:45,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:34:45,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:34:45,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:34:45,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:34:45,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:34:45" (1/1) ... [2024-10-13 04:34:45,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4382e59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:45, skipping insertion in model container [2024-10-13 04:34:45,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:34:45" (1/1) ... [2024-10-13 04:34:45,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:34:45,880 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i[915,928] [2024-10-13 04:34:45,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:34:46,024 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:34:46,047 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-82.i[915,928] [2024-10-13 04:34:46,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:34:46,109 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:34:46,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:46 WrapperNode [2024-10-13 04:34:46,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:34:46,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:34:46,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:34:46,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:34:46,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:46" (1/1) ... [2024-10-13 04:34:46,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:46" (1/1) ... [2024-10-13 04:34:46,156 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-10-13 04:34:46,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:34:46,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:34:46,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:34:46,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:34:46,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:46" (1/1) ... [2024-10-13 04:34:46,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:46" (1/1) ... [2024-10-13 04:34:46,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:46" (1/1) ... [2024-10-13 04:34:46,183 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:34:46,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:46" (1/1) ... [2024-10-13 04:34:46,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:46" (1/1) ... [2024-10-13 04:34:46,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:46" (1/1) ... [2024-10-13 04:34:46,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:46" (1/1) ... [2024-10-13 04:34:46,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:46" (1/1) ... [2024-10-13 04:34:46,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:46" (1/1) ... [2024-10-13 04:34:46,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:34:46,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:34:46,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:34:46,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:34:46,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:46" (1/1) ... [2024-10-13 04:34:46,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:34:46,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:34:46,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:34:46,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:34:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:34:46,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:34:46,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:34:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:34:46,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:34:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:34:46,356 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:34:46,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:35:02,285 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 04:35:02,286 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:35:02,332 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:35:02,333 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:35:02,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:35:02 BoogieIcfgContainer [2024-10-13 04:35:02,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:35:02,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:35:02,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:35:02,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:35:02,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:34:45" (1/3) ... [2024-10-13 04:35:02,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb2ccb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:35:02, skipping insertion in model container [2024-10-13 04:35:02,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:34:46" (2/3) ... [2024-10-13 04:35:02,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb2ccb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:35:02, skipping insertion in model container [2024-10-13 04:35:02,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:35:02" (3/3) ... [2024-10-13 04:35:02,341 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-82.i [2024-10-13 04:35:02,354 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:35:02,354 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:35:02,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:35:02,416 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;@3fbf0b75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:35:02,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:35:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:35:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 04:35:02,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:35:02,430 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:35:02,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:35:02,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:35:02,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1204624591, now seen corresponding path program 1 times [2024-10-13 04:35:02,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:35:02,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97965832] [2024-10-13 04:35:02,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:35:02,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:35:02,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:35:02,450 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:35:02,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 04:35:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:03,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:35:03,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:35:03,138 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-10-13 04:35:03,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:35:03,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:35:03,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97965832] [2024-10-13 04:35:03,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97965832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:35:03,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:35:03,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:35:03,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245703460] [2024-10-13 04:35:03,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:35:03,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:35:03,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:35:03,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:35:03,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:35:03,190 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 04:35:07,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:35:07,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:35:07,504 INFO L93 Difference]: Finished difference Result 111 states and 191 transitions. [2024-10-13 04:35:07,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:35:07,508 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2024-10-13 04:35:07,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:35:07,514 INFO L225 Difference]: With dead ends: 111 [2024-10-13 04:35:07,514 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 04:35:07,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:35:07,520 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:35:07,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-13 04:35:07,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 04:35:07,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 04:35:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 04:35:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2024-10-13 04:35:07,556 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 81 transitions. Word has length 124 [2024-10-13 04:35:07,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:35:07,557 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 81 transitions. [2024-10-13 04:35:07,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 04:35:07,557 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 81 transitions. [2024-10-13 04:35:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 04:35:07,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:35:07,559 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:35:07,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 04:35:07,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:35:07,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:35:07,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:35:07,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1279934761, now seen corresponding path program 1 times [2024-10-13 04:35:07,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:35:07,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862123744] [2024-10-13 04:35:07,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:35:07,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:35:07,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:35:07,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:35:07,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 04:35:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:35:09,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 04:35:09,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:36:24,175 WARN L286 SmtUtils]: Spent 20.35s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)