./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-67.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-1loop_file-67.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 eab8bb5264af256faa5495eae630c9d7fc0f9ba0bd7283414fe1b06e45a31044 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:23:20,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:23:20,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:23:20,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:23:20,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:23:20,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:23:20,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:23:20,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:23:20,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:23:20,127 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:23:20,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:23:20,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:23:20,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:23:20,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:23:20,128 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:23:20,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:23:20,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:23:20,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:23:20,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:23:20,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:23:20,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:23:20,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:23:20,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:23:20,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:23:20,131 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:23:20,131 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:23:20,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:23:20,132 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:23:20,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:23:20,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:23:20,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:23:20,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:23:20,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:23:20,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:23:20,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:23:20,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:23:20,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:23:20,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:23:20,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:23:20,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:23:20,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:23:20,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:23:20,135 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 -> eab8bb5264af256faa5495eae630c9d7fc0f9ba0bd7283414fe1b06e45a31044 [2024-11-12 05:23:20,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:23:20,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:23:20,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:23:20,391 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:23:20,394 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:23:20,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-67.i [2024-11-12 05:23:21,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:23:21,988 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:23:21,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-67.i [2024-11-12 05:23:21,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84c213f1f/5d051c2b4d7a4c5e87557ef7d087d16c/FLAG455b3ca34 [2024-11-12 05:23:22,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84c213f1f/5d051c2b4d7a4c5e87557ef7d087d16c [2024-11-12 05:23:22,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:23:22,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:23:22,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:23:22,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:23:22,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:23:22,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:23:22" (1/1) ... [2024-11-12 05:23:22,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4644e29c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:22, skipping insertion in model container [2024-11-12 05:23:22,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:23:22" (1/1) ... [2024-11-12 05:23:22,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:23:22,586 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-1loop_file-67.i[915,928] [2024-11-12 05:23:22,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:23:22,646 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:23:22,657 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-1loop_file-67.i[915,928] [2024-11-12 05:23:22,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:23:22,689 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:23:22,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:22 WrapperNode [2024-11-12 05:23:22,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:23:22,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:23:22,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:23:22,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:23:22,699 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:23:22" (1/1) ... [2024-11-12 05:23:22,706 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:23:22" (1/1) ... [2024-11-12 05:23:22,732 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-12 05:23:22,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:23:22,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:23:22,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:23:22,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:23:22,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:22" (1/1) ... [2024-11-12 05:23:22,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:22" (1/1) ... [2024-11-12 05:23:22,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:22" (1/1) ... [2024-11-12 05:23:22,834 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:23:22,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:22" (1/1) ... [2024-11-12 05:23:22,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:22" (1/1) ... [2024-11-12 05:23:22,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:22" (1/1) ... [2024-11-12 05:23:22,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:22" (1/1) ... [2024-11-12 05:23:22,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:22" (1/1) ... [2024-11-12 05:23:22,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:22" (1/1) ... [2024-11-12 05:23:22,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:23:22,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:23:22,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:23:22,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:23:22,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:22" (1/1) ... [2024-11-12 05:23:22,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:23:22,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:23:22,879 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:23:22,881 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:23:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:23:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:23:22,917 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:23:22,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:23:22,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:23:22,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:23:22,981 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:23:22,985 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:23:23,208 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 05:23:23,208 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:23:23,222 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:23:23,223 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:23:23,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:23:23 BoogieIcfgContainer [2024-11-12 05:23:23,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:23:23,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:23:23,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:23:23,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:23:23,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:23:22" (1/3) ... [2024-11-12 05:23:23,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df7ed8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:23:23, skipping insertion in model container [2024-11-12 05:23:23,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:22" (2/3) ... [2024-11-12 05:23:23,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df7ed8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:23:23, skipping insertion in model container [2024-11-12 05:23:23,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:23:23" (3/3) ... [2024-11-12 05:23:23,233 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-67.i [2024-11-12 05:23:23,246 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:23:23,246 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:23:23,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:23:23,297 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;@365374e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:23:23,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:23:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 05:23:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-12 05:23:23,309 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:23:23,310 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:23,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:23:23,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:23:23,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1175446519, now seen corresponding path program 1 times [2024-11-12 05:23:23,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:23:23,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679087104] [2024-11-12 05:23:23,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:23:23,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:23:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:23:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:23:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:23:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:23:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:23:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:23:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:23:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:23:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:23:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:23:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:23:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:23:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 05:23:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:23:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:23:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 05:23:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:23:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 05:23:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:23:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 05:23:23,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:23:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679087104] [2024-11-12 05:23:23,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679087104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:23:23,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:23:23,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:23:23,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239648972] [2024-11-12 05:23:23,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:23:23,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:23:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:23:23,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:23:23,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:23:23,643 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 05:23:23,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:23:23,664 INFO L93 Difference]: Finished difference Result 105 states and 176 transitions. [2024-11-12 05:23:23,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:23:23,666 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 117 [2024-11-12 05:23:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:23:23,673 INFO L225 Difference]: With dead ends: 105 [2024-11-12 05:23:23,673 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 05:23:23,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:23:23,678 INFO L435 NwaCegarLoop]: 77 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, 77 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:23:23,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:23:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 05:23:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 05:23:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 05:23:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-12 05:23:23,754 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 117 [2024-11-12 05:23:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:23:23,760 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-12 05:23:23,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 05:23:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-12 05:23:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-12 05:23:23,763 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:23:23,763 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:23,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:23:23,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:23:23,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:23:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1013678855, now seen corresponding path program 1 times [2024-11-12 05:23:23,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:23:23,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987426298] [2024-11-12 05:23:23,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:23:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:23:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:23:24,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387885514] [2024-11-12 05:23:24,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:23:24,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:23:24,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:23:24,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:23:24,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:23:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:23:24,335 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:23:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:23:24,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:23:24,482 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:23:24,483 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:23:24,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 05:23:24,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:23:24,693 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 05:23:24,764 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:23:24,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:23:24 BoogieIcfgContainer [2024-11-12 05:23:24,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:23:24,767 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:23:24,767 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:23:24,768 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:23:24,768 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:23:23" (3/4) ... [2024-11-12 05:23:24,770 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:23:24,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:23:24,772 INFO L158 Benchmark]: Toolchain (without parser) took 2372.08ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 71.4MB in the beginning and 137.5MB in the end (delta: -66.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:23:24,772 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 142.6MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:23:24,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.48ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 56.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 05:23:24,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.72ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 55.8MB in the beginning and 177.6MB in the end (delta: -121.8MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-11-12 05:23:24,773 INFO L158 Benchmark]: Boogie Preprocessor took 74.06ms. Allocated memory is still 207.6MB. Free memory was 177.6MB in the beginning and 175.4MB in the end (delta: 2.2MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-12 05:23:24,774 INFO L158 Benchmark]: RCFGBuilder took 375.88ms. Allocated memory is still 207.6MB. Free memory was 175.4MB in the beginning and 157.5MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 05:23:24,774 INFO L158 Benchmark]: TraceAbstraction took 1539.48ms. Allocated memory is still 207.6MB. Free memory was 157.5MB in the beginning and 137.5MB in the end (delta: 20.0MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-12 05:23:24,774 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 207.6MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:23:24,776 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.47ms. Allocated memory is still 142.6MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.48ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 56.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.72ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 55.8MB in the beginning and 177.6MB in the end (delta: -121.8MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.06ms. Allocated memory is still 207.6MB. Free memory was 177.6MB in the beginning and 175.4MB in the end (delta: 2.2MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * RCFGBuilder took 375.88ms. Allocated memory is still 207.6MB. Free memory was 175.4MB in the beginning and 157.5MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1539.48ms. Allocated memory is still 207.6MB. Free memory was 157.5MB in the beginning and 137.5MB in the end (delta: 20.0MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 207.6MB. Free memory is still 137.5MB. 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 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] signed short int var_1_4 = -64; [L24] signed short int var_1_5 = 256; [L25] unsigned short int var_1_6 = 128; [L26] signed short int var_1_7 = -128; [L27] unsigned short int var_1_8 = 16; [L28] unsigned short int var_1_9 = 256; [L29] signed long int var_1_10 = 128; [L30] unsigned short int var_1_11 = 47512; [L31] unsigned char var_1_12 = 16; [L32] unsigned char var_1_13 = 1; [L33] float var_1_14 = 5.5; [L34] float var_1_15 = 24.5; [L35] signed short int last_1_var_1_1 = 2; [L36] unsigned short int last_1_var_1_6 = 128; VAL [isInitial=0, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=-64, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L102] isInitial = 1 [L103] FCALL initially() [L104] int k_loop; [L105] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=-64, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L105] COND TRUE k_loop < 1 [L106] CALL updateLastVariables() [L94] last_1_var_1_1 = var_1_1 [L95] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=-64, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L64] var_1_4 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L65] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L66] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L66] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L67] var_1_5 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L68] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L69] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L69] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L70] var_1_7 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_7 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L71] RET assume_abort_if_not(var_1_7 >= -32768) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L72] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L72] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L73] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L73] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L74] var_1_8 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_9=256] [L75] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_9=256] [L76] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=256] [L76] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=256] [L77] var_1_9 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0] [L79] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L79] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L80] var_1_11 = __VERIFIER_nondet_ushort() [L81] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L81] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L82] CALL assume_abort_if_not(var_1_11 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L82] RET assume_abort_if_not(var_1_11 <= 65535) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L83] var_1_12 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L84] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L85] CALL assume_abort_if_not(var_1_12 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L85] RET assume_abort_if_not(var_1_12 <= 255) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L86] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L86] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L87] var_1_13 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L88] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L89] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=-255, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=-255, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L89] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=-255, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L90] var_1_15 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=-255, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=-255, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L91] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=-255, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L107] RET updateVariables() [L108] CALL step() [L40] signed long int stepLocal_1 = last_1_var_1_6; [L41] signed long int stepLocal_0 = last_1_var_1_6; VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_0=128, stepLocal_1=128, var_1_10=128, var_1_11=32767, var_1_12=2, var_1_13=-255, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L42] COND FALSE !(stepLocal_0 >= (var_1_11 - var_1_8)) [L53] var_1_10 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=2, var_1_13=-255, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L55] COND FALSE !(! (var_1_10 <= last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=2, var_1_13=-255, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=65536] [L58] COND TRUE var_1_4 > (var_1_10 / var_1_7) [L59] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=2, var_1_13=-255, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=0, var_1_7=3, var_1_8=0, var_1_9=65536] [L61] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=2, var_1_13=-255, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=0, var_1_7=3, var_1_8=0, var_1_9=65536] [L108] RET step() [L109] CALL, EXPR property() [L98-L99] return ((((! (var_1_10 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && ((var_1_4 > (var_1_10 / var_1_7)) ? (var_1_6 == ((unsigned short int) (var_1_8 + var_1_9))) : 1)) && ((last_1_var_1_6 >= (var_1_11 - var_1_8)) ? (((var_1_7 / var_1_12) <= last_1_var_1_6) ? (var_1_10 == ((signed long int) ((last_1_var_1_6 - var_1_8) + -32))) : (var_1_13 ? (var_1_10 == ((signed long int) ((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))))) : (var_1_10 == ((signed long int) var_1_5)))) : (var_1_10 == ((signed long int) last_1_var_1_1)))) && (var_1_14 == ((float) var_1_15)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=2, var_1_11=32767, var_1_12=2, var_1_13=-255, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=0, var_1_7=3, var_1_8=0, var_1_9=65536] [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=2, var_1_11=32767, var_1_12=2, var_1_13=-255, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=0, var_1_7=3, var_1_8=0, var_1_9=65536] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=2, var_1_11=32767, var_1_12=2, var_1_13=-255, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=1, var_1_5=-16383, var_1_6=0, var_1_7=3, var_1_8=0, var_1_9=65536] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 19, 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, 77 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, 77 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 684/684 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:23:24,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-67.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 eab8bb5264af256faa5495eae630c9d7fc0f9ba0bd7283414fe1b06e45a31044 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:23:27,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:23:27,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:23:27,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:23:27,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:23:27,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:23:27,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:23:27,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:23:27,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:23:27,440 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:23:27,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:23:27,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:23:27,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:23:27,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:23:27,442 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:23:27,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:23:27,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:23:27,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:23:27,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:23:27,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:23:27,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:23:27,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:23:27,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:23:27,451 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:23:27,451 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:23:27,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:23:27,451 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:23:27,452 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:23:27,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:23:27,452 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:23:27,453 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:23:27,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:23:27,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:23:27,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:23:27,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:23:27,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:23:27,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:23:27,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:23:27,456 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:23:27,456 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:23:27,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:23:27,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:23:27,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:23:27,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:23:27,458 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 -> eab8bb5264af256faa5495eae630c9d7fc0f9ba0bd7283414fe1b06e45a31044 [2024-11-12 05:23:27,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:23:27,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:23:27,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:23:27,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:23:27,765 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:23:27,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-67.i [2024-11-12 05:23:29,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:23:29,489 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:23:29,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-67.i [2024-11-12 05:23:29,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae30149c/bb5e77bced6d41c0aaec3428321dfa22/FLAG3b5b42bf6 [2024-11-12 05:23:29,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae30149c/bb5e77bced6d41c0aaec3428321dfa22 [2024-11-12 05:23:29,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:23:29,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:23:29,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:23:29,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:23:29,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:23:29,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:23:29" (1/1) ... [2024-11-12 05:23:29,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a8f42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:29, skipping insertion in model container [2024-11-12 05:23:29,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:23:29" (1/1) ... [2024-11-12 05:23:29,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:23:29,701 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-1loop_file-67.i[915,928] [2024-11-12 05:23:29,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:23:29,763 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:23:29,773 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-1loop_file-67.i[915,928] [2024-11-12 05:23:29,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:23:29,818 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:23:29,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:29 WrapperNode [2024-11-12 05:23:29,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:23:29,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:23:29,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:23:29,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:23:29,824 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:23:29" (1/1) ... [2024-11-12 05:23:29,836 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:23:29" (1/1) ... [2024-11-12 05:23:29,862 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-12 05:23:29,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:23:29,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:23:29,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:23:29,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:23:29,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:29" (1/1) ... [2024-11-12 05:23:29,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:29" (1/1) ... [2024-11-12 05:23:29,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:29" (1/1) ... [2024-11-12 05:23:29,890 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:23:29,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:29" (1/1) ... [2024-11-12 05:23:29,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:29" (1/1) ... [2024-11-12 05:23:29,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:29" (1/1) ... [2024-11-12 05:23:29,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:29" (1/1) ... [2024-11-12 05:23:29,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:29" (1/1) ... [2024-11-12 05:23:29,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:29" (1/1) ... [2024-11-12 05:23:29,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:23:29,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:23:29,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:23:29,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:23:29,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:29" (1/1) ... [2024-11-12 05:23:29,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:23:29,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:23:29,979 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:23:29,981 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:23:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:23:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:23:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:23:30,037 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:23:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:23:30,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:23:30,138 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:23:30,140 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:23:30,478 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 05:23:30,478 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:23:30,490 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:23:30,491 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:23:30,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:23:30 BoogieIcfgContainer [2024-11-12 05:23:30,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:23:30,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:23:30,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:23:30,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:23:30,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:23:29" (1/3) ... [2024-11-12 05:23:30,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494149fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:23:30, skipping insertion in model container [2024-11-12 05:23:30,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:23:29" (2/3) ... [2024-11-12 05:23:30,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494149fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:23:30, skipping insertion in model container [2024-11-12 05:23:30,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:23:30" (3/3) ... [2024-11-12 05:23:30,500 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-67.i [2024-11-12 05:23:30,514 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:23:30,514 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:23:30,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:23:30,574 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;@7d8363b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:23:30,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:23:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 05:23:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-12 05:23:30,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:23:30,588 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:30,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:23:30,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:23:30,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1175446519, now seen corresponding path program 1 times [2024-11-12 05:23:30,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:23:30,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612246752] [2024-11-12 05:23:30,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:23:30,605 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:23:30,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:23:30,609 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:23:30,614 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:23:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:30,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:23:30,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:23:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-12 05:23:30,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:23:30,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:23:30,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612246752] [2024-11-12 05:23:30,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612246752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:23:30,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:23:30,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:23:30,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690849268] [2024-11-12 05:23:30,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:23:30,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:23:30,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:23:30,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:23:30,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:23:30,845 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 05:23:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:23:30,890 INFO L93 Difference]: Finished difference Result 105 states and 176 transitions. [2024-11-12 05:23:30,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:23:30,896 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 117 [2024-11-12 05:23:30,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:23:30,904 INFO L225 Difference]: With dead ends: 105 [2024-11-12 05:23:30,908 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 05:23:30,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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:23:30,919 INFO L435 NwaCegarLoop]: 77 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, 77 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:23:30,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:23:30,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 05:23:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 05:23:30,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 05:23:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-12 05:23:30,955 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 117 [2024-11-12 05:23:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:23:30,957 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-12 05:23:30,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 05:23:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-12 05:23:30,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-12 05:23:30,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:23:30,965 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:30,973 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:23:31,166 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:23:31,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:23:31,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:23:31,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1013678855, now seen corresponding path program 1 times [2024-11-12 05:23:31,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:23:31,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110305177] [2024-11-12 05:23:31,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:23:31,169 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:23:31,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:23:31,173 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:23:31,174 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:23:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:31,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 05:23:31,341 INFO L279 TraceCheckSpWp]: Computing forward predicates...