./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-cbmc-regression/float18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-cbmc-regression/float18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a81fa1bd0a3b8841e651932cc73584f5a646612c64d8453e7e96316c7083da49 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 12:12:26,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:12:26,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 12:12:26,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:12:26,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:12:26,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:12:26,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:12:26,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:12:26,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:12:26,700 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:12:26,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:12:26,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:12:26,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:12:26,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:12:26,704 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:12:26,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:12:26,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:12:26,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:12:26,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:12:26,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:12:26,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:12:26,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:12:26,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:12:26,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:12:26,707 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:12:26,708 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:12:26,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:12:26,708 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:12:26,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:12:26,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:12:26,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:12:26,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:12:26,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:12:26,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:12:26,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:12:26,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:12:26,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:12:26,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:12:26,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:12:26,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:12:26,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:12:26,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:12:26,714 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 -> a81fa1bd0a3b8841e651932cc73584f5a646612c64d8453e7e96316c7083da49 [2024-11-08 12:12:26,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:12:27,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:12:27,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:12:27,020 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:12:27,021 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:12:27,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float18.i [2024-11-08 12:12:28,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:12:28,842 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:12:28,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float18.i [2024-11-08 12:12:28,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/296bb2785/4955a43a74da49e8adba5f836ea70862/FLAGace2f3df0 [2024-11-08 12:12:28,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/296bb2785/4955a43a74da49e8adba5f836ea70862 [2024-11-08 12:12:28,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:12:28,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:12:28,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:12:28,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:12:28,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:12:28,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:12:28" (1/1) ... [2024-11-08 12:12:28,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d02285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:28, skipping insertion in model container [2024-11-08 12:12:28,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:12:28" (1/1) ... [2024-11-08 12:12:28,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:12:29,465 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/floats-cbmc-regression/float18.i[40835,40848] [2024-11-08 12:12:29,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:12:29,478 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:12:29,540 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/floats-cbmc-regression/float18.i[40835,40848] [2024-11-08 12:12:29,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:12:29,638 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:12:29,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:29 WrapperNode [2024-11-08 12:12:29,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:12:29,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:12:29,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:12:29,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:12:29,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:29" (1/1) ... [2024-11-08 12:12:29,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:29" (1/1) ... [2024-11-08 12:12:29,697 INFO L138 Inliner]: procedures = 446, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2024-11-08 12:12:29,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:12:29,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:12:29,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:12:29,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:12:29,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:29" (1/1) ... [2024-11-08 12:12:29,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:29" (1/1) ... [2024-11-08 12:12:29,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:29" (1/1) ... [2024-11-08 12:12:29,723 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-08 12:12:29,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:29" (1/1) ... [2024-11-08 12:12:29,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:29" (1/1) ... [2024-11-08 12:12:29,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:29" (1/1) ... [2024-11-08 12:12:29,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:29" (1/1) ... [2024-11-08 12:12:29,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:29" (1/1) ... [2024-11-08 12:12:29,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:29" (1/1) ... [2024-11-08 12:12:29,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:12:29,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:12:29,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:12:29,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:12:29,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:29" (1/1) ... [2024-11-08 12:12:29,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:12:29,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:12:29,773 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-08 12:12:29,776 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-08 12:12:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:12:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:12:29,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:12:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 12:12:29,918 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:12:29,919 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:12:29,971 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-08 12:12:29,972 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:12:29,983 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:12:29,983 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 12:12:29,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:12:29 BoogieIcfgContainer [2024-11-08 12:12:29,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:12:29,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:12:29,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:12:29,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:12:29,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:12:28" (1/3) ... [2024-11-08 12:12:29,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4215d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:12:29, skipping insertion in model container [2024-11-08 12:12:29,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:29" (2/3) ... [2024-11-08 12:12:29,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4215d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:12:29, skipping insertion in model container [2024-11-08 12:12:29,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:12:29" (3/3) ... [2024-11-08 12:12:29,992 INFO L112 eAbstractionObserver]: Analyzing ICFG float18.i [2024-11-08 12:12:30,010 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:12:30,010 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:12:30,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:12:30,066 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;@e76740c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:12:30,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:12:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 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-08 12:12:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 12:12:30,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:12:30,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 12:12:30,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:12:30,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:30,086 INFO L85 PathProgramCache]: Analyzing trace with hash 28702764, now seen corresponding path program 1 times [2024-11-08 12:12:30,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:30,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856205598] [2024-11-08 12:12:30,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:30,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:30,253 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-08 12:12:30,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:30,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856205598] [2024-11-08 12:12:30,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856205598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:12:30,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:12:30,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:12:30,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786304528] [2024-11-08 12:12:30,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:12:30,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:12:30,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:30,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:12:30,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:12:30,294 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-08 12:12:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:12:30,307 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-08 12:12:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:12:30,309 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-11-08 12:12:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:12:30,316 INFO L225 Difference]: With dead ends: 16 [2024-11-08 12:12:30,317 INFO L226 Difference]: Without dead ends: 7 [2024-11-08 12:12:30,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:12:30,325 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:12:30,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:12:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2024-11-08 12:12:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-11-08 12:12:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-08 12:12:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2024-11-08 12:12:30,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2024-11-08 12:12:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:12:30,356 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2024-11-08 12:12:30,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-08 12:12:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2024-11-08 12:12:30,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 12:12:30,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:12:30,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 12:12:30,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:12:30,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:12:30,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:30,359 INFO L85 PathProgramCache]: Analyzing trace with hash 889539656, now seen corresponding path program 1 times [2024-11-08 12:12:30,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:30,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744674069] [2024-11-08 12:12:30,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:30,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:30,495 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-08 12:12:30,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:30,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744674069] [2024-11-08 12:12:30,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744674069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:12:30,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:12:30,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:12:30,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844790302] [2024-11-08 12:12:30,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:12:30,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:12:30,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:30,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:12:30,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:12:30,499 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-08 12:12:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:12:30,521 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-11-08 12:12:30,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:12:30,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-08 12:12:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:12:30,523 INFO L225 Difference]: With dead ends: 13 [2024-11-08 12:12:30,523 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 12:12:30,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:12:30,524 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:12:30,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:12:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 12:12:30,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 12:12:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-08 12:12:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 12:12:30,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2024-11-08 12:12:30,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:12:30,530 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 12:12:30,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-08 12:12:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 12:12:30,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 12:12:30,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:12:30,531 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 12:12:30,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 12:12:30,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:12:30,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:30,535 INFO L85 PathProgramCache]: Analyzing trace with hash 150598990, now seen corresponding path program 1 times [2024-11-08 12:12:30,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:30,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660851359] [2024-11-08 12:12:30,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:30,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:30,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:30,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:30,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660851359] [2024-11-08 12:12:30,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660851359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:12:30,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162908144] [2024-11-08 12:12:30,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:30,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:12:30,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:12:30,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:12:30,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 12:12:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:30,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 12:12:30,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:12:30,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:30,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:12:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:30,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162908144] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:12:30,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:12:30,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-08 12:12:30,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267386592] [2024-11-08 12:12:30,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:12:30,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 12:12:30,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:30,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 12:12:30,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-08 12:12:30,808 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-08 12:12:30,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:12:30,832 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-11-08 12:12:30,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:12:30,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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 8 [2024-11-08 12:12:30,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:12:30,834 INFO L225 Difference]: With dead ends: 24 [2024-11-08 12:12:30,834 INFO L226 Difference]: Without dead ends: 18 [2024-11-08 12:12:30,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-08 12:12:30,836 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:12:30,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:12:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-08 12:12:30,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-08 12:12:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 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-08 12:12:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-11-08 12:12:30,841 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 8 [2024-11-08 12:12:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:12:30,842 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-11-08 12:12:30,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 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-08 12:12:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-11-08 12:12:30,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 12:12:30,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:12:30,843 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2024-11-08 12:12:30,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 12:12:31,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:12:31,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:12:31,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:31,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1216526950, now seen corresponding path program 2 times [2024-11-08 12:12:31,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:31,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059685657] [2024-11-08 12:12:31,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:31,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:31,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:31,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059685657] [2024-11-08 12:12:31,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059685657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:12:31,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171660546] [2024-11-08 12:12:31,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:12:31,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:12:31,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:12:31,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:12:31,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 12:12:31,281 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 12:12:31,281 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:12:31,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 12:12:31,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:12:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:31,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:12:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:31,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171660546] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:12:31,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:12:31,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-11-08 12:12:31,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925513595] [2024-11-08 12:12:31,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:12:31,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 12:12:31,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:31,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 12:12:31,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2024-11-08 12:12:31,477 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 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-08 12:12:31,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:12:31,512 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-11-08 12:12:31,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 12:12:31,513 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 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-08 12:12:31,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:12:31,514 INFO L225 Difference]: With dead ends: 35 [2024-11-08 12:12:31,514 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 12:12:31,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2024-11-08 12:12:31,515 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:12:31,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 33 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:12:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 12:12:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-08 12:12:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-08 12:12:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-08 12:12:31,529 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 16 [2024-11-08 12:12:31,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:12:31,529 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-08 12:12:31,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 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-08 12:12:31,530 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-08 12:12:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 12:12:31,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:12:31,532 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2024-11-08 12:12:31,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 12:12:31,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 12:12:31,737 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:12:31,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:31,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1688495356, now seen corresponding path program 3 times [2024-11-08 12:12:31,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:31,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589159856] [2024-11-08 12:12:31,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:31,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:12:31,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:12:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:12:31,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:12:31,806 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:12:31,807 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 12:12:31,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 12:12:31,812 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-11-08 12:12:31,836 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 12:12:31,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 12:12:31 BoogieIcfgContainer [2024-11-08 12:12:31,840 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 12:12:31,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 12:12:31,842 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 12:12:31,842 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 12:12:31,842 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:12:29" (3/4) ... [2024-11-08 12:12:31,845 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 12:12:31,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 12:12:31,847 INFO L158 Benchmark]: Toolchain (without parser) took 2965.36ms. Allocated memory was 136.3MB in the beginning and 184.5MB in the end (delta: 48.2MB). Free memory was 80.3MB in the beginning and 106.5MB in the end (delta: -26.3MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2024-11-08 12:12:31,847 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 136.3MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:12:31,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 757.11ms. Allocated memory is still 136.3MB. Free memory was 80.0MB in the beginning and 76.2MB in the end (delta: 3.8MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-11-08 12:12:31,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.19ms. Allocated memory is still 136.3MB. Free memory was 76.2MB in the beginning and 74.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:12:31,847 INFO L158 Benchmark]: Boogie Preprocessor took 39.06ms. Allocated memory is still 136.3MB. Free memory was 74.2MB in the beginning and 72.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:12:31,848 INFO L158 Benchmark]: RCFGBuilder took 244.17ms. Allocated memory is still 136.3MB. Free memory was 72.7MB in the beginning and 63.0MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 12:12:31,848 INFO L158 Benchmark]: TraceAbstraction took 1854.37ms. Allocated memory was 136.3MB in the beginning and 184.5MB in the end (delta: 48.2MB). Free memory was 62.2MB in the beginning and 106.5MB in the end (delta: -44.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-08 12:12:31,848 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 184.5MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:12:31,850 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.24ms. Allocated memory is still 136.3MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 757.11ms. Allocated memory is still 136.3MB. Free memory was 80.0MB in the beginning and 76.2MB in the end (delta: 3.8MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.19ms. Allocated memory is still 136.3MB. Free memory was 76.2MB in the beginning and 74.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.06ms. Allocated memory is still 136.3MB. Free memory was 74.2MB in the beginning and 72.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 244.17ms. Allocated memory is still 136.3MB. Free memory was 72.7MB in the beginning and 63.0MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1854.37ms. Allocated memory was 136.3MB in the beginning and 184.5MB in the end (delta: 48.2MB). Free memory was 62.2MB in the beginning and 106.5MB in the end (delta: -44.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 184.5MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 979]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 977, overapproximation of someBinaryArithmeticDOUBLEoperation at line 974. Possible FailurePath: [L968] double s, f=0.0, fStep=0.1*3.14159265358979323846; [L969] int n=0; VAL [n=0] [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=1] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=1] [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=2] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=2] [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=3] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=3] [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=4] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=4] [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=5] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=5] [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=6] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=6] [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=7] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=7] [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=8] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=8] [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=9] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=9] [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=10] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=10] [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=11] [L977] COND FALSE !(f < 3.14159265358979323846) VAL [n=11] [L979] COND TRUE !( n < 11 ) [L979] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 5, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 28 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, InterpolantAutomatonStates: 27, 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, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 86 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/96 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-08 12:12:31,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-cbmc-regression/float18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a81fa1bd0a3b8841e651932cc73584f5a646612c64d8453e7e96316c7083da49 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 12:12:34,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:12:34,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 12:12:34,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:12:34,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:12:34,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:12:34,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:12:34,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:12:34,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:12:34,191 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:12:34,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:12:34,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:12:34,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:12:34,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:12:34,198 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:12:34,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:12:34,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:12:34,199 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:12:34,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:12:34,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:12:34,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:12:34,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:12:34,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:12:34,204 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 12:12:34,204 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 12:12:34,204 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:12:34,204 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 12:12:34,205 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:12:34,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:12:34,205 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:12:34,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:12:34,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:12:34,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:12:34,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:12:34,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:12:34,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:12:34,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:12:34,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:12:34,209 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 12:12:34,209 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 12:12:34,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:12:34,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:12:34,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:12:34,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:12:34,212 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 -> a81fa1bd0a3b8841e651932cc73584f5a646612c64d8453e7e96316c7083da49 [2024-11-08 12:12:34,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:12:34,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:12:34,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:12:34,559 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:12:34,560 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:12:34,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float18.i [2024-11-08 12:12:35,962 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:12:36,259 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:12:36,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float18.i [2024-11-08 12:12:36,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2bab612b/caee03acc3804a518a297787627869b0/FLAG09b30d76a [2024-11-08 12:12:36,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2bab612b/caee03acc3804a518a297787627869b0 [2024-11-08 12:12:36,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:12:36,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:12:36,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:12:36,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:12:36,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:12:36,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:12:36" (1/1) ... [2024-11-08 12:12:36,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788c228c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:36, skipping insertion in model container [2024-11-08 12:12:36,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:12:36" (1/1) ... [2024-11-08 12:12:36,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:12:36,860 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/floats-cbmc-regression/float18.i[40835,40848] [2024-11-08 12:12:36,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:12:36,876 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:12:36,906 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/floats-cbmc-regression/float18.i[40835,40848] [2024-11-08 12:12:36,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:12:37,030 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:12:37,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:37 WrapperNode [2024-11-08 12:12:37,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:12:37,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:12:37,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:12:37,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:12:37,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:37" (1/1) ... [2024-11-08 12:12:37,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:37" (1/1) ... [2024-11-08 12:12:37,088 INFO L138 Inliner]: procedures = 447, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2024-11-08 12:12:37,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:12:37,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:12:37,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:12:37,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:12:37,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:37" (1/1) ... [2024-11-08 12:12:37,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:37" (1/1) ... [2024-11-08 12:12:37,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:37" (1/1) ... [2024-11-08 12:12:37,113 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-08 12:12:37,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:37" (1/1) ... [2024-11-08 12:12:37,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:37" (1/1) ... [2024-11-08 12:12:37,118 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:37" (1/1) ... [2024-11-08 12:12:37,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:37" (1/1) ... [2024-11-08 12:12:37,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:37" (1/1) ... [2024-11-08 12:12:37,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:37" (1/1) ... [2024-11-08 12:12:37,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:12:37,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:12:37,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:12:37,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:12:37,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:37" (1/1) ... [2024-11-08 12:12:37,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:12:37,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:12:37,163 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-08 12:12:37,169 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-08 12:12:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 12:12:37,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:12:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:12:37,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:12:37,304 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:12:37,306 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:12:37,878 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-08 12:12:37,881 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:12:37,892 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:12:37,892 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 12:12:37,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:12:37 BoogieIcfgContainer [2024-11-08 12:12:37,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:12:37,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:12:37,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:12:37,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:12:37,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:12:36" (1/3) ... [2024-11-08 12:12:37,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e2f32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:12:37, skipping insertion in model container [2024-11-08 12:12:37,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:37" (2/3) ... [2024-11-08 12:12:37,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e2f32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:12:37, skipping insertion in model container [2024-11-08 12:12:37,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:12:37" (3/3) ... [2024-11-08 12:12:37,902 INFO L112 eAbstractionObserver]: Analyzing ICFG float18.i [2024-11-08 12:12:37,920 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:12:37,920 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:12:37,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:12:37,987 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;@4e41234e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:12:37,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:12:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 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-08 12:12:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 12:12:37,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:12:38,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 12:12:38,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:12:38,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:38,010 INFO L85 PathProgramCache]: Analyzing trace with hash 28702764, now seen corresponding path program 1 times [2024-11-08 12:12:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:12:38,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154155204] [2024-11-08 12:12:38,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:38,022 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-08 12:12:38,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:12:38,026 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-08 12:12:38,027 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-08 12:12:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:38,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 12:12:38,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:12:38,299 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-08 12:12:38,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:12:38,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:12:38,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154155204] [2024-11-08 12:12:38,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154155204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:12:38,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:12:38,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:12:38,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793152392] [2024-11-08 12:12:38,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:12:38,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:12:38,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:12:38,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:12:38,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:12:38,331 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-08 12:12:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:12:38,342 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-08 12:12:38,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:12:38,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2024-11-08 12:12:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:12:38,351 INFO L225 Difference]: With dead ends: 16 [2024-11-08 12:12:38,351 INFO L226 Difference]: Without dead ends: 7 [2024-11-08 12:12:38,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:12:38,358 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:12:38,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:12:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2024-11-08 12:12:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-11-08 12:12:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-08 12:12:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2024-11-08 12:12:38,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2024-11-08 12:12:38,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:12:38,387 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2024-11-08 12:12:38,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-08 12:12:38,388 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2024-11-08 12:12:38,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 12:12:38,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:12:38,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 12:12:38,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 12:12:38,589 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-08 12:12:38,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:12:38,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash 889539656, now seen corresponding path program 1 times [2024-11-08 12:12:38,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:12:38,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600884283] [2024-11-08 12:12:38,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:38,592 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-08 12:12:38,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:12:38,596 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-08 12:12:38,597 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-08 12:12:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:38,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 12:12:38,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:12:39,841 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-08 12:12:39,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:12:39,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:12:39,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600884283] [2024-11-08 12:12:39,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600884283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:12:39,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:12:39,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:12:39,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288858914] [2024-11-08 12:12:39,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:12:39,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:12:39,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:12:39,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:12:39,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:12:39,844 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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-08 12:12:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:12:40,191 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-11-08 12:12:40,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:12:40,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-08 12:12:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:12:40,193 INFO L225 Difference]: With dead ends: 13 [2024-11-08 12:12:40,193 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 12:12:40,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:12:40,195 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:12:40,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 7 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 12:12:40,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 12:12:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 12:12:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-08 12:12:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 12:12:40,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2024-11-08 12:12:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:12:40,202 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 12:12:40,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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-08 12:12:40,202 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 12:12:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 12:12:40,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:12:40,204 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 12:12:40,216 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-08 12:12:40,404 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-08 12:12:40,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:12:40,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:40,406 INFO L85 PathProgramCache]: Analyzing trace with hash 150598990, now seen corresponding path program 1 times [2024-11-08 12:12:40,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:12:40,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923000691] [2024-11-08 12:12:40,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:40,407 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-08 12:12:40,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:12:40,410 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-08 12:12:40,411 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-08 12:12:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:40,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 12:12:40,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:12:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:43,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:12:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:58,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:12:58,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923000691] [2024-11-08 12:12:58,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923000691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:12:58,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:12:58,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-08 12:12:58,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024741072] [2024-11-08 12:12:58,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:12:58,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 12:12:58,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:12:58,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 12:12:58,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 12:12:58,551 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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-08 12:13:19,703 WARN L286 SmtUtils]: Spent 13.82s on a formula simplification. DAG size of input: 19 DAG size of output: 18 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 12:13:23,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:13:34,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:13:38,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:13:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:13:41,686 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-11-08 12:13:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 12:13:41,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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 8 [2024-11-08 12:13:41,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:13:41,688 INFO L225 Difference]: With dead ends: 18 [2024-11-08 12:13:41,688 INFO L226 Difference]: Without dead ends: 15 [2024-11-08 12:13:41,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=48, Invalid=83, Unknown=1, NotChecked=0, Total=132 [2024-11-08 12:13:41,690 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-11-08 12:13:41,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2024-11-08 12:13:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-08 12:13:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-08 12:13:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-08 12:13:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-08 12:13:41,694 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-08 12:13:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:13:41,695 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-08 12:13:41,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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-08 12:13:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-08 12:13:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 12:13:41,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:13:41,696 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2024-11-08 12:13:41,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 12:13:41,897 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-08 12:13:41,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:13:41,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:13:41,898 INFO L85 PathProgramCache]: Analyzing trace with hash 28079968, now seen corresponding path program 2 times [2024-11-08 12:13:41,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:13:41,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757674396] [2024-11-08 12:13:41,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:13:41,899 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-08 12:13:41,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:13:41,902 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-08 12:13:41,903 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-08 12:13:42,335 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 12:13:42,335 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:13:42,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 12:13:42,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:13:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:42,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:13:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:43,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:13:43,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757674396] [2024-11-08 12:13:43,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757674396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:13:43,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:13:43,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-08 12:13:43,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560734321] [2024-11-08 12:13:43,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:13:43,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 12:13:43,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:13:43,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 12:13:43,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-08 12:13:43,455 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-08 12:13:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:13:46,041 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-11-08 12:13:46,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 12:13:46,042 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 14 [2024-11-08 12:13:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:13:46,043 INFO L225 Difference]: With dead ends: 36 [2024-11-08 12:13:46,043 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 12:13:46,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2024-11-08 12:13:46,046 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:13:46,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 66 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 12:13:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 12:13:46,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-08 12:13:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-08 12:13:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-08 12:13:46,060 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-08 12:13:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:13:46,062 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-08 12:13:46,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-08 12:13:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-08 12:13:46,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 12:13:46,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:13:46,064 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2024-11-08 12:13:46,093 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 (5)] Ended with exit code 0 [2024-11-08 12:13:46,264 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-08 12:13:46,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:13:46,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:13:46,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1688495356, now seen corresponding path program 3 times [2024-11-08 12:13:46,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:13:46,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895439915] [2024-11-08 12:13:46,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 12:13:46,266 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-08 12:13:46,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:13:46,267 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-08 12:13:46,268 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-08 12:13:47,447 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-08 12:13:47,447 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:13:47,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 12:13:47,478 INFO L278 TraceCheckSpWp]: Computing forward predicates...