./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-46.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 62c16d91e787288ae99ac41232bb0baaa3c2e24a529da812094625072884fa10 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:40:43,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:40:43,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:40:43,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:40:43,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:40:44,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:40:44,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:40:44,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:40:44,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:40:44,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:40:44,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:40:44,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:40:44,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:40:44,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:40:44,024 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:40:44,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:40:44,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:40:44,025 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:40:44,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:40:44,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:40:44,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:40:44,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:40:44,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:40:44,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:40:44,030 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:40:44,030 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:40:44,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:40:44,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:40:44,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:40:44,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:40:44,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:40:44,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:40:44,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:40:44,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:40:44,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:40:44,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:40:44,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:40:44,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:40:44,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:40:44,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:40:44,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:40:44,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:40:44,034 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 -> 62c16d91e787288ae99ac41232bb0baaa3c2e24a529da812094625072884fa10 [2024-11-22 10:40:44,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:40:44,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:40:44,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:40:44,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:40:44,312 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:40:44,313 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-46.i [2024-11-22 10:40:45,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:40:45,940 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:40:45,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-46.i [2024-11-22 10:40:45,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7657d9a76/942de83901ba4e1cba11c37787d073ef/FLAG836337361 [2024-11-22 10:40:46,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7657d9a76/942de83901ba4e1cba11c37787d073ef [2024-11-22 10:40:46,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:40:46,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:40:46,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:40:46,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:40:46,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:40:46,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:40:46" (1/1) ... [2024-11-22 10:40:46,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5189f0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46, skipping insertion in model container [2024-11-22 10:40:46,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:40:46" (1/1) ... [2024-11-22 10:40:46,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:40:46,509 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-46.i[915,928] [2024-11-22 10:40:46,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:40:46,551 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:40:46,562 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-46.i[915,928] [2024-11-22 10:40:46,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:40:46,607 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:40:46,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46 WrapperNode [2024-11-22 10:40:46,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:40:46,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:40:46,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:40:46,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:40:46,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46" (1/1) ... [2024-11-22 10:40:46,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46" (1/1) ... [2024-11-22 10:40:46,659 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-11-22 10:40:46,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:40:46,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:40:46,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:40:46,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:40:46,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46" (1/1) ... [2024-11-22 10:40:46,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46" (1/1) ... [2024-11-22 10:40:46,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46" (1/1) ... [2024-11-22 10:40:46,690 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:40:46,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46" (1/1) ... [2024-11-22 10:40:46,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46" (1/1) ... [2024-11-22 10:40:46,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46" (1/1) ... [2024-11-22 10:40:46,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46" (1/1) ... [2024-11-22 10:40:46,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46" (1/1) ... [2024-11-22 10:40:46,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46" (1/1) ... [2024-11-22 10:40:46,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:40:46,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:40:46,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:40:46,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:40:46,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46" (1/1) ... [2024-11-22 10:40:46,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:40:46,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:40:46,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 10:40:46,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 10:40:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:40:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:40:46,798 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:40:46,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:40:46,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:40:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:40:46,891 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:40:46,894 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:40:47,084 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-22 10:40:47,085 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:40:47,101 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:40:47,102 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:40:47,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:40:47 BoogieIcfgContainer [2024-11-22 10:40:47,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:40:47,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:40:47,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:40:47,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:40:47,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:40:46" (1/3) ... [2024-11-22 10:40:47,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19277be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:40:47, skipping insertion in model container [2024-11-22 10:40:47,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:46" (2/3) ... [2024-11-22 10:40:47,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19277be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:40:47, skipping insertion in model container [2024-11-22 10:40:47,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:40:47" (3/3) ... [2024-11-22 10:40:47,110 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-46.i [2024-11-22 10:40:47,123 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:40:47,123 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:40:47,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:40:47,179 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;@2eb50bf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:40:47,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:40:47,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 10:40:47,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 10:40:47,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:47,194 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:47,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:47,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:47,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1966731475, now seen corresponding path program 1 times [2024-11-22 10:40:47,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:47,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204577380] [2024-11-22 10:40:47,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:47,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-22 10:40:47,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:40:47,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204577380] [2024-11-22 10:40:47,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204577380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:40:47,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103769732] [2024-11-22 10:40:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:47,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:40:47,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:40:47,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:40:47,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 10:40:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:47,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:40:47,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:40:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-22 10:40:47,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:40:47,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103769732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:47,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:40:47,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:40:47,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409749887] [2024-11-22 10:40:47,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:47,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:40:47,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:40:47,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:40:47,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:40:47,564 INFO L87 Difference]: Start difference. First operand has 44 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-22 10:40:47,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:47,632 INFO L93 Difference]: Finished difference Result 85 states and 133 transitions. [2024-11-22 10:40:47,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:40:47,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2024-11-22 10:40:47,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:47,640 INFO L225 Difference]: With dead ends: 85 [2024-11-22 10:40:47,640 INFO L226 Difference]: Without dead ends: 40 [2024-11-22 10:40:47,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:40:47,645 INFO L432 NwaCegarLoop]: 60 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, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:47,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:40:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-22 10:40:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-22 10:40:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 10:40:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2024-11-22 10:40:47,715 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 69 [2024-11-22 10:40:47,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:47,715 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-11-22 10:40:47,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-22 10:40:47,716 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2024-11-22 10:40:47,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 10:40:47,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:47,723 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:47,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 10:40:47,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 10:40:47,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:47,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash -596704215, now seen corresponding path program 1 times [2024-11-22 10:40:47,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:40:47,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110002300] [2024-11-22 10:40:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:47,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:40:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:40:48,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1466166092] [2024-11-22 10:40:48,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:48,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:40:48,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:40:48,052 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:40:48,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 10:40:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:40:48,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 10:40:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:40:48,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 10:40:48,206 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 10:40:48,207 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:40:48,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 10:40:48,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-22 10:40:48,413 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-22 10:40:48,472 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:40:48,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:40:48 BoogieIcfgContainer [2024-11-22 10:40:48,477 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:40:48,477 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:40:48,477 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:40:48,478 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:40:48,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:40:47" (3/4) ... [2024-11-22 10:40:48,480 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 10:40:48,481 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:40:48,482 INFO L158 Benchmark]: Toolchain (without parser) took 2150.17ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 76.2MB in the beginning and 134.0MB in the end (delta: -57.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:40:48,482 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 146.8MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:40:48,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.68ms. Allocated memory is still 146.8MB. Free memory was 75.9MB in the beginning and 62.2MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 10:40:48,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.83ms. Allocated memory is still 146.8MB. Free memory was 62.2MB in the beginning and 59.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:40:48,483 INFO L158 Benchmark]: Boogie Preprocessor took 49.64ms. Allocated memory is still 146.8MB. Free memory was 59.7MB in the beginning and 56.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 10:40:48,483 INFO L158 Benchmark]: RCFGBuilder took 389.25ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 56.6MB in the beginning and 152.4MB in the end (delta: -95.8MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-22 10:40:48,484 INFO L158 Benchmark]: TraceAbstraction took 1372.54ms. Allocated memory is still 192.9MB. Free memory was 152.4MB in the beginning and 134.0MB in the end (delta: 18.4MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-11-22 10:40:48,484 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 192.9MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:40:48,485 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.69ms. Allocated memory is still 146.8MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.68ms. Allocated memory is still 146.8MB. Free memory was 75.9MB in the beginning and 62.2MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.83ms. Allocated memory is still 146.8MB. Free memory was 62.2MB in the beginning and 59.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.64ms. Allocated memory is still 146.8MB. Free memory was 59.7MB in the beginning and 56.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 389.25ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 56.6MB in the beginning and 152.4MB in the end (delta: -95.8MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1372.54ms. Allocated memory is still 192.9MB. Free memory was 152.4MB in the beginning and 134.0MB in the end (delta: 18.4MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 192.9MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 31.75; [L24] signed char var_1_4 = -8; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_8 = 16; [L28] unsigned char var_1_9 = 8; [L29] signed long int var_1_10 = 256; [L30] signed long int last_1_var_1_10 = 256; VAL [isInitial=0, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_2=127/4, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L92] isInitial = 1 [L93] FCALL initially() [L94] int k_loop; [L95] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_2=127/4, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L95] COND TRUE k_loop < 1 [L96] CALL updateLastVariables() [L85] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_2=127/4, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L69] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-8, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L70] var_1_4 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_4 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L71] RET assume_abort_if_not(var_1_4 >= -128) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L72] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L72] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L73] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L73] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L74] var_1_6 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_7=1, var_1_8=16, var_1_9=8] [L75] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_7=1, var_1_8=16, var_1_9=8] [L76] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L76] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L77] var_1_7 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L78] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L79] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L79] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=8] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16] [L82] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=1] [L82] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=1] [L97] RET updateVariables() [L98] CALL step() [L34] signed char stepLocal_3 = var_1_4; [L35] unsigned char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_10=256, stepLocal_2=1, stepLocal_3=-2, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=16, var_1_9=1] [L36] COND TRUE 2 != stepLocal_3 [L37] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_10=256, stepLocal_2=1, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L45] signed long int stepLocal_1 = var_1_8 / var_1_4; [L46] signed long int stepLocal_0 = (((var_1_4) < (var_1_8)) ? (var_1_4) : (var_1_8)); VAL [isInitial=1, last_1_var_1_10=256, stepLocal_0=-2, stepLocal_1=0, stepLocal_2=1, var_1_10=256, var_1_1=1, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L47] COND FALSE !((- var_1_2) >= 16.75) [L58] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_10=256, stepLocal_0=-2, stepLocal_1=0, stepLocal_2=1, var_1_10=256, var_1_1=0, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L60] signed long int stepLocal_4 = var_1_8 * var_1_8; VAL [isInitial=1, last_1_var_1_10=256, stepLocal_0=-2, stepLocal_1=0, stepLocal_2=1, stepLocal_4=1, var_1_10=256, var_1_1=0, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L61] COND FALSE !(0 > stepLocal_4) VAL [isInitial=1, last_1_var_1_10=256, stepLocal_0=-2, stepLocal_1=0, stepLocal_2=1, var_1_10=256, var_1_1=0, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L98] RET step() [L99] CALL, EXPR property() [L88-L89] return ((((- var_1_2) >= 16.75) ? (((var_1_8 / var_1_4) >= var_1_8) ? ((((((var_1_4) < (var_1_8)) ? (var_1_4) : (var_1_8))) > -32) ? (var_1_1 == ((unsigned char) 0)) : (var_1_1 == ((unsigned char) var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) : (var_1_1 == ((unsigned char) var_1_6))) && ((2 != var_1_4) ? (var_1_8 == ((unsigned char) var_1_9)) : (((var_1_9 <= last_1_var_1_10) && var_1_7) ? (var_1_8 == ((unsigned char) 128)) : (var_1_8 == ((unsigned char) var_1_9))))) && ((0 > (var_1_8 * var_1_8)) ? (var_1_1 ? (var_1_10 == ((signed long int) 5)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=0, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=0, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, var_1_10=256, var_1_1=0, var_1_4=-2, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 10, 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, 60 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, 60 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 342/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 10:40:48,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-46.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 62c16d91e787288ae99ac41232bb0baaa3c2e24a529da812094625072884fa10 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:40:50,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:40:50,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 10:40:50,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:40:50,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:40:50,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:40:50,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:40:50,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:40:50,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:40:50,550 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:40:50,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:40:50,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:40:50,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:40:50,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:40:50,552 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:40:50,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:40:50,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:40:50,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:40:50,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:40:50,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:40:50,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:40:50,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:40:50,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:40:50,557 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 10:40:50,557 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 10:40:50,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:40:50,557 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 10:40:50,558 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:40:50,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:40:50,558 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:40:50,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:40:50,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:40:50,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:40:50,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:40:50,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:40:50,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:40:50,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:40:50,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:40:50,559 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 10:40:50,559 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 10:40:50,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:40:50,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:40:50,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:40:50,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:40:50,562 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 -> 62c16d91e787288ae99ac41232bb0baaa3c2e24a529da812094625072884fa10 [2024-11-22 10:40:50,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:40:50,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:40:50,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:40:50,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:40:50,866 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:40:50,867 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-46.i [2024-11-22 10:40:52,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:40:52,515 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:40:52,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-46.i [2024-11-22 10:40:52,522 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95315ffd8/cd40c15300f84acca6b82ab0fefbbd3c/FLAGa6f6c8a58 [2024-11-22 10:40:52,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95315ffd8/cd40c15300f84acca6b82ab0fefbbd3c [2024-11-22 10:40:52,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:40:52,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:40:52,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:40:52,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:40:52,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:40:52,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:40:52" (1/1) ... [2024-11-22 10:40:52,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee540de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52, skipping insertion in model container [2024-11-22 10:40:52,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:40:52" (1/1) ... [2024-11-22 10:40:52,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:40:52,719 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-46.i[915,928] [2024-11-22 10:40:52,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:40:52,775 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:40:52,785 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-46.i[915,928] [2024-11-22 10:40:52,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:40:52,825 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:40:52,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52 WrapperNode [2024-11-22 10:40:52,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:40:52,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:40:52,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:40:52,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:40:52,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52" (1/1) ... [2024-11-22 10:40:52,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52" (1/1) ... [2024-11-22 10:40:52,863 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-11-22 10:40:52,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:40:52,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:40:52,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:40:52,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:40:52,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52" (1/1) ... [2024-11-22 10:40:52,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52" (1/1) ... [2024-11-22 10:40:52,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52" (1/1) ... [2024-11-22 10:40:52,901 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 10:40:52,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52" (1/1) ... [2024-11-22 10:40:52,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52" (1/1) ... [2024-11-22 10:40:52,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52" (1/1) ... [2024-11-22 10:40:52,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52" (1/1) ... [2024-11-22 10:40:52,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52" (1/1) ... [2024-11-22 10:40:52,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52" (1/1) ... [2024-11-22 10:40:52,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:40:52,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:40:52,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:40:52,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:40:52,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52" (1/1) ... [2024-11-22 10:40:52,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:40:52,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:40:52,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 10:40:52,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 10:40:53,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:40:53,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 10:40:53,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:40:53,028 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:40:53,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:40:53,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:40:53,101 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:40:53,103 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:40:53,368 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-22 10:40:53,369 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:40:53,388 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:40:53,388 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:40:53,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:40:53 BoogieIcfgContainer [2024-11-22 10:40:53,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:40:53,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:40:53,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:40:53,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:40:53,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:40:52" (1/3) ... [2024-11-22 10:40:53,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38af12ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:40:53, skipping insertion in model container [2024-11-22 10:40:53,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:52" (2/3) ... [2024-11-22 10:40:53,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38af12ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:40:53, skipping insertion in model container [2024-11-22 10:40:53,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:40:53" (3/3) ... [2024-11-22 10:40:53,404 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-46.i [2024-11-22 10:40:53,417 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:40:53,417 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:40:53,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:40:53,475 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;@5de744c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:40:53,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:40:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 10:40:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 10:40:53,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:53,489 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:53,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:53,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:53,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1966731475, now seen corresponding path program 1 times [2024-11-22 10:40:53,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:40:53,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125128708] [2024-11-22 10:40:53,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:53,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:40:53,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:40:53,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:40:53,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 10:40:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:53,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:40:53,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:40:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-22 10:40:53,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:40:53,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:40:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125128708] [2024-11-22 10:40:53,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125128708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:40:53,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:40:53,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 10:40:53,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533824956] [2024-11-22 10:40:53,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:40:53,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:40:53,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:40:53,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:40:53,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:40:53,684 INFO L87 Difference]: Start difference. First operand has 44 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 10:40:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:40:53,703 INFO L93 Difference]: Finished difference Result 85 states and 133 transitions. [2024-11-22 10:40:53,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:40:53,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-11-22 10:40:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:40:53,709 INFO L225 Difference]: With dead ends: 85 [2024-11-22 10:40:53,709 INFO L226 Difference]: Without dead ends: 40 [2024-11-22 10:40:53,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:40:53,714 INFO L432 NwaCegarLoop]: 60 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, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:40:53,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:40:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-22 10:40:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-22 10:40:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 10:40:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2024-11-22 10:40:53,750 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 69 [2024-11-22 10:40:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:40:53,750 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-11-22 10:40:53,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 10:40:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2024-11-22 10:40:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 10:40:53,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:40:53,752 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:40:53,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 10:40:53,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:40:53,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:40:53,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:40:53,958 INFO L85 PathProgramCache]: Analyzing trace with hash -596704215, now seen corresponding path program 1 times [2024-11-22 10:40:53,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:40:53,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624249942] [2024-11-22 10:40:53,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:40:53,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:40:53,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:40:53,961 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:40:53,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 10:40:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:40:54,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 10:40:54,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:41:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-22 10:41:47,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:41:47,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:41:47,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624249942] [2024-11-22 10:41:47,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624249942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:41:47,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:41:47,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 10:41:47,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502200578] [2024-11-22 10:41:47,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:41:47,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 10:41:47,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:41:47,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 10:41:47,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:41:47,544 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 10:41:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:41:47,815 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2024-11-22 10:41:47,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 10:41:47,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-11-22 10:41:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:41:47,818 INFO L225 Difference]: With dead ends: 74 [2024-11-22 10:41:47,818 INFO L226 Difference]: Without dead ends: 72 [2024-11-22 10:41:47,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:41:47,819 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 34 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:41:47,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 270 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:41:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-22 10:41:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2024-11-22 10:41:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 52 states have internal predecessors, (67), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 10:41:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2024-11-22 10:41:47,828 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 69 [2024-11-22 10:41:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:41:47,828 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2024-11-22 10:41:47,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 10:41:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2024-11-22 10:41:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-22 10:41:47,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:41:47,830 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:41:47,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 10:41:48,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:41:48,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:41:48,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:41:48,032 INFO L85 PathProgramCache]: Analyzing trace with hash -406883653, now seen corresponding path program 1 times [2024-11-22 10:41:48,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:41:48,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553632508] [2024-11-22 10:41:48,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:41:48,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:41:48,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:41:48,035 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:41:48,037 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 (4)] Waiting until timeout for monitored process [2024-11-22 10:41:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:41:48,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 10:41:48,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:42:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-22 10:42:13,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:42:13,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:42:13,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553632508] [2024-11-22 10:42:13,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553632508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:42:13,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:42:13,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 10:42:13,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638107336] [2024-11-22 10:42:13,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:42:13,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:42:13,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:42:13,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:42:13,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:42:13,428 INFO L87 Difference]: Start difference. First operand 65 states and 89 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 10:42:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:42:15,211 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2024-11-22 10:42:15,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:42:15,212 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 70 [2024-11-22 10:42:15,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:42:15,213 INFO L225 Difference]: With dead ends: 80 [2024-11-22 10:42:15,213 INFO L226 Difference]: Without dead ends: 78 [2024-11-22 10:42:15,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:42:15,214 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 44 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:42:15,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 379 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 10:42:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-22 10:42:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2024-11-22 10:42:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 52 states have internal predecessors, (67), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 10:42:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2024-11-22 10:42:15,222 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 70 [2024-11-22 10:42:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:42:15,222 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2024-11-22 10:42:15,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-22 10:42:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2024-11-22 10:42:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-22 10:42:15,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:42:15,224 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:42:15,230 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 (4)] Forceful destruction successful, exit code 0 [2024-11-22 10:42:15,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:42:15,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:42:15,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:42:15,426 INFO L85 PathProgramCache]: Analyzing trace with hash -430980069, now seen corresponding path program 1 times [2024-11-22 10:42:15,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:42:15,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282974379] [2024-11-22 10:42:15,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:42:15,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 10:42:15,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:42:15,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 10:42:15,431 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 (5)] Waiting until timeout for monitored process [2024-11-22 10:42:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:42:15,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 10:42:15,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:42:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 93 proven. 9 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-22 10:42:17,681 INFO L311 TraceCheckSpWp]: Computing backward predicates...