./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c -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 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 19:09:15,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 19:09:16,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 19:09:16,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 19:09:16,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 19:09:16,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 19:09:16,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 19:09:16,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 19:09:16,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 19:09:16,049 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 19:09:16,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 19:09:16,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 19:09:16,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 19:09:16,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 19:09:16,050 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 19:09:16,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 19:09:16,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 19:09:16,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 19:09:16,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 19:09:16,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 19:09:16,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 19:09:16,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 19:09:16,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 19:09:16,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 19:09:16,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 19:09:16,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 19:09:16,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 19:09:16,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 19:09:16,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 19:09:16,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 19:09:16,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 19:09:16,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 19:09:16,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:09:16,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 19:09:16,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 19:09:16,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 19:09:16,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 19:09:16,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 19:09:16,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 19:09:16,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 19:09:16,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 19:09:16,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 19:09:16,057 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 -> 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e [2024-11-19 19:09:16,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 19:09:16,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 19:09:16,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 19:09:16,280 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 19:09:16,280 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 19:09:16,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-19 19:09:17,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 19:09:17,896 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 19:09:17,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-19 19:09:17,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c82b834/36f72b68f5c4496d802f767de4496168/FLAG05b3ed218 [2024-11-19 19:09:18,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c82b834/36f72b68f5c4496d802f767de4496168 [2024-11-19 19:09:18,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 19:09:18,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 19:09:18,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 19:09:18,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 19:09:18,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 19:09:18,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:09:18" (1/1) ... [2024-11-19 19:09:18,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e914136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18, skipping insertion in model container [2024-11-19 19:09:18,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:09:18" (1/1) ... [2024-11-19 19:09:18,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 19:09:18,517 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/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-19 19:09:18,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:09:18,538 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 19:09:18,554 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/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-19 19:09:18,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:09:18,576 INFO L204 MainTranslator]: Completed translation [2024-11-19 19:09:18,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18 WrapperNode [2024-11-19 19:09:18,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 19:09:18,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 19:09:18,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 19:09:18,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 19:09:18,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18" (1/1) ... [2024-11-19 19:09:18,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18" (1/1) ... [2024-11-19 19:09:18,607 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 85 [2024-11-19 19:09:18,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 19:09:18,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 19:09:18,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 19:09:18,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 19:09:18,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18" (1/1) ... [2024-11-19 19:09:18,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18" (1/1) ... [2024-11-19 19:09:18,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18" (1/1) ... [2024-11-19 19:09:18,639 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-19 19:09:18,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18" (1/1) ... [2024-11-19 19:09:18,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18" (1/1) ... [2024-11-19 19:09:18,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18" (1/1) ... [2024-11-19 19:09:18,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18" (1/1) ... [2024-11-19 19:09:18,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18" (1/1) ... [2024-11-19 19:09:18,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18" (1/1) ... [2024-11-19 19:09:18,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 19:09:18,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 19:09:18,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 19:09:18,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 19:09:18,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18" (1/1) ... [2024-11-19 19:09:18,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:09:18,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 19:09:18,681 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-19 19:09:18,686 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-19 19:09:18,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 19:09:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 19:09:18,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 19:09:18,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 19:09:18,841 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 19:09:18,842 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 19:09:18,990 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-19 19:09:18,993 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 19:09:19,006 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 19:09:19,006 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 19:09:19,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:09:19 BoogieIcfgContainer [2024-11-19 19:09:19,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 19:09:19,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 19:09:19,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 19:09:19,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 19:09:19,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:09:18" (1/3) ... [2024-11-19 19:09:19,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40093412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:09:19, skipping insertion in model container [2024-11-19 19:09:19,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:18" (2/3) ... [2024-11-19 19:09:19,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40093412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:09:19, skipping insertion in model container [2024-11-19 19:09:19,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:09:19" (3/3) ... [2024-11-19 19:09:19,015 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.p+cfa-reducer.c [2024-11-19 19:09:19,030 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 19:09:19,030 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 19:09:19,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 19:09:19,093 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;@67e3ea14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 19:09:19,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 19:09:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:09:19,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 19:09:19,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:09:19,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:09:19,104 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:09:19,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:09:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash -34829450, now seen corresponding path program 1 times [2024-11-19 19:09:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:09:19,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623401243] [2024-11-19 19:09:19,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:09:19,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:09:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:09:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:09:19,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 19:09:19,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623401243] [2024-11-19 19:09:19,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623401243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:09:19,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:09:19,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:09:19,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702031351] [2024-11-19 19:09:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:09:19,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:09:19,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 19:09:19,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:09:19,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:09:19,377 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:09:19,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:09:19,409 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2024-11-19 19:09:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 19:09:19,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 19:09:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:09:19,423 INFO L225 Difference]: With dead ends: 32 [2024-11-19 19:09:19,423 INFO L226 Difference]: Without dead ends: 24 [2024-11-19 19:09:19,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:09:19,429 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:09:19,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:09:19,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-19 19:09:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-19 19:09:19,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:09:19,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-19 19:09:19,456 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2024-11-19 19:09:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:09:19,456 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-19 19:09:19,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:09:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-19 19:09:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 19:09:19,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:09:19,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:09:19,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 19:09:19,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:09:19,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:09:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash -17818789, now seen corresponding path program 1 times [2024-11-19 19:09:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 19:09:19,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263684170] [2024-11-19 19:09:19,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:09:19,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 19:09:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 19:09:19,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 19:09:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 19:09:19,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 19:09:19,501 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 19:09:19,503 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 19:09:19,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 19:09:19,508 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-19 19:09:19,527 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 19:09:19,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:09:19 BoogieIcfgContainer [2024-11-19 19:09:19,535 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 19:09:19,535 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 19:09:19,536 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 19:09:19,536 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 19:09:19,536 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:09:19" (3/4) ... [2024-11-19 19:09:19,538 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 19:09:19,540 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 19:09:19,541 INFO L158 Benchmark]: Toolchain (without parser) took 1231.02ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 84.9MB in the beginning and 141.7MB in the end (delta: -56.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:09:19,541 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:09:19,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.80ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 71.8MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 19:09:19,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.02ms. Allocated memory is still 155.2MB. Free memory was 71.7MB in the beginning and 70.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:09:19,543 INFO L158 Benchmark]: Boogie Preprocessor took 44.79ms. Allocated memory is still 155.2MB. Free memory was 70.2MB in the beginning and 68.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 19:09:19,543 INFO L158 Benchmark]: RCFGBuilder took 353.37ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 68.5MB in the beginning and 172.1MB in the end (delta: -103.6MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-11-19 19:09:19,544 INFO L158 Benchmark]: TraceAbstraction took 525.56ms. Allocated memory is still 207.6MB. Free memory was 171.1MB in the beginning and 142.7MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-19 19:09:19,544 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 207.6MB. Free memory is still 141.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 19:09:19,546 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.16ms. Allocated memory is still 155.2MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.80ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 71.8MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.02ms. Allocated memory is still 155.2MB. Free memory was 71.7MB in the beginning and 70.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.79ms. Allocated memory is still 155.2MB. Free memory was 70.2MB in the beginning and 68.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 353.37ms. Allocated memory was 155.2MB in the beginning and 207.6MB in the end (delta: 52.4MB). Free memory was 68.5MB in the beginning and 172.1MB in the end (delta: -103.6MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * TraceAbstraction took 525.56ms. Allocated memory is still 207.6MB. Free memory was 171.1MB in the beginning and 142.7MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 207.6MB. Free memory is still 141.7MB. 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: 66]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 20, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L14] float main__X; [L15] float main__Y; [L16] float main__S; [L17] float main__R; [L18] float main__D; [L19] int main__i; [L20] main__Y = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i < 100000 [L25] main__X = __VERIFIER_nondet_float() [L26] main__D = __VERIFIER_nondet_float() [L27] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__i=0] [L28] COND TRUE main__X >= -128.0 VAL [__return_main=0, main__i=0] [L30] COND TRUE main__X <= 128.0 [L32] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0] [L34] COND TRUE main____CPAchecker_TMP_0 != 0 [L36] int main____CPAchecker_TMP_1; VAL [__return_main=0, main__i=0] [L37] COND TRUE main__D >= 0.0 VAL [__return_main=0, main__i=0] [L39] COND TRUE main__D <= 16.0 [L41] main____CPAchecker_TMP_1 = 1 VAL [__return_main=0, main____CPAchecker_TMP_1=1, main__i=0] [L43] COND TRUE main____CPAchecker_TMP_1 != 0 [L45] main__S = main__Y [L46] main__Y = main__X [L47] main__R = main__X - main__S VAL [__return_main=0, main__Y=54, main__i=0] [L48] COND TRUE main__R <= (-main__D) [L50] main__Y = main__S - main__D VAL [__return_main=0, main__i=0] [L52] int main____CPAchecker_TMP_2; VAL [__return_main=0, main__i=0] [L53] COND FALSE !(main__Y >= -129.0) VAL [__return_main=0, main__i=0] [L79] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0, main____CPAchecker_TMP_2=0, main__i=0] [L60] int __tmp_1; [L61] __tmp_1 = main____CPAchecker_TMP_2 [L62] int __VERIFIER_assert__cond; [L63] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, main__i=0] [L64] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, main__i=0] [L66] reach_error() VAL [__return_main=0, main__i=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 31 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 23 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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-19 19:09:19,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c -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 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 19:09:21,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 19:09:21,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 19:09:21,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 19:09:21,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 19:09:21,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 19:09:21,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 19:09:21,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 19:09:21,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 19:09:21,667 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 19:09:21,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 19:09:21,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 19:09:21,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 19:09:21,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 19:09:21,671 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 19:09:21,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 19:09:21,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 19:09:21,671 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 19:09:21,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 19:09:21,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 19:09:21,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 19:09:21,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 19:09:21,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 19:09:21,673 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 19:09:21,673 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 19:09:21,674 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 19:09:21,674 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 19:09:21,674 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 19:09:21,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 19:09:21,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 19:09:21,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 19:09:21,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 19:09:21,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 19:09:21,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 19:09:21,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:09:21,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 19:09:21,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 19:09:21,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 19:09:21,688 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 19:09:21,688 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 19:09:21,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 19:09:21,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 19:09:21,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 19:09:21,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 19:09:21,691 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 -> 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e [2024-11-19 19:09:21,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 19:09:22,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 19:09:22,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 19:09:22,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 19:09:22,033 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 19:09:22,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-19 19:09:23,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 19:09:23,609 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 19:09:23,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-19 19:09:23,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4858a3ec5/b009f64f6436447dab34de6d22fe713b/FLAG3e3d9c234 [2024-11-19 19:09:23,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4858a3ec5/b009f64f6436447dab34de6d22fe713b [2024-11-19 19:09:23,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 19:09:24,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 19:09:24,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 19:09:24,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 19:09:24,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 19:09:24,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:09:23" (1/1) ... [2024-11-19 19:09:24,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c26a551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24, skipping insertion in model container [2024-11-19 19:09:24,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:09:23" (1/1) ... [2024-11-19 19:09:24,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 19:09:24,187 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/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-19 19:09:24,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:09:24,210 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 19:09:24,224 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/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-19 19:09:24,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 19:09:24,246 INFO L204 MainTranslator]: Completed translation [2024-11-19 19:09:24,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24 WrapperNode [2024-11-19 19:09:24,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 19:09:24,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 19:09:24,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 19:09:24,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 19:09:24,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24" (1/1) ... [2024-11-19 19:09:24,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24" (1/1) ... [2024-11-19 19:09:24,273 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2024-11-19 19:09:24,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 19:09:24,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 19:09:24,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 19:09:24,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 19:09:24,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24" (1/1) ... [2024-11-19 19:09:24,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24" (1/1) ... [2024-11-19 19:09:24,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24" (1/1) ... [2024-11-19 19:09:24,295 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-19 19:09:24,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24" (1/1) ... [2024-11-19 19:09:24,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24" (1/1) ... [2024-11-19 19:09:24,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24" (1/1) ... [2024-11-19 19:09:24,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24" (1/1) ... [2024-11-19 19:09:24,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24" (1/1) ... [2024-11-19 19:09:24,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24" (1/1) ... [2024-11-19 19:09:24,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 19:09:24,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 19:09:24,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 19:09:24,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 19:09:24,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24" (1/1) ... [2024-11-19 19:09:24,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 19:09:24,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 19:09:24,351 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-19 19:09:24,359 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-19 19:09:24,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 19:09:24,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 19:09:24,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 19:09:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 19:09:24,455 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 19:09:24,457 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 19:09:25,316 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-19 19:09:25,316 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 19:09:25,325 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 19:09:25,326 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 19:09:25,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:09:25 BoogieIcfgContainer [2024-11-19 19:09:25,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 19:09:25,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 19:09:25,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 19:09:25,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 19:09:25,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:09:23" (1/3) ... [2024-11-19 19:09:25,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ad5970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:09:25, skipping insertion in model container [2024-11-19 19:09:25,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:24" (2/3) ... [2024-11-19 19:09:25,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ad5970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:09:25, skipping insertion in model container [2024-11-19 19:09:25,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:09:25" (3/3) ... [2024-11-19 19:09:25,338 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.p+cfa-reducer.c [2024-11-19 19:09:25,351 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 19:09:25,352 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 19:09:25,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 19:09:25,397 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;@2c7fc0e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 19:09:25,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 19:09:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:09:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 19:09:25,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:09:25,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:09:25,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:09:25,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:09:25,410 INFO L85 PathProgramCache]: Analyzing trace with hash -34829450, now seen corresponding path program 1 times [2024-11-19 19:09:25,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:09:25,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322543905] [2024-11-19 19:09:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:09:25,420 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-19 19:09:25,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:09:25,423 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-19 19:09:25,424 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-19 19:09:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:09:25,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 19:09:25,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:09:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:09:25,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:09:25,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:09:25,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322543905] [2024-11-19 19:09:25,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322543905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:09:25,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:09:25,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 19:09:25,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948199597] [2024-11-19 19:09:25,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:09:25,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 19:09:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:09:25,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 19:09:25,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:09:25,641 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:09:25,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:09:25,670 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2024-11-19 19:09:25,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 19:09:25,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 19:09:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:09:25,678 INFO L225 Difference]: With dead ends: 31 [2024-11-19 19:09:25,678 INFO L226 Difference]: Without dead ends: 23 [2024-11-19 19:09:25,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 19:09:25,683 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:09:25,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:09:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-19 19:09:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-19 19:09:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:09:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-19 19:09:25,708 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2024-11-19 19:09:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:09:25,708 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-19 19:09:25,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:09:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-19 19:09:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 19:09:25,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:09:25,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:09:25,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 19:09:25,914 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-19 19:09:25,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:09:25,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:09:25,916 INFO L85 PathProgramCache]: Analyzing trace with hash -17818789, now seen corresponding path program 1 times [2024-11-19 19:09:25,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:09:25,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634611007] [2024-11-19 19:09:25,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:09:25,916 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-19 19:09:25,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:09:25,920 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-19 19:09:25,921 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-19 19:09:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:09:26,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 19:09:26,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:09:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:09:33,016 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:09:33,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:09:33,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634611007] [2024-11-19 19:09:33,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634611007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:09:33,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:09:33,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 19:09:33,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941089138] [2024-11-19 19:09:33,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:09:33,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 19:09:33,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:09:33,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 19:09:33,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 19:09:33,019 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:09:36,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 19:09:40,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 19:09:43,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 19:09:45,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 19:09:50,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 19:09:53,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 19:09:55,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 19:09:58,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-19 19:09:58,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:09:58,268 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2024-11-19 19:09:58,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 19:09:58,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 19:09:58,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:09:58,275 INFO L225 Difference]: With dead ends: 75 [2024-11-19 19:09:58,275 INFO L226 Difference]: Without dead ends: 54 [2024-11-19 19:09:58,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 19:09:58,276 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2024-11-19 19:09:58,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 52 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 25.2s Time] [2024-11-19 19:09:58,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-19 19:09:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2024-11-19 19:09:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:09:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2024-11-19 19:09:58,286 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 16 [2024-11-19 19:09:58,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:09:58,286 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2024-11-19 19:09:58,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:09:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2024-11-19 19:09:58,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 19:09:58,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:09:58,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:09:58,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 19:09:58,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:09:58,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:09:58,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:09:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1271663018, now seen corresponding path program 1 times [2024-11-19 19:09:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:09:58,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964468812] [2024-11-19 19:09:58,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:09:58,489 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-19 19:09:58,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:09:58,493 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 19:09:58,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 19:09:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:09:58,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 19:09:58,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:09:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:09:58,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:09:58,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:09:58,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964468812] [2024-11-19 19:09:58,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964468812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:09:58,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:09:58,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 19:09:58,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617382015] [2024-11-19 19:09:58,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:09:58,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 19:09:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:09:58,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 19:09:58,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 19:09:58,580 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:09:58,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:09:58,698 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-11-19 19:09:58,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 19:09:58,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 19:09:58,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:09:58,705 INFO L225 Difference]: With dead ends: 56 [2024-11-19 19:09:58,705 INFO L226 Difference]: Without dead ends: 33 [2024-11-19 19:09:58,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 19:09:58,706 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 19:09:58,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 19:09:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-19 19:09:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-19 19:09:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:09:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-19 19:09:58,713 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 16 [2024-11-19 19:09:58,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:09:58,714 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-19 19:09:58,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:09:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-19 19:09:58,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 19:09:58,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:09:58,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:09:58,721 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 (4)] Ended with exit code 0 [2024-11-19 19:09:58,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 19:09:58,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:09:58,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:09:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1069421883, now seen corresponding path program 1 times [2024-11-19 19:09:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:09:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048179227] [2024-11-19 19:09:58,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:09:58,925 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-19 19:09:58,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:09:58,931 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-19 19:09:58,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 (5)] Waiting until timeout for monitored process [2024-11-19 19:09:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:09:59,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 19:09:59,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:10:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:10:02,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:10:02,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:10:02,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048179227] [2024-11-19 19:10:02,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048179227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:10:02,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:10:02,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 19:10:02,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925387852] [2024-11-19 19:10:02,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:10:02,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 19:10:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:10:02,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 19:10:02,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 19:10:02,253 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:10:10,510 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2024-11-19 19:10:10,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 19:10:10,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 19:10:10,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:10:10,522 INFO L225 Difference]: With dead ends: 72 [2024-11-19 19:10:10,522 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 19:10:10,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 19:10:10,523 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-19 19:10:10,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 62 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-19 19:10:10,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 19:10:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34. [2024-11-19 19:10:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-19 19:10:10,529 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 17 [2024-11-19 19:10:10,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:10:10,529 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-19 19:10:10,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-19 19:10:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 19:10:10,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:10:10,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:10:10,539 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 (5)] Forceful destruction successful, exit code 0 [2024-11-19 19:10:10,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-19 19:10:10,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:10:10,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:10:10,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1450538051, now seen corresponding path program 1 times [2024-11-19 19:10:10,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:10:10,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118414214] [2024-11-19 19:10:10,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:10:10,734 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-19 19:10:10,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:10:10,736 INFO L229 MonitoredProcess]: Starting monitored process 6 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-19 19:10:10,737 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 (6)] Waiting until timeout for monitored process [2024-11-19 19:10:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:10:10,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 19:10:10,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:10:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:10:13,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:10:13,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:10:13,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118414214] [2024-11-19 19:10:13,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118414214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:10:13,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:10:13,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 19:10:13,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209053169] [2024-11-19 19:10:13,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:10:13,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 19:10:13,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:10:13,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 19:10:13,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 19:10:13,816 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:10:25,644 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2024-11-19 19:10:25,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 19:10:25,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 19:10:25,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:10:25,656 INFO L225 Difference]: With dead ends: 98 [2024-11-19 19:10:25,656 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 19:10:25,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 19:10:25,657 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-19 19:10:25,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 61 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-19 19:10:25,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 19:10:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2024-11-19 19:10:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-19 19:10:25,661 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 17 [2024-11-19 19:10:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:10:25,661 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-19 19:10:25,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-11-19 19:10:25,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 19:10:25,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:10:25,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:10:25,666 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 (6)] Ended with exit code 0 [2024-11-19 19:10:25,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-19 19:10:25,863 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:10:25,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:10:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1069229389, now seen corresponding path program 1 times [2024-11-19 19:10:25,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:10:25,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129270185] [2024-11-19 19:10:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:10:25,864 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-19 19:10:25,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:10:25,866 INFO L229 MonitoredProcess]: Starting monitored process 7 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-19 19:10:25,867 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 (7)] Waiting until timeout for monitored process [2024-11-19 19:10:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:10:25,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 19:10:25,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:10:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:10:31,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:10:31,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:10:31,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129270185] [2024-11-19 19:10:31,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129270185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:10:31,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:10:31,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 19:10:31,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286455830] [2024-11-19 19:10:31,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:10:31,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 19:10:31,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:10:31,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 19:10:31,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-19 19:10:31,640 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:10:39,208 INFO L93 Difference]: Finished difference Result 95 states and 120 transitions. [2024-11-19 19:10:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 19:10:39,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 19:10:39,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:10:39,220 INFO L225 Difference]: With dead ends: 95 [2024-11-19 19:10:39,220 INFO L226 Difference]: Without dead ends: 66 [2024-11-19 19:10:39,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-19 19:10:39,221 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-19 19:10:39,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 40 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-19 19:10:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-19 19:10:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 49. [2024-11-19 19:10:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:39,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-19 19:10:39,225 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 17 [2024-11-19 19:10:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:10:39,225 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-19 19:10:39,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-11-19 19:10:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 19:10:39,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:10:39,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:10:39,232 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 (7)] Forceful destruction successful, exit code 0 [2024-11-19 19:10:39,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-19 19:10:39,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:10:39,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:10:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1175383176, now seen corresponding path program 1 times [2024-11-19 19:10:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:10:39,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045510938] [2024-11-19 19:10:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:10:39,431 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-19 19:10:39,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:10:39,432 INFO L229 MonitoredProcess]: Starting monitored process 8 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-19 19:10:39,434 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 (8)] Waiting until timeout for monitored process [2024-11-19 19:10:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:10:39,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 19:10:39,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:10:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:10:39,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:10:39,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:10:39,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045510938] [2024-11-19 19:10:39,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045510938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:10:39,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:10:39,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 19:10:39,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989056984] [2024-11-19 19:10:39,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:10:39,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 19:10:39,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:10:39,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 19:10:39,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 19:10:39,494 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:39,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:10:39,543 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2024-11-19 19:10:39,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 19:10:39,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 19:10:39,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:10:39,545 INFO L225 Difference]: With dead ends: 75 [2024-11-19 19:10:39,545 INFO L226 Difference]: Without dead ends: 35 [2024-11-19 19:10:39,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 19:10:39,546 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 19:10:39,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 19:10:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-19 19:10:39,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-19 19:10:39,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-19 19:10:39,554 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2024-11-19 19:10:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:10:39,554 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-19 19:10:39,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-19 19:10:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 19:10:39,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:10:39,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:10:39,559 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 (8)] Ended with exit code 0 [2024-11-19 19:10:39,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-19 19:10:39,756 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:10:39,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:10:39,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1724506925, now seen corresponding path program 1 times [2024-11-19 19:10:39,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:10:39,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746629768] [2024-11-19 19:10:39,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:10:39,757 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-19 19:10:39,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:10:39,761 INFO L229 MonitoredProcess]: Starting monitored process 9 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-19 19:10:39,762 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 (9)] Waiting until timeout for monitored process [2024-11-19 19:10:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:10:39,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 19:10:39,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 19:10:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 19:10:43,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 19:10:43,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 19:10:43,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746629768] [2024-11-19 19:10:43,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746629768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 19:10:43,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 19:10:43,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 19:10:43,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246419098] [2024-11-19 19:10:43,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 19:10:43,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 19:10:43,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 19:10:43,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 19:10:43,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-19 19:10:43,918 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 19:10:49,644 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2024-11-19 19:10:49,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 19:10:49,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 19:10:49,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 19:10:49,649 INFO L225 Difference]: With dead ends: 67 [2024-11-19 19:10:49,649 INFO L226 Difference]: Without dead ends: 45 [2024-11-19 19:10:49,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-19 19:10:49,650 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-19 19:10:49,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 39 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-19 19:10:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-19 19:10:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2024-11-19 19:10:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-19 19:10:49,658 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 18 [2024-11-19 19:10:49,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 19:10:49,658 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-19 19:10:49,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 19:10:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-19 19:10:49,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 19:10:49,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 19:10:49,658 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 19:10:49,666 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 (9)] Ended with exit code 0 [2024-11-19 19:10:49,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-19 19:10:49,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 19:10:49,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 19:10:49,860 INFO L85 PathProgramCache]: Analyzing trace with hash -66815887, now seen corresponding path program 1 times [2024-11-19 19:10:49,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 19:10:49,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461937884] [2024-11-19 19:10:49,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 19:10:49,860 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-19 19:10:49,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 19:10:49,862 INFO L229 MonitoredProcess]: Starting monitored process 10 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-19 19:10:49,864 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 (10)] Waiting until timeout for monitored process [2024-11-19 19:10:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 19:10:50,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 19:10:50,035 INFO L278 TraceCheckSpWp]: Computing forward predicates...