./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.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 5b933671a1fface527dbef89f2ee599c80d54d1c8c988a3b741df55fc4b83921 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:37:43,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:37:43,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:37:43,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:37:43,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:37:43,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:37:43,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:37:43,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:37:43,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:37:43,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:37:43,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:37:43,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:37:43,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:37:43,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:37:43,971 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:37:43,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:37:43,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:37:43,972 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:37:43,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:37:43,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:37:43,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:37:43,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:37:43,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:37:43,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:37:43,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:37:43,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:37:43,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:37:43,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:37:43,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:37:43,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:37:43,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:37:43,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:37:43,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:37:43,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:37:43,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:37:43,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:37:43,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:37:43,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:37:43,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:37:43,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:37:43,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:37:43,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:37:43,980 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 -> 5b933671a1fface527dbef89f2ee599c80d54d1c8c988a3b741df55fc4b83921 [2024-11-12 05:37:44,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:37:44,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:37:44,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:37:44,237 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:37:44,238 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:37:44,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i [2024-11-12 05:37:45,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:37:45,762 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:37:45,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i [2024-11-12 05:37:45,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4c1cc12/2a50fea279fa4e449614067c8f58c890/FLAGf6266a2a8 [2024-11-12 05:37:46,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4c1cc12/2a50fea279fa4e449614067c8f58c890 [2024-11-12 05:37:46,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:37:46,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:37:46,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:37:46,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:37:46,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:37:46,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:37:46" (1/1) ... [2024-11-12 05:37:46,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2fc8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46, skipping insertion in model container [2024-11-12 05:37:46,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:37:46" (1/1) ... [2024-11-12 05:37:46,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:37:46,279 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i[915,928] [2024-11-12 05:37:46,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:37:46,320 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:37:46,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i[915,928] [2024-11-12 05:37:46,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:37:46,358 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:37:46,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46 WrapperNode [2024-11-12 05:37:46,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:37:46,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:37:46,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:37:46,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:37:46,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46" (1/1) ... [2024-11-12 05:37:46,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46" (1/1) ... [2024-11-12 05:37:46,386 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-11-12 05:37:46,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:37:46,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:37:46,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:37:46,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:37:46,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46" (1/1) ... [2024-11-12 05:37:46,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46" (1/1) ... [2024-11-12 05:37:46,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46" (1/1) ... [2024-11-12 05:37:46,408 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:37:46,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46" (1/1) ... [2024-11-12 05:37:46,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46" (1/1) ... [2024-11-12 05:37:46,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46" (1/1) ... [2024-11-12 05:37:46,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46" (1/1) ... [2024-11-12 05:37:46,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46" (1/1) ... [2024-11-12 05:37:46,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46" (1/1) ... [2024-11-12 05:37:46,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:37:46,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:37:46,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:37:46,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:37:46,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46" (1/1) ... [2024-11-12 05:37:46,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:37:46,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:37:46,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:37:46,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:37:46,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:37:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:37:46,494 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:37:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:37:46,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:37:46,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:37:46,558 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:37:46,560 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:37:46,745 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 05:37:46,746 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:37:46,759 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:37:46,760 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:37:46,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:37:46 BoogieIcfgContainer [2024-11-12 05:37:46,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:37:46,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:37:46,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:37:46,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:37:46,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:37:46" (1/3) ... [2024-11-12 05:37:46,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7268bb46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:37:46, skipping insertion in model container [2024-11-12 05:37:46,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:46" (2/3) ... [2024-11-12 05:37:46,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7268bb46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:37:46, skipping insertion in model container [2024-11-12 05:37:46,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:37:46" (3/3) ... [2024-11-12 05:37:46,769 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-99.i [2024-11-12 05:37:46,784 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:37:46,785 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:37:46,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:37:46,852 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;@1ba4358a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:37:46,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:37:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:37:46,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 05:37:46,863 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:37:46,863 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:37:46,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:37:46,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:37:46,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1627403740, now seen corresponding path program 1 times [2024-11-12 05:37:46,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:37:46,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762921294] [2024-11-12 05:37:46,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:37:46,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:37:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:47,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:37:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:47,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:37:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:47,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:37:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:47,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 05:37:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:47,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 05:37:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:47,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 05:37:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:47,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 05:37:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:47,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-12 05:37:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:47,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-12 05:37:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:37:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 05:37:47,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:37:47,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762921294] [2024-11-12 05:37:47,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762921294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:37:47,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:37:47,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:37:47,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854200470] [2024-11-12 05:37:47,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:37:47,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:37:47,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:37:47,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:37:47,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:37:47,171 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 05:37:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:37:47,187 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2024-11-12 05:37:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:37:47,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2024-11-12 05:37:47,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:37:47,194 INFO L225 Difference]: With dead ends: 73 [2024-11-12 05:37:47,195 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 05:37:47,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:37:47,200 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:37:47,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:37:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 05:37:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 05:37:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:37:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-12 05:37:47,231 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 65 [2024-11-12 05:37:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:37:47,232 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-12 05:37:47,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 05:37:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-12 05:37:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 05:37:47,234 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:37:47,234 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:37:47,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:37:47,235 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:37:47,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:37:47,236 INFO L85 PathProgramCache]: Analyzing trace with hash -17831066, now seen corresponding path program 1 times [2024-11-12 05:37:47,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:37:47,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273613887] [2024-11-12 05:37:47,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:37:47,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:37:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:37:47,336 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:37:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:37:47,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:37:47,412 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:37:47,414 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:37:47,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:37:47,419 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 05:37:47,465 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:37:47,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:37:47 BoogieIcfgContainer [2024-11-12 05:37:47,471 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:37:47,472 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:37:47,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:37:47,473 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:37:47,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:37:46" (3/4) ... [2024-11-12 05:37:47,476 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:37:47,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:37:47,478 INFO L158 Benchmark]: Toolchain (without parser) took 1361.35ms. Allocated memory is still 192.9MB. Free memory was 158.1MB in the beginning and 82.5MB in the end (delta: 75.7MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-11-12 05:37:47,479 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 192.9MB. Free memory is still 161.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:37:47,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.27ms. Allocated memory is still 192.9MB. Free memory was 158.1MB in the beginning and 143.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 05:37:47,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.44ms. Allocated memory is still 192.9MB. Free memory was 143.3MB in the beginning and 141.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:37:47,481 INFO L158 Benchmark]: Boogie Preprocessor took 32.69ms. Allocated memory is still 192.9MB. Free memory was 141.2MB in the beginning and 139.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:37:47,481 INFO L158 Benchmark]: RCFGBuilder took 340.03ms. Allocated memory is still 192.9MB. Free memory was 139.1MB in the beginning and 125.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 05:37:47,482 INFO L158 Benchmark]: TraceAbstraction took 709.31ms. Allocated memory is still 192.9MB. Free memory was 124.4MB in the beginning and 83.1MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-12 05:37:47,482 INFO L158 Benchmark]: Witness Printer took 5.63ms. Allocated memory is still 192.9MB. Free memory was 83.1MB in the beginning and 82.5MB in the end (delta: 690.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:37:47,484 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.17ms. Allocated memory is still 192.9MB. Free memory is still 161.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.27ms. Allocated memory is still 192.9MB. Free memory was 158.1MB in the beginning and 143.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.44ms. Allocated memory is still 192.9MB. Free memory was 143.3MB in the beginning and 141.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.69ms. Allocated memory is still 192.9MB. Free memory was 141.2MB in the beginning and 139.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 340.03ms. Allocated memory is still 192.9MB. Free memory was 139.1MB in the beginning and 125.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 709.31ms. Allocated memory is still 192.9MB. Free memory was 124.4MB in the beginning and 83.1MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 5.63ms. Allocated memory is still 192.9MB. Free memory was 83.1MB in the beginning and 82.5MB in the end (delta: 690.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someUnaryDOUBLEoperation at line 43, overapproximation of someBinaryArithmeticDOUBLEoperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 255.5; [L23] unsigned char var_1_2 = 16; [L24] float var_1_4 = 1000000000000000.6; [L25] float var_1_5 = 500.5; [L26] float var_1_6 = 99999999999.5; [L27] double var_1_7 = 9.6; [L28] double var_1_8 = -0.2; [L29] double var_1_9 = 25.2; [L30] signed short int var_1_10 = 1; [L31] unsigned char var_1_11 = 0; [L32] signed long int var_1_15 = -64; VAL [isInitial=0, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=16, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L79] isInitial = 1 [L80] FCALL initially() [L81] COND TRUE 1 [L82] FCALL updateLastVariables() [L83] CALL updateVariables() [L55] var_1_2 = __VERIFIER_nondet_uchar() [L56] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L56] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L57] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L57] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L58] var_1_4 = __VERIFIER_nondet_float() [L59] 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, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L59] 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, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L60] var_1_5 = __VERIFIER_nondet_float() [L61] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L61] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_6=199999999999/2, var_1_7=48/5, var_1_9=126/5] [L62] var_1_6 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L63] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L64] var_1_8 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L65] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5, var_1_9=126/5] [L66] var_1_9 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L67] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L68] var_1_11 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L69] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L70] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L70] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L83] RET updateVariables() [L84] CALL step() [L36] signed long int stepLocal_0 = (((8) < 0 ) ? -(8) : (8)); VAL [isInitial=1, stepLocal_0=8, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_1=511/2, var_1_2=119, var_1_7=48/5] [L37] COND TRUE (((((200) < (128)) ? (200) : (128))) - var_1_2) > stepLocal_0 [L38] var_1_1 = (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) - var_1_6) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=48/5] [L42] COND TRUE var_1_5 >= (var_1_4 + var_1_6) [L43] var_1_7 = ((((var_1_8 + var_1_9) < 0 ) ? -(var_1_8 + var_1_9) : (var_1_8 + var_1_9))) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L45] COND FALSE !(((var_1_6 - var_1_4) + var_1_7) >= var_1_5) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L50] COND TRUE ((var_1_2 + var_1_15) + var_1_15) >= var_1_15 [L51] var_1_10 = var_1_2 VAL [isInitial=1, var_1_10=119, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L84] RET step() [L85] CALL, EXPR property() [L75-L76] return (((((((((200) < (128)) ? (200) : (128))) - var_1_2) > ((((8) < 0 ) ? -(8) : (8)))) ? (var_1_1 == ((float) (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) - var_1_6))) : (var_1_1 == ((float) var_1_6))) && ((var_1_5 >= (var_1_4 + var_1_6)) ? (var_1_7 == ((double) ((((var_1_8 + var_1_9) < 0 ) ? -(var_1_8 + var_1_9) : (var_1_8 + var_1_9))))) : 1)) && ((((var_1_2 + var_1_15) + var_1_15) >= var_1_15) ? (var_1_10 == ((signed short int) var_1_2)) : 1)) && ((((var_1_6 - var_1_4) + var_1_7) >= var_1_5) ? (var_1_11 ? (var_1_15 == ((signed long int) 100)) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_10=119, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L85] RET, EXPR property() [L85] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=119, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] [L19] reach_error() VAL [isInitial=1, var_1_10=119, var_1_11=1, var_1_15=-64, var_1_2=119, var_1_7=1000000000000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 49 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 144/144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:37:47,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.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 5b933671a1fface527dbef89f2ee599c80d54d1c8c988a3b741df55fc4b83921 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:37:49,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:37:49,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:37:49,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:37:49,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:37:49,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:37:49,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:37:49,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:37:49,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:37:49,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:37:49,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:37:49,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:37:49,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:37:49,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:37:49,551 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:37:49,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:37:49,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:37:49,551 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:37:49,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:37:49,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:37:49,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:37:49,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:37:49,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:37:49,553 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:37:49,554 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:37:49,554 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:37:49,554 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:37:49,554 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:37:49,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:37:49,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:37:49,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:37:49,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:37:49,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:37:49,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:37:49,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:37:49,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:37:49,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:37:49,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:37:49,556 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:37:49,556 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:37:49,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:37:49,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:37:49,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:37:49,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:37:49,558 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 -> 5b933671a1fface527dbef89f2ee599c80d54d1c8c988a3b741df55fc4b83921 [2024-11-12 05:37:49,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:37:49,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:37:49,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:37:49,886 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:37:49,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:37:49,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i [2024-11-12 05:37:51,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:37:51,458 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:37:51,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i [2024-11-12 05:37:51,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c365dab8/a967f2b76f4343b595da1d8688de050b/FLAG85bc7e823 [2024-11-12 05:37:51,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c365dab8/a967f2b76f4343b595da1d8688de050b [2024-11-12 05:37:51,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:37:51,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:37:51,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:37:51,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:37:51,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:37:51,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:37:51" (1/1) ... [2024-11-12 05:37:51,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740a8e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51, skipping insertion in model container [2024-11-12 05:37:51,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:37:51" (1/1) ... [2024-11-12 05:37:51,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:37:51,676 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i[915,928] [2024-11-12 05:37:51,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:37:51,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:37:51,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-99.i[915,928] [2024-11-12 05:37:51,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:37:51,789 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:37:51,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51 WrapperNode [2024-11-12 05:37:51,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:37:51,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:37:51,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:37:51,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:37:51,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51" (1/1) ... [2024-11-12 05:37:51,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51" (1/1) ... [2024-11-12 05:37:51,840 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-11-12 05:37:51,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:37:51,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:37:51,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:37:51,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:37:51,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51" (1/1) ... [2024-11-12 05:37:51,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51" (1/1) ... [2024-11-12 05:37:51,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51" (1/1) ... [2024-11-12 05:37:51,865 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:37:51,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51" (1/1) ... [2024-11-12 05:37:51,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51" (1/1) ... [2024-11-12 05:37:51,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51" (1/1) ... [2024-11-12 05:37:51,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51" (1/1) ... [2024-11-12 05:37:51,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51" (1/1) ... [2024-11-12 05:37:51,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51" (1/1) ... [2024-11-12 05:37:51,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:37:51,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:37:51,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:37:51,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:37:51,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51" (1/1) ... [2024-11-12 05:37:51,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:37:51,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:37:51,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:37:51,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:37:51,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:37:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:37:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:37:51,969 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:37:51,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:37:51,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:37:52,035 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:37:52,037 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:38:00,145 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 05:38:00,147 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:38:00,157 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:38:00,157 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:38:00,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:38:00 BoogieIcfgContainer [2024-11-12 05:38:00,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:38:00,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:38:00,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:38:00,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:38:00,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:37:51" (1/3) ... [2024-11-12 05:38:00,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de51120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:38:00, skipping insertion in model container [2024-11-12 05:38:00,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:37:51" (2/3) ... [2024-11-12 05:38:00,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de51120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:38:00, skipping insertion in model container [2024-11-12 05:38:00,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:38:00" (3/3) ... [2024-11-12 05:38:00,166 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-99.i [2024-11-12 05:38:00,179 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:38:00,180 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:38:00,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:38:00,234 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;@6bc3d3f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:38:00,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:38:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:38:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 05:38:00,248 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:38:00,248 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:38:00,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:38:00,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:38:00,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1627403740, now seen corresponding path program 1 times [2024-11-12 05:38:00,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:38:00,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220251796] [2024-11-12 05:38:00,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:38:00,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:38:00,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:38:00,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:38:00,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:38:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:38:00,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:38:00,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:38:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-12 05:38:00,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:38:00,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:38:00,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220251796] [2024-11-12 05:38:00,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220251796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:38:00,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:38:00,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:38:00,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420974620] [2024-11-12 05:38:00,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:38:00,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:38:00,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:38:00,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:38:00,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:38:00,681 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 05:38:00,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:38:00,705 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2024-11-12 05:38:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:38:00,709 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2024-11-12 05:38:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:38:00,715 INFO L225 Difference]: With dead ends: 73 [2024-11-12 05:38:00,716 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 05:38:00,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:38:00,725 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:38:00,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:38:00,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 05:38:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 05:38:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:38:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-12 05:38:00,764 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 65 [2024-11-12 05:38:00,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:38:00,765 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-12 05:38:00,765 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 05:38:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-12 05:38:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 05:38:00,768 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:38:00,768 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:38:00,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 05:38:00,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:38:00,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:38:00,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:38:00,970 INFO L85 PathProgramCache]: Analyzing trace with hash -17831066, now seen corresponding path program 1 times [2024-11-12 05:38:00,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:38:00,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600619646] [2024-11-12 05:38:00,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:38:00,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:38:00,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:38:00,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:38:00,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:38:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:38:01,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 05:38:01,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:39:06,191 WARN L286 SmtUtils]: Spent 15.36s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 05:39:14,318 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 05:39:22,398 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)