./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.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-while_file-31.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 bf188cc293474c9f6aa32f358cba173af59946707dd6a06eac63218abddc632b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:50:01,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:50:01,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:50:01,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:50:01,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:50:01,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:50:01,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:50:01,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:50:01,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:50:01,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:50:01,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:50:01,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:50:01,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:50:01,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:50:01,277 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:50:01,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:50:01,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:50:01,277 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:50:01,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:50:01,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:50:01,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:50:01,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:50:01,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:50:01,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:50:01,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:50:01,280 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:50:01,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:50:01,280 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:50:01,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:50:01,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:50:01,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:50:01,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:50:01,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:50:01,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:50:01,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:50:01,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:50:01,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:50:01,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:50:01,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:50:01,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:50:01,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:50:01,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:50:01,283 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 -> bf188cc293474c9f6aa32f358cba173af59946707dd6a06eac63218abddc632b [2024-11-22 10:50:01,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:50:01,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:50:01,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:50:01,500 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:50:01,500 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:50:01,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i [2024-11-22 10:50:02,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:50:02,926 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:50:02,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i [2024-11-22 10:50:02,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17941b92a/7ee2878f090f4969b97bf5f7945ce22a/FLAGa758992cb [2024-11-22 10:50:02,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17941b92a/7ee2878f090f4969b97bf5f7945ce22a [2024-11-22 10:50:02,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:50:02,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:50:02,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:50:02,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:50:02,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:50:02,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:50:02" (1/1) ... [2024-11-22 10:50:02,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d95d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:02, skipping insertion in model container [2024-11-22 10:50:02,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:50:02" (1/1) ... [2024-11-22 10:50:02,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:50:03,111 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i[915,928] [2024-11-22 10:50:03,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:50:03,168 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:50:03,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i[915,928] [2024-11-22 10:50:03,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:50:03,219 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:50:03,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:03 WrapperNode [2024-11-22 10:50:03,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:50:03,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:50:03,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:50:03,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:50:03,229 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:50:03" (1/1) ... [2024-11-22 10:50:03,237 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:50:03" (1/1) ... [2024-11-22 10:50:03,295 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-11-22 10:50:03,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:50:03,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:50:03,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:50:03,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:50:03,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:03" (1/1) ... [2024-11-22 10:50:03,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:03" (1/1) ... [2024-11-22 10:50:03,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:03" (1/1) ... [2024-11-22 10:50:03,330 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:50:03,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:03" (1/1) ... [2024-11-22 10:50:03,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:03" (1/1) ... [2024-11-22 10:50:03,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:03" (1/1) ... [2024-11-22 10:50:03,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:03" (1/1) ... [2024-11-22 10:50:03,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:03" (1/1) ... [2024-11-22 10:50:03,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:03" (1/1) ... [2024-11-22 10:50:03,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:50:03,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:50:03,342 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:50:03,342 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:50:03,343 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:03" (1/1) ... [2024-11-22 10:50:03,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:50:03,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:50:03,376 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:50:03,378 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:50:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:50:03,417 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:50:03,418 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:50:03,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:50:03,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:50:03,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:50:03,483 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:50:03,485 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:50:03,723 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-22 10:50:03,724 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:50:03,733 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:50:03,734 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:50:03,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:50:03 BoogieIcfgContainer [2024-11-22 10:50:03,734 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:50:03,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:50:03,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:50:03,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:50:03,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:50:02" (1/3) ... [2024-11-22 10:50:03,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ffcf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:50:03, skipping insertion in model container [2024-11-22 10:50:03,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:03" (2/3) ... [2024-11-22 10:50:03,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ffcf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:50:03, skipping insertion in model container [2024-11-22 10:50:03,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:50:03" (3/3) ... [2024-11-22 10:50:03,741 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-31.i [2024-11-22 10:50:03,753 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:50:03,753 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:50:03,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:50:03,800 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;@4038b227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:50:03,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:50:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 10:50:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-22 10:50:03,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:03,812 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:03,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:03,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:03,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1120964836, now seen corresponding path program 1 times [2024-11-22 10:50:03,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:03,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514329635] [2024-11-22 10:50:03,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:03,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-22 10:50:04,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:50:04,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514329635] [2024-11-22 10:50:04,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514329635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:50:04,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41483338] [2024-11-22 10:50:04,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:04,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:50:04,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:50:04,022 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:50:04,023 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:50:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:04,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:50:04,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:50:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-22 10:50:04,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:50:04,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41483338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:50:04,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:50:04,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:50:04,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066820601] [2024-11-22 10:50:04,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:50:04,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:50:04,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:50:04,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:50:04,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:50:04,178 INFO L87 Difference]: Start difference. First operand has 56 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 10:50:04,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:04,200 INFO L93 Difference]: Finished difference Result 105 states and 169 transitions. [2024-11-22 10:50:04,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:50:04,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2024-11-22 10:50:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:04,210 INFO L225 Difference]: With dead ends: 105 [2024-11-22 10:50:04,210 INFO L226 Difference]: Without dead ends: 52 [2024-11-22 10:50:04,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 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:50:04,216 INFO L432 NwaCegarLoop]: 75 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, 75 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:50:04,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:50:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-22 10:50:04,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-22 10:50:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 10:50:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-11-22 10:50:04,260 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 77 [2024-11-22 10:50:04,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:04,261 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-11-22 10:50:04,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 10:50:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-11-22 10:50:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-22 10:50:04,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:04,265 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:04,273 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:50:04,469 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:50:04,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:04,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:04,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1718969566, now seen corresponding path program 1 times [2024-11-22 10:50:04,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:04,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740365945] [2024-11-22 10:50:04,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:04,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 10:50:05,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:50:05,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740365945] [2024-11-22 10:50:05,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740365945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:50:05,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:50:05,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 10:50:05,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182414839] [2024-11-22 10:50:05,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:50:05,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 10:50:05,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:50:05,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 10:50:05,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:50:05,156 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 10:50:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:05,329 INFO L93 Difference]: Finished difference Result 155 states and 220 transitions. [2024-11-22 10:50:05,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:50:05,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 77 [2024-11-22 10:50:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:05,331 INFO L225 Difference]: With dead ends: 155 [2024-11-22 10:50:05,333 INFO L226 Difference]: Without dead ends: 106 [2024-11-22 10:50:05,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:50:05,335 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 71 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:50:05,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 267 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:50:05,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-22 10:50:05,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2024-11-22 10:50:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 67 states have internal predecessors, (88), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 10:50:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2024-11-22 10:50:05,356 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 77 [2024-11-22 10:50:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:05,356 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2024-11-22 10:50:05,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 10:50:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2024-11-22 10:50:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-22 10:50:05,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:05,358 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:05,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:50:05,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:05,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:05,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1895939360, now seen corresponding path program 1 times [2024-11-22 10:50:05,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:05,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083188378] [2024-11-22 10:50:05,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:05,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 10:50:05,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:50:05,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083188378] [2024-11-22 10:50:05,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083188378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:50:05,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:50:05,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:50:05,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034064711] [2024-11-22 10:50:05,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:50:05,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:50:05,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:50:05,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:50:05,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:50:05,672 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 10:50:05,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:05,806 INFO L93 Difference]: Finished difference Result 193 states and 273 transitions. [2024-11-22 10:50:05,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 10:50:05,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 77 [2024-11-22 10:50:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:05,809 INFO L225 Difference]: With dead ends: 193 [2024-11-22 10:50:05,809 INFO L226 Difference]: Without dead ends: 108 [2024-11-22 10:50:05,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:50:05,814 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 60 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:50:05,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 346 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:50:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-22 10:50:05,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 91. [2024-11-22 10:50:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 70 states have internal predecessors, (91), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 10:50:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-11-22 10:50:05,829 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 77 [2024-11-22 10:50:05,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:05,829 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-11-22 10:50:05,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 10:50:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-11-22 10:50:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-22 10:50:05,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:05,831 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:05,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 10:50:05,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:05,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:05,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1411409276, now seen corresponding path program 1 times [2024-11-22 10:50:05,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:05,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067664679] [2024-11-22 10:50:05,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:05,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 10:50:06,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:50:06,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067664679] [2024-11-22 10:50:06,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067664679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:50:06,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:50:06,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:50:06,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684984796] [2024-11-22 10:50:06,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:50:06,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:50:06,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:50:06,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:50:06,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:50:06,264 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 10:50:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:06,435 INFO L93 Difference]: Finished difference Result 197 states and 276 transitions. [2024-11-22 10:50:06,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 10:50:06,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 78 [2024-11-22 10:50:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:06,436 INFO L225 Difference]: With dead ends: 197 [2024-11-22 10:50:06,437 INFO L226 Difference]: Without dead ends: 109 [2024-11-22 10:50:06,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:50:06,438 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 72 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:50:06,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 316 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:50:06,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-22 10:50:06,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2024-11-22 10:50:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 67 states have internal predecessors, (87), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 10:50:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2024-11-22 10:50:06,445 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 78 [2024-11-22 10:50:06,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:06,445 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2024-11-22 10:50:06,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 10:50:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2024-11-22 10:50:06,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-22 10:50:06,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:06,447 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:06,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 10:50:06,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:06,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:06,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1018382266, now seen corresponding path program 1 times [2024-11-22 10:50:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:06,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77930510] [2024-11-22 10:50:06,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:06,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 10:50:06,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:50:06,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77930510] [2024-11-22 10:50:06,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77930510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:50:06,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:50:06,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 10:50:06,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491001003] [2024-11-22 10:50:06,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:50:06,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 10:50:06,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:50:06,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 10:50:06,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:50:06,718 INFO L87 Difference]: Start difference. First operand 88 states and 125 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 10:50:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:06,920 INFO L93 Difference]: Finished difference Result 190 states and 267 transitions. [2024-11-22 10:50:06,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:50:06,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 78 [2024-11-22 10:50:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:06,922 INFO L225 Difference]: With dead ends: 190 [2024-11-22 10:50:06,922 INFO L226 Difference]: Without dead ends: 105 [2024-11-22 10:50:06,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:50:06,923 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 45 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:50:06,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 411 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:50:06,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-22 10:50:06,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2024-11-22 10:50:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 64 states have internal predecessors, (83), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 10:50:06,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-11-22 10:50:06,931 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 78 [2024-11-22 10:50:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:06,931 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-11-22 10:50:06,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 10:50:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-11-22 10:50:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-22 10:50:06,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:06,933 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:06,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 10:50:06,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:06,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash -575500647, now seen corresponding path program 1 times [2024-11-22 10:50:06,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:06,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539850112] [2024-11-22 10:50:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:06,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:50:06,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597714845] [2024-11-22 10:50:06,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:06,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:50:06,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:50:06,963 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:50:06,966 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:50:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:07,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 10:50:07,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:50:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-22 10:50:07,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:50:07,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:50:07,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539850112] [2024-11-22 10:50:07,397 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 10:50:07,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597714845] [2024-11-22 10:50:07,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597714845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:50:07,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:50:07,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-22 10:50:07,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108156397] [2024-11-22 10:50:07,398 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-22 10:50:07,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 10:50:07,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:50:07,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 10:50:07,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:50:07,401 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 10:50:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:07,642 INFO L93 Difference]: Finished difference Result 229 states and 321 transitions. [2024-11-22 10:50:07,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 10:50:07,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2024-11-22 10:50:07,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:07,645 INFO L225 Difference]: With dead ends: 229 [2024-11-22 10:50:07,646 INFO L226 Difference]: Without dead ends: 147 [2024-11-22 10:50:07,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2024-11-22 10:50:07,648 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 101 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:50:07,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 301 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:50:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-22 10:50:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2024-11-22 10:50:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-22 10:50:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2024-11-22 10:50:07,671 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 79 [2024-11-22 10:50:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:07,672 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2024-11-22 10:50:07,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 10:50:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2024-11-22 10:50:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-22 10:50:07,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:07,673 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:07,680 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:50:07,873 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,SelfDestructingSolverStorable5 [2024-11-22 10:50:07,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:07,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:07,875 INFO L85 PathProgramCache]: Analyzing trace with hash 125563931, now seen corresponding path program 1 times [2024-11-22 10:50:07,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:50:07,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418787872] [2024-11-22 10:50:07,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:07,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:50:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:50:07,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789751032] [2024-11-22 10:50:07,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:07,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:50:07,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:50:07,909 INFO L229 MonitoredProcess]: Starting monitored process 4 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:50:07,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 10:50:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:50:07,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 10:50:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:50:08,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 10:50:08,038 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 10:50:08,039 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:50:08,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 10:50:08,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:50:08,248 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:50:08,298 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:50:08,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:50:08 BoogieIcfgContainer [2024-11-22 10:50:08,300 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:50:08,300 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:50:08,300 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:50:08,301 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:50:08,301 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:50:03" (3/4) ... [2024-11-22 10:50:08,303 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 10:50:08,304 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:50:08,305 INFO L158 Benchmark]: Toolchain (without parser) took 5355.80ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 97.8MB in the beginning and 104.6MB in the end (delta: -6.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-22 10:50:08,308 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory was 74.0MB in the beginning and 73.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:50:08,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.15ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 83.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 10:50:08,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.48ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 138.7MB in the end (delta: -55.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 10:50:08,308 INFO L158 Benchmark]: Boogie Preprocessor took 35.06ms. Allocated memory is still 167.8MB. Free memory was 138.7MB in the beginning and 135.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:50:08,309 INFO L158 Benchmark]: RCFGBuilder took 392.41ms. Allocated memory is still 167.8MB. Free memory was 135.3MB in the beginning and 116.3MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 10:50:08,309 INFO L158 Benchmark]: TraceAbstraction took 4564.00ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 116.2MB in the beginning and 104.6MB in the end (delta: 11.6MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2024-11-22 10:50:08,309 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 207.6MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:50:08,310 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.14ms. Allocated memory is still 113.2MB. Free memory was 74.0MB in the beginning and 73.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.15ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 83.5MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.48ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 138.7MB in the end (delta: -55.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.06ms. Allocated memory is still 167.8MB. Free memory was 138.7MB in the beginning and 135.3MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 392.41ms. Allocated memory is still 167.8MB. Free memory was 135.3MB in the beginning and 116.3MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4564.00ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 116.2MB in the beginning and 104.6MB in the end (delta: 11.6MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 207.6MB. Free memory is still 104.6MB. 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 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 200; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1107940323; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 16; [L28] unsigned char var_1_9 = 16; [L29] unsigned short int var_1_10 = 4; [L30] double var_1_11 = 1000000.5; [L31] double var_1_12 = 1.25; [L32] signed long int last_1_var_1_1 = 200; [L33] unsigned char last_1_var_1_8 = 16; [L34] unsigned short int last_1_var_1_10 = 4; VAL [isInitial=0, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] CALL updateLastVariables() [L82] last_1_var_1_1 = var_1_1 [L83] last_1_var_1_8 = var_1_8 [L84] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L94] RET updateLastVariables() [L95] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L66] var_1_3 = __VERIFIER_nondet_long() [L67] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L67] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L68] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L68] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=0, var_1_8=16, var_1_9=16] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=0, var_1_8=16, var_1_9=16] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_8=16, var_1_9=16] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_8=16, var_1_9=16] [L74] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=16] [L74] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=16] [L75] var_1_9 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16] [L77] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L78] var_1_12 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L79] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L95] RET updateVariables() [L96] CALL step() [L38] signed long int stepLocal_2 = last_1_var_1_8; [L39] signed long int stepLocal_1 = var_1_3 * last_1_var_1_8; VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_1=17179869152, stepLocal_2=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L40] COND TRUE stepLocal_1 >= last_1_var_1_1 [L41] var_1_10 = (2 + var_1_9) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L49] signed long int stepLocal_0 = last_1_var_1_10 / var_1_3; VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_0=0, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L50] COND FALSE !(stepLocal_0 >= (500 - last_1_var_1_10)) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L53] COND TRUE \read(var_1_2) [L54] var_1_1 = ((var_1_3 - var_1_10) - var_1_8) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L60] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L87] EXPR ((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L87] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L87-L88] return (((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1))))) && (var_1_11 == ((double) var_1_12)) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 349 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 1716 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1216 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 495 IncrementalHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 500 mSDtfsCounter, 495 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 99 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 780 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 536 ConstructedInterpolants, 1 QuantifiedInterpolants, 1381 SizeOfPredicates, 3 NumberOfNonLiveVariables, 396 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 1496/1540 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:50:08,334 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-while_file-31.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 bf188cc293474c9f6aa32f358cba173af59946707dd6a06eac63218abddc632b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:50:10,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:50:10,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 10:50:10,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:50:10,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:50:10,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:50:10,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:50:10,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:50:10,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:50:10,245 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:50:10,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:50:10,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:50:10,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:50:10,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:50:10,246 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:50:10,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:50:10,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:50:10,246 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:50:10,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:50:10,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:50:10,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:50:10,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:50:10,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:50:10,248 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 10:50:10,248 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 10:50:10,249 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:50:10,249 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 10:50:10,249 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:50:10,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:50:10,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:50:10,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:50:10,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:50:10,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:50:10,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:50:10,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:50:10,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:50:10,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:50:10,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:50:10,257 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 10:50:10,257 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 10:50:10,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:50:10,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:50:10,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:50:10,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:50:10,259 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 -> bf188cc293474c9f6aa32f358cba173af59946707dd6a06eac63218abddc632b [2024-11-22 10:50:10,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:50:10,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:50:10,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:50:10,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:50:10,558 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:50:10,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i [2024-11-22 10:50:11,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:50:12,017 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:50:12,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i [2024-11-22 10:50:12,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30287fefc/f278b643d743402aa5b1779d8d357936/FLAG7fd1c314b [2024-11-22 10:50:12,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30287fefc/f278b643d743402aa5b1779d8d357936 [2024-11-22 10:50:12,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:50:12,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:50:12,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:50:12,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:50:12,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:50:12,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:50:12" (1/1) ... [2024-11-22 10:50:12,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40fcfa2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:12, skipping insertion in model container [2024-11-22 10:50:12,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:50:12" (1/1) ... [2024-11-22 10:50:12,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:50:12,226 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i[915,928] [2024-11-22 10:50:12,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:50:12,284 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:50:12,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i[915,928] [2024-11-22 10:50:12,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:50:12,340 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:50:12,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:12 WrapperNode [2024-11-22 10:50:12,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:50:12,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:50:12,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:50:12,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:50:12,347 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:50:12" (1/1) ... [2024-11-22 10:50:12,357 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:50:12" (1/1) ... [2024-11-22 10:50:12,375 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-11-22 10:50:12,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:50:12,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:50:12,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:50:12,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:50:12,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:12" (1/1) ... [2024-11-22 10:50:12,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:12" (1/1) ... [2024-11-22 10:50:12,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:12" (1/1) ... [2024-11-22 10:50:12,402 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:50:12,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:12" (1/1) ... [2024-11-22 10:50:12,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:12" (1/1) ... [2024-11-22 10:50:12,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:12" (1/1) ... [2024-11-22 10:50:12,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:12" (1/1) ... [2024-11-22 10:50:12,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:12" (1/1) ... [2024-11-22 10:50:12,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:12" (1/1) ... [2024-11-22 10:50:12,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:50:12,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:50:12,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:50:12,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:50:12,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:12" (1/1) ... [2024-11-22 10:50:12,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:50:12,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:50:12,447 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:50:12,448 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:50:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:50:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 10:50:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:50:12,480 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:50:12,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:50:12,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:50:12,539 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:50:12,540 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:50:12,803 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-22 10:50:12,804 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:50:12,815 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:50:12,816 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:50:12,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:50:12 BoogieIcfgContainer [2024-11-22 10:50:12,816 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:50:12,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:50:12,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:50:12,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:50:12,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:50:12" (1/3) ... [2024-11-22 10:50:12,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510262da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:50:12, skipping insertion in model container [2024-11-22 10:50:12,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:50:12" (2/3) ... [2024-11-22 10:50:12,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510262da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:50:12, skipping insertion in model container [2024-11-22 10:50:12,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:50:12" (3/3) ... [2024-11-22 10:50:12,825 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-31.i [2024-11-22 10:50:12,839 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:50:12,839 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:50:12,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:50:12,898 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;@477e0f4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:50:12,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:50:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 10:50:12,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-22 10:50:12,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:12,911 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:12,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:12,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:12,916 INFO L85 PathProgramCache]: Analyzing trace with hash 172654701, now seen corresponding path program 1 times [2024-11-22 10:50:12,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:50:12,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961005915] [2024-11-22 10:50:12,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:12,928 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:50:12,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:50:12,931 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:50:12,932 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:50:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:13,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:50:13,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:50:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-22 10:50:13,151 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:50:13,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:50:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961005915] [2024-11-22 10:50:13,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961005915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:50:13,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:50:13,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 10:50:13,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193284507] [2024-11-22 10:50:13,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:50:13,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:50:13,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:50:13,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:50:13,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:50:13,181 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 10:50:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:13,199 INFO L93 Difference]: Finished difference Result 79 states and 127 transitions. [2024-11-22 10:50:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:50:13,201 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2024-11-22 10:50:13,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:13,205 INFO L225 Difference]: With dead ends: 79 [2024-11-22 10:50:13,206 INFO L226 Difference]: Without dead ends: 39 [2024-11-22 10:50:13,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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:50:13,211 INFO L432 NwaCegarLoop]: 54 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, 54 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:50:13,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:50:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-22 10:50:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-22 10:50:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 10:50:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2024-11-22 10:50:13,244 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 75 [2024-11-22 10:50:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:13,244 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2024-11-22 10:50:13,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 10:50:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2024-11-22 10:50:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-22 10:50:13,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:13,248 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:13,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 10:50:13,449 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:50:13,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:13,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:13,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1665728849, now seen corresponding path program 1 times [2024-11-22 10:50:13,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:50:13,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282528041] [2024-11-22 10:50:13,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:13,451 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:50:13,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:50:13,453 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:50:13,454 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:50:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:13,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 10:50:13,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:50:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-22 10:50:14,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:50:16,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:50:16,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282528041] [2024-11-22 10:50:16,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282528041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:50:16,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [975937699] [2024-11-22 10:50:16,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:16,680 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 10:50:16,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 10:50:16,698 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 10:50:16,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-22 10:50:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:16,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 10:50:16,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:50:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-22 10:50:17,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:50:18,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [975937699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:50:18,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 10:50:18,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2024-11-22 10:50:18,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854437066] [2024-11-22 10:50:18,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 10:50:18,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 10:50:18,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:50:18,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 10:50:18,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2024-11-22 10:50:18,721 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-22 10:50:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:50:20,612 INFO L93 Difference]: Finished difference Result 136 states and 182 transitions. [2024-11-22 10:50:20,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 10:50:20,616 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 75 [2024-11-22 10:50:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:50:20,620 INFO L225 Difference]: With dead ends: 136 [2024-11-22 10:50:20,620 INFO L226 Difference]: Without dead ends: 100 [2024-11-22 10:50:20,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=376, Invalid=884, Unknown=0, NotChecked=0, Total=1260 [2024-11-22 10:50:20,621 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 74 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 10:50:20,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 318 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 10:50:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-22 10:50:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 74. [2024-11-22 10:50:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-22 10:50:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2024-11-22 10:50:20,644 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 75 [2024-11-22 10:50:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:50:20,645 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2024-11-22 10:50:20,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-22 10:50:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2024-11-22 10:50:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-22 10:50:20,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:50:20,646 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:20,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-22 10:50:20,853 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 (3)] Forceful destruction successful, exit code 0 [2024-11-22 10:50:21,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:50:21,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:50:21,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:50:21,048 INFO L85 PathProgramCache]: Analyzing trace with hash 109278513, now seen corresponding path program 1 times [2024-11-22 10:50:21,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:50:21,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669509826] [2024-11-22 10:50:21,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:50:21,049 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:50:21,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:50:21,058 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:50:21,060 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:50:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:50:21,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 10:50:21,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:50:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 130 proven. 18 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-22 10:50:30,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:51:04,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:51:04,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669509826] [2024-11-22 10:51:04,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669509826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:51:04,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2974720] [2024-11-22 10:51:04,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:51:04,284 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 10:51:04,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 10:51:04,285 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 10:51:04,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-22 10:51:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:51:04,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 10:51:04,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:51:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-22 10:51:19,226 INFO L311 TraceCheckSpWp]: Computing backward predicates...