./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/Muller_Kahan.c --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/float-benchs/Muller_Kahan.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 12:12:52,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:12:52,970 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:52,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:12:52,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:12:53,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:12:53,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:12:53,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:12:53,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:12:53,003 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:12:53,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:12:53,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:12:53,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:12:53,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:12:53,008 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:12:53,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:12:53,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:12:53,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:12:53,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:12:53,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:12:53,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:12:53,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:12:53,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:12:53,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:12:53,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:12:53,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:12:53,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:12:53,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:12:53,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:12:53,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:12:53,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:12:53,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:12:53,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:12:53,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:12:53,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:12:53,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:12:53,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:12:53,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:12:53,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:12:53,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:12:53,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:12:53,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:12:53,015 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 -> 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 [2024-11-08 12:12:53,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:12:53,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:12:53,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:12:53,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:12:53,245 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:12:53,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/Muller_Kahan.c [2024-11-08 12:12:54,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:12:54,661 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:12:54,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2024-11-08 12:12:54,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5deb76488/50a5c4347cb747a599937a1f51c12195/FLAGc82236bad [2024-11-08 12:12:54,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5deb76488/50a5c4347cb747a599937a1f51c12195 [2024-11-08 12:12:54,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:12:54,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:12:54,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:12:54,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:12:54,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:12:54,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:12:54" (1/1) ... [2024-11-08 12:12:54,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6743d328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:54, skipping insertion in model container [2024-11-08 12:12:54,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:12:54" (1/1) ... [2024-11-08 12:12:54,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:12:54,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c[631,644] [2024-11-08 12:12:54,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:12:54,860 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:12:54,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c[631,644] [2024-11-08 12:12:54,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:12:54,885 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:12:54,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:54 WrapperNode [2024-11-08 12:12:54,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:12:54,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:12:54,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:12:54,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:12:54,895 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:54" (1/1) ... [2024-11-08 12:12:54,901 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:54" (1/1) ... [2024-11-08 12:12:54,913 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2024-11-08 12:12:54,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:12:54,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:12:54,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:12:54,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:12:54,922 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:54" (1/1) ... [2024-11-08 12:12:54,922 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:54" (1/1) ... [2024-11-08 12:12:54,923 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:54" (1/1) ... [2024-11-08 12:12:54,933 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:54,933 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:54" (1/1) ... [2024-11-08 12:12:54,934 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:54" (1/1) ... [2024-11-08 12:12:54,940 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:54" (1/1) ... [2024-11-08 12:12:54,942 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:54" (1/1) ... [2024-11-08 12:12:54,944 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:54" (1/1) ... [2024-11-08 12:12:54,945 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:54" (1/1) ... [2024-11-08 12:12:54,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:12:54,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:12:54,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:12:54,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:12:54,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:54" (1/1) ... [2024-11-08 12:12:54,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:12:54,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:12:54,983 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:54,986 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:55,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:12:55,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:12:55,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:12:55,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 12:12:55,101 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:12:55,103 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:12:55,174 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 12:12:55,174 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:12:55,185 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:12:55,186 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 12:12:55,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:12:55 BoogieIcfgContainer [2024-11-08 12:12:55,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:12:55,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:12:55,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:12:55,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:12:55,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:12:54" (1/3) ... [2024-11-08 12:12:55,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195f6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:12:55, skipping insertion in model container [2024-11-08 12:12:55,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:54" (2/3) ... [2024-11-08 12:12:55,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195f6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:12:55, skipping insertion in model container [2024-11-08 12:12:55,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:12:55" (3/3) ... [2024-11-08 12:12:55,218 INFO L112 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c [2024-11-08 12:12:55,253 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:12:55,253 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:12:55,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:12:55,296 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;@40b69925, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:12:55,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:12:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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:12:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 12:12:55,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:12:55,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 12:12:55,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:12:55,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:55,308 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2024-11-08 12:12:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:55,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745726254] [2024-11-08 12:12:55,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:55,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:55,433 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:55,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:55,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745726254] [2024-11-08 12:12:55,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745726254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:12:55,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:12:55,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:12:55,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179202923] [2024-11-08 12:12:55,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:12:55,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:12:55,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:55,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:12:55,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:12:55,462 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:12:55,482 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-11-08 12:12:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:12:55,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:12:55,491 INFO L225 Difference]: With dead ends: 22 [2024-11-08 12:12:55,491 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 12:12:55,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:12:55,495 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:12:55,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:12:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 12:12:55,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 12:12:55,519 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:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 12:12:55,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2024-11-08 12:12:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:12:55,521 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 12:12:55,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 12:12:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 12:12:55,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:12:55,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:12:55,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:12:55,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:12:55,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:55,523 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2024-11-08 12:12:55,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:55,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053412594] [2024-11-08 12:12:55,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:55,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:55,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:55,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053412594] [2024-11-08 12:12:55,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053412594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:12:55,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619807537] [2024-11-08 12:12:55,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:55,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:12:55,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:12:55,647 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:55,653 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:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:55,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:12:55,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:12:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:55,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:12:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:55,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619807537] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:12:55,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:12:55,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-08 12:12:55,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394951205] [2024-11-08 12:12:55,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:12:55,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 12:12:55,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:55,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 12:12:55,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 12:12:55,753 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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:12:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:12:55,780 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-08 12:12:55,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:12:55,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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) Word has length 8 [2024-11-08 12:12:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:12:55,782 INFO L225 Difference]: With dead ends: 19 [2024-11-08 12:12:55,782 INFO L226 Difference]: Without dead ends: 15 [2024-11-08 12:12:55,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 12:12:55,783 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:12:55,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:12:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-08 12:12:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-08 12:12:55,792 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:12:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-08 12:12:55,793 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-08 12:12:55,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:12:55,793 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-08 12:12:55,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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:12:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-08 12:12:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 12:12:55,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:12:55,794 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-08 12:12:55,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 12:12:55,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:12:55,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:12:55,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:55,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754443, now seen corresponding path program 2 times [2024-11-08 12:12:55,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:55,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916116116] [2024-11-08 12:12:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:55,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:56,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:56,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916116116] [2024-11-08 12:12:56,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916116116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:12:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102806436] [2024-11-08 12:12:56,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:12:56,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:12:56,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:12:56,128 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:56,129 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:56,175 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 12:12:56,175 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:12:56,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 12:12:56,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:12:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:56,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:12:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:56,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102806436] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:12:56,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:12:56,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-08 12:12:56,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560200661] [2024-11-08 12:12:56,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:12:56,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 12:12:56,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:56,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 12:12:56,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-08 12:12:56,293 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:12:56,329 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-08 12:12:56,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:12:56,330 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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) Word has length 14 [2024-11-08 12:12:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:12:56,331 INFO L225 Difference]: With dead ends: 31 [2024-11-08 12:12:56,331 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 12:12:56,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-08 12:12:56,332 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:12:56,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:12:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 12:12:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 12:12:56,338 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:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-08 12:12:56,339 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-08 12:12:56,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:12:56,339 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-08 12:12:56,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 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:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-08 12:12:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 12:12:56,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:12:56,340 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2024-11-08 12:12:56,354 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:56,544 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,SelfDestructingSolverStorable2 [2024-11-08 12:12:56,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:12:56,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash -95702975, now seen corresponding path program 3 times [2024-11-08 12:12:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:56,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417579903] [2024-11-08 12:12:56,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:56,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:56,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:56,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417579903] [2024-11-08 12:12:56,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417579903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:12:56,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555953515] [2024-11-08 12:12:56,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 12:12:56,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:12:56,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:12:56,726 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:12:56,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 12:12:56,777 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-08 12:12:56,777 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:12:56,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 12:12:56,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:12:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:56,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:12:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:57,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555953515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:12:57,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:12:57,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-08 12:12:57,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297103780] [2024-11-08 12:12:57,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:12:57,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 12:12:57,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:57,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 12:12:57,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-08 12:12:57,010 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:12:57,059 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-11-08 12:12:57,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 12:12:57,059 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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 26 [2024-11-08 12:12:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:12:57,060 INFO L225 Difference]: With dead ends: 55 [2024-11-08 12:12:57,060 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 12:12:57,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-08 12:12:57,061 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:12:57,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 12:12:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 12:12:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 12:12:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-11-08 12:12:57,066 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2024-11-08 12:12:57,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:12:57,067 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-11-08 12:12:57,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-11-08 12:12:57,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 12:12:57,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:12:57,068 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1] [2024-11-08 12:12:57,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 12:12:57,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:12:57,273 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:12:57,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:57,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1293970777, now seen corresponding path program 4 times [2024-11-08 12:12:57,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:57,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925744064] [2024-11-08 12:12:57,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:57,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:57,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:57,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925744064] [2024-11-08 12:12:57,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925744064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:12:57,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967217288] [2024-11-08 12:12:57,660 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 12:12:57,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:12:57,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:12:57,662 INFO L229 MonitoredProcess]: Starting monitored process 5 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:57,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 12:12:57,721 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 12:12:57,721 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:12:57,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 12:12:57,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:12:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:57,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:12:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:58,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967217288] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:12:58,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:12:58,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-11-08 12:12:58,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644553331] [2024-11-08 12:12:58,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:12:58,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-08 12:12:58,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:58,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-08 12:12:58,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-08 12:12:58,396 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:12:58,497 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2024-11-08 12:12:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-08 12:12:58,498 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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 50 [2024-11-08 12:12:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:12:58,499 INFO L225 Difference]: With dead ends: 103 [2024-11-08 12:12:58,499 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 12:12:58,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-08 12:12:58,500 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:12:58,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:12:58,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 12:12:58,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-08 12:12:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 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:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2024-11-08 12:12:58,507 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 50 [2024-11-08 12:12:58,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:12:58,507 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2024-11-08 12:12:58,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2024-11-08 12:12:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 12:12:58,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:12:58,509 INFO L215 NwaCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1] [2024-11-08 12:12:58,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 12:12:58,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:12:58,714 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:12:58,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash -675115127, now seen corresponding path program 5 times [2024-11-08 12:12:58,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:58,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345567493] [2024-11-08 12:12:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:58,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:59,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345567493] [2024-11-08 12:12:59,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345567493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:12:59,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059190267] [2024-11-08 12:12:59,915 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 12:12:59,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:12:59,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:12:59,921 INFO L229 MonitoredProcess]: Starting monitored process 6 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:59,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 12:13:00,099 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-08 12:13:00,099 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:13:00,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-08 12:13:00,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:13:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:00,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:13:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:02,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059190267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:13:02,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:13:02,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-11-08 12:13:02,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836953577] [2024-11-08 12:13:02,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:13:02,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2024-11-08 12:13:02,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:13:02,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-11-08 12:13:02,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-11-08 12:13:02,207 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:13:02,572 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2024-11-08 12:13:02,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-08 12:13:02,573 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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 98 [2024-11-08 12:13:02,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:13:02,574 INFO L225 Difference]: With dead ends: 199 [2024-11-08 12:13:02,574 INFO L226 Difference]: Without dead ends: 195 [2024-11-08 12:13:02,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-11-08 12:13:02,577 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:13:02,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 12:13:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-08 12:13:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-08 12:13:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 194 states have internal predecessors, (195), 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:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2024-11-08 12:13:02,590 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 98 [2024-11-08 12:13:02,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:13:02,591 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2024-11-08 12:13:02,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2024-11-08 12:13:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 12:13:02,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:13:02,593 INFO L215 NwaCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1] [2024-11-08 12:13:02,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 12:13:02,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:13:02,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:13:02,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:13:02,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1064733719, now seen corresponding path program 6 times [2024-11-08 12:13:02,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:13:02,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850717385] [2024-11-08 12:13:02,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:13:02,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:13:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:13:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:07,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:13:07,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850717385] [2024-11-08 12:13:07,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850717385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:13:07,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890874734] [2024-11-08 12:13:07,050 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 12:13:07,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:13:07,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:13:07,052 INFO L229 MonitoredProcess]: Starting monitored process 7 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:13:07,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 12:13:07,256 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2024-11-08 12:13:07,256 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:13:07,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-08 12:13:07,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:13:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:07,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:13:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:10,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890874734] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:13:10,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:13:10,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 103 [2024-11-08 12:13:10,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538762178] [2024-11-08 12:13:10,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:13:10,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-11-08 12:13:10,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:13:10,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-11-08 12:13:10,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-11-08 12:13:10,896 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand has 103 states, 103 states have (on average 2.029126213592233) internal successors, (209), 103 states have internal predecessors, (209), 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:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:13:11,126 INFO L93 Difference]: Finished difference Result 211 states and 216 transitions. [2024-11-08 12:13:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-08 12:13:11,127 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 2.029126213592233) internal successors, (209), 103 states have internal predecessors, (209), 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 194 [2024-11-08 12:13:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:13:11,132 INFO L225 Difference]: With dead ends: 211 [2024-11-08 12:13:11,132 INFO L226 Difference]: Without dead ends: 207 [2024-11-08 12:13:11,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 292 SyntacticMatches, 90 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4831 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-11-08 12:13:11,137 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 12:13:11,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 12:13:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-08 12:13:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-08 12:13:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.0048543689320388) internal successors, (207), 206 states have internal predecessors, (207), 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:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2024-11-08 12:13:11,176 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 194 [2024-11-08 12:13:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:13:11,176 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2024-11-08 12:13:11,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.029126213592233) internal successors, (209), 103 states have internal predecessors, (209), 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:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2024-11-08 12:13:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 12:13:11,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:13:11,180 INFO L215 NwaCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1, 1, 1] [2024-11-08 12:13:11,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 12:13:11,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:13:11,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:13:11,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:13:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1785393291, now seen corresponding path program 7 times [2024-11-08 12:13:11,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:13:11,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642386056] [2024-11-08 12:13:11,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:13:11,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:13:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:13:11,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:13:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:13:11,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:13:11,527 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:13:11,528 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 12:13:11,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 12:13:11,531 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1] [2024-11-08 12:13:11,585 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 12:13:11,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 12:13:11 BoogieIcfgContainer [2024-11-08 12:13:11,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 12:13:11,588 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 12:13:11,588 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 12:13:11,588 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 12:13:11,588 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:55" (3/4) ... [2024-11-08 12:13:11,590 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 12:13:11,591 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 12:13:11,591 INFO L158 Benchmark]: Toolchain (without parser) took 16909.72ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 83.4MB in the beginning and 289.3MB in the end (delta: -205.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-11-08 12:13:11,592 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 155.2MB. Free memory was 106.2MB in the beginning and 106.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:13:11,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.78ms. Allocated memory is still 155.2MB. Free memory was 83.2MB in the beginning and 71.1MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 12:13:11,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.67ms. Allocated memory is still 155.2MB. Free memory was 71.1MB in the beginning and 69.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:13:11,592 INFO L158 Benchmark]: Boogie Preprocessor took 31.70ms. Allocated memory is still 155.2MB. Free memory was 69.8MB in the beginning and 68.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:13:11,592 INFO L158 Benchmark]: RCFGBuilder took 239.92ms. Allocated memory is still 155.2MB. Free memory was 68.0MB in the beginning and 58.4MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 12:13:11,593 INFO L158 Benchmark]: TraceAbstraction took 16377.05ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 124.4MB in the beginning and 290.3MB in the end (delta: -165.9MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2024-11-08 12:13:11,593 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 377.5MB. Free memory was 290.3MB in the beginning and 289.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:13:11,594 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.18ms. Allocated memory is still 155.2MB. Free memory was 106.2MB in the beginning and 106.0MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.78ms. Allocated memory is still 155.2MB. Free memory was 83.2MB in the beginning and 71.1MB in the end (delta: 12.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.67ms. Allocated memory is still 155.2MB. Free memory was 71.1MB in the beginning and 69.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.70ms. Allocated memory is still 155.2MB. Free memory was 69.8MB in the beginning and 68.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 239.92ms. Allocated memory is still 155.2MB. Free memory was 68.0MB in the beginning and 58.4MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16377.05ms. Allocated memory was 155.2MB in the beginning and 377.5MB in the end (delta: 222.3MB). Free memory was 124.4MB in the beginning and 290.3MB in the end (delta: -165.9MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 377.5MB. Free memory was 290.3MB in the beginning and 289.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 12]: 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 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 22. Possible FailurePath: [L16] double x0, x1, x2; [L17] int i; [L19] x0 = 11. / 2. [L20] x1 = 61. / 11. [L21] i = 0 VAL [i=0] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=0, x1=116] [L21] i++ VAL [i=1, x1=116] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=1, x1=126] [L21] i++ VAL [i=2, x1=126] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=2, x1=196] [L21] i++ VAL [i=3, x1=196] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=3, x1=137] [L21] i++ VAL [i=4, x1=137] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=4, x1=145] [L21] i++ VAL [i=5, x1=145] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=5, x1=149] [L21] i++ VAL [i=6, x1=149] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=6, x1=159] [L21] i++ VAL [i=7, x1=159] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=7, x1=202] [L21] i++ VAL [i=8, x1=202] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=8, x1=183] [L21] i++ VAL [i=9, x1=183] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=9, x1=204] [L21] i++ VAL [i=10, x1=204] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=10, x1=177] [L21] i++ VAL [i=11, x1=177] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=11, x1=153] [L21] i++ VAL [i=12, x1=153] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=12, x1=198] [L21] i++ VAL [i=13, x1=198] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=13, x1=134] [L21] i++ VAL [i=14, x1=134] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=14, x1=178] [L21] i++ VAL [i=15, x1=178] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=15, x1=125] [L21] i++ VAL [i=16, x1=125] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=16, x1=147] [L21] i++ VAL [i=17, x1=147] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=17, x1=169] [L21] i++ VAL [i=18, x1=169] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=18, x1=197] [L21] i++ VAL [i=19, x1=197] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=19, x1=160] [L21] i++ VAL [i=20, x1=160] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=20, x1=172] [L21] i++ VAL [i=21, x1=172] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=21, x1=155] [L21] i++ VAL [i=22, x1=155] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=22, x1=138] [L21] i++ VAL [i=23, x1=138] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=23, x1=151] [L21] i++ VAL [i=24, x1=151] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=24, x1=194] [L21] i++ VAL [i=25, x1=194] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=25, x1=168] [L21] i++ VAL [i=26, x1=168] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=26, x1=142] [L21] i++ VAL [i=27, x1=142] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=27, x1=184] [L21] i++ VAL [i=28, x1=184] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=28, x1=148] [L21] i++ VAL [i=29, x1=148] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=29, x1=119] [L21] i++ VAL [i=30, x1=119] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=30, x1=123] [L21] i++ VAL [i=31, x1=123] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=31, x1=154] [L21] i++ VAL [i=32, x1=154] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=32, x1=200] [L21] i++ VAL [i=33, x1=200] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=33, x1=140] [L21] i++ VAL [i=34, x1=140] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=34, x1=109] [L21] i++ VAL [i=35, x1=109] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=35, x1=190] [L21] i++ VAL [i=36, x1=190] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=36, x1=106] [L21] i++ VAL [i=37, x1=106] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=37, x1=179] [L21] i++ VAL [i=38, x1=179] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=38, x1=124] [L21] i++ VAL [i=39, x1=124] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=39, x1=156] [L21] i++ VAL [i=40, x1=156] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=40, x1=181] [L21] i++ VAL [i=41, x1=181] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=41, x1=115] [L21] i++ VAL [i=42, x1=115] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=42, x1=131] [L21] i++ VAL [i=43, x1=131] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=43, x1=189] [L21] i++ VAL [i=44, x1=189] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=44, x1=128] [L21] i++ VAL [i=45, x1=128] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=45, x1=121] [L21] i++ VAL [i=46, x1=121] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=46, x1=205] [L21] i++ VAL [i=47, x1=205] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=47, x1=146] [L21] i++ VAL [i=48, x1=146] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=48, x1=185] [L21] i++ VAL [i=49, x1=185] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=49, x1=150] [L21] i++ VAL [i=50, x1=150] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=50, x1=107] [L21] i++ VAL [i=51, x1=107] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=51, x1=175] [L21] i++ VAL [i=52, x1=175] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=52, x1=122] [L21] i++ VAL [i=53, x1=122] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=53, x1=193] [L21] i++ VAL [i=54, x1=193] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=54, x1=129] [L21] i++ VAL [i=55, x1=129] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=55, x1=192] [L21] i++ VAL [i=56, x1=192] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=56, x1=127] [L21] i++ VAL [i=57, x1=127] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=57, x1=139] [L21] i++ VAL [i=58, x1=139] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=58, x1=118] [L21] i++ VAL [i=59, x1=118] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=59, x1=166] [L21] i++ VAL [i=60, x1=166] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=60, x1=199] [L21] i++ VAL [i=61, x1=199] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=61, x1=158] [L21] i++ VAL [i=62, x1=158] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=62, x1=143] [L21] i++ VAL [i=63, x1=143] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=63, x1=173] [L21] i++ VAL [i=64, x1=173] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=64, x1=186] [L21] i++ VAL [i=65, x1=186] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=65, x1=191] [L21] i++ VAL [i=66, x1=191] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=66, x1=170] [L21] i++ VAL [i=67, x1=170] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=67, x1=161] [L21] i++ VAL [i=68, x1=161] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=68, x1=141] [L21] i++ VAL [i=69, x1=141] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=69, x1=133] [L21] i++ VAL [i=70, x1=133] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=70, x1=180] [L21] i++ VAL [i=71, x1=180] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=71, x1=201] [L21] i++ VAL [i=72, x1=201] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=72, x1=105] [L21] i++ VAL [i=73, x1=105] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=73, x1=152] [L21] i++ VAL [i=74, x1=152] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=74, x1=110] [L21] i++ VAL [i=75, x1=110] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=75, x1=165] [L21] i++ VAL [i=76, x1=165] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=76, x1=171] [L21] i++ VAL [i=77, x1=171] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=77, x1=176] [L21] i++ VAL [i=78, x1=176] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=78, x1=117] [L21] i++ VAL [i=79, x1=117] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=79, x1=113] [L21] i++ VAL [i=80, x1=113] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=80, x1=144] [L21] i++ VAL [i=81, x1=144] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=81, x1=203] [L21] i++ VAL [i=82, x1=203] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=82, x1=187] [L21] i++ VAL [i=83, x1=187] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=83, x1=135] [L21] i++ VAL [i=84, x1=135] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=84, x1=182] [L21] i++ VAL [i=85, x1=182] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=85, x1=114] [L21] i++ VAL [i=86, x1=114] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=86, x1=163] [L21] i++ VAL [i=87, x1=163] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=87, x1=164] [L21] i++ VAL [i=88, x1=164] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=88, x1=120] [L21] i++ VAL [i=89, x1=120] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=89, x1=132] [L21] i++ VAL [i=90, x1=132] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=90, x1=136] [L21] i++ VAL [i=91, x1=136] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=91, x1=188] [L21] i++ VAL [i=92, x1=188] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=92, x1=130] [L21] i++ VAL [i=93, x1=130] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=93, x1=111] [L21] i++ VAL [i=94, x1=111] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=94, x1=108] [L21] i++ VAL [i=95, x1=108] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=95, x1=112] [L21] i++ VAL [i=96, x1=112] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=96, x1=162] [L21] i++ VAL [i=97, x1=162] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=97, x1=195] [L21] i++ VAL [i=98, x1=195] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=98, x1=157] [L21] i++ VAL [i=99, x1=157] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=99, x1=167] [L21] i++ VAL [i=100, x1=167] [L21] COND FALSE !(i < 100) VAL [x1=167] [L27] CALL __VERIFIER_assert(x0 >= 99. && x0 <= 101.) [L12] COND TRUE !(cond) [L12] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 8, TraceHistogramMax: 100, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 597 IncrementalHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 46 mSDtfsCounter, 597 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 966 GetRequests, 593 SyntacticMatches, 90 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5163 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=7, InterpolantAutomatonStates: 291, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 992 NumberOfCodeBlocks, 992 NumberOfCodeBlocksAsserted, 166 NumberOfCheckSat, 1157 ConstructedInterpolants, 0 QuantifiedInterpolants, 3319 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1425 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 0/34659 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:13:11,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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/float-benchs/Muller_Kahan.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 12:13:13,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:13:13,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 12:13:13,688 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:13:13,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:13:13,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:13:13,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:13:13,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:13:13,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:13:13,718 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:13:13,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:13:13,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:13:13,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:13:13,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:13:13,721 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:13:13,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:13:13,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:13:13,724 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:13:13,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:13:13,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:13:13,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:13:13,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:13:13,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:13:13,726 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 12:13:13,726 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 12:13:13,726 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:13:13,726 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 12:13:13,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:13:13,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:13:13,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:13:13,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:13:13,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:13:13,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:13:13,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:13:13,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:13:13,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:13:13,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:13:13,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:13:13,739 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 12:13:13,739 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 12:13:13,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:13:13,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:13:13,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:13:13,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:13:13,740 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 -> 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 [2024-11-08 12:13:14,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:13:14,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:13:14,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:13:14,035 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:13:14,035 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:13:14,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/Muller_Kahan.c [2024-11-08 12:13:15,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:13:15,545 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:13:15,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2024-11-08 12:13:15,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e778a92/ba9d15965803436e9014022917d8653b/FLAG0b5b0d6f5 [2024-11-08 12:13:15,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e778a92/ba9d15965803436e9014022917d8653b [2024-11-08 12:13:15,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:13:15,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:13:15,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:13:15,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:13:15,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:13:15,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:13:15" (1/1) ... [2024-11-08 12:13:15,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea65e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:13:15, skipping insertion in model container [2024-11-08 12:13:15,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:13:15" (1/1) ... [2024-11-08 12:13:15,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:13:15,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c[631,644] [2024-11-08 12:13:15,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:13:15,772 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:13:15,781 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c[631,644] [2024-11-08 12:13:15,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:13:15,799 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:13:15,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:13:15 WrapperNode [2024-11-08 12:13:15,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:13:15,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:13:15,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:13:15,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:13:15,805 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:13:15" (1/1) ... [2024-11-08 12:13:15,812 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:13:15" (1/1) ... [2024-11-08 12:13:15,826 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2024-11-08 12:13:15,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:13:15,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:13:15,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:13:15,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:13:15,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:13:15" (1/1) ... [2024-11-08 12:13:15,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:13:15" (1/1) ... [2024-11-08 12:13:15,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:13:15" (1/1) ... [2024-11-08 12:13:15,854 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:13:15,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:13:15" (1/1) ... [2024-11-08 12:13:15,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:13:15" (1/1) ... [2024-11-08 12:13:15,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:13:15" (1/1) ... [2024-11-08 12:13:15,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:13:15" (1/1) ... [2024-11-08 12:13:15,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:13:15" (1/1) ... [2024-11-08 12:13:15,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:13:15" (1/1) ... [2024-11-08 12:13:15,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:13:15,877 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:13:15,877 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:13:15,877 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:13:15,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:13:15" (1/1) ... [2024-11-08 12:13:15,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:13:15,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:13:15,910 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:13:15,920 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:13:15,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:13:15,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:13:15,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:13:15,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 12:13:16,021 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:13:16,023 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:13:20,680 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 12:13:20,680 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:13:20,689 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:13:20,690 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 12:13:20,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:13:20 BoogieIcfgContainer [2024-11-08 12:13:20,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:13:20,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:13:20,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:13:20,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:13:20,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:13:15" (1/3) ... [2024-11-08 12:13:20,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16470afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:13:20, skipping insertion in model container [2024-11-08 12:13:20,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:13:15" (2/3) ... [2024-11-08 12:13:20,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16470afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:13:20, skipping insertion in model container [2024-11-08 12:13:20,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:13:20" (3/3) ... [2024-11-08 12:13:20,696 INFO L112 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c [2024-11-08 12:13:20,721 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:13:20,721 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:13:20,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:13:20,785 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;@3a86c468, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:13:20,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:13:20,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 12:13:20,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:13:20,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 12:13:20,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:13:20,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:13:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2024-11-08 12:13:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:13:20,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273239951] [2024-11-08 12:13:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:13:20,810 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:20,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:13:20,814 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:13:20,815 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:13:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:13:20,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 12:13:20,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:13:21,031 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:13:21,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:13:21,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:13:21,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273239951] [2024-11-08 12:13:21,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273239951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:13:21,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:13:21,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:13:21,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723786184] [2024-11-08 12:13:21,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:13:21,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:13:21,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:13:21,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:13:21,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:13:21,055 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:13:25,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:13:30,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:13:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:13:31,041 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-11-08 12:13:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:31,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:13:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:13:31,053 INFO L225 Difference]: With dead ends: 22 [2024-11-08 12:13:31,053 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 12:13:31,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:13:31,059 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-11-08 12:13:31,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2024-11-08 12:13:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 12:13:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 12:13:31,094 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:13:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 12:13:31,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2024-11-08 12:13:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:13:31,096 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 12:13:31,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:13:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 12:13:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 12:13:31,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:13:31,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:13:31,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 12:13:31,299 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:13:31,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:13:31,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:13:31,301 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2024-11-08 12:13:31,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:13:31,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38244822] [2024-11-08 12:13:31,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:13:31,302 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:31,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:13:31,303 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:13:31,305 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:13:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:13:32,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 12:13:32,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:13:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:33,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:13:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:33,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:13:33,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38244822] [2024-11-08 12:13:33,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38244822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:13:33,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:13:33,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-08 12:13:33,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813101023] [2024-11-08 12:13:33,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:13:33,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:13:33,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:13:33,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:13:33,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 12:13:33,764 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:13:38,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:13:42,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:13:47,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:13:51,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:13:56,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:14:00,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:14:04,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:14:09,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:14:13,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:14:17,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:14:21,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:14:27,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:14:31,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:14:35,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 12:14:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:14:35,350 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-08 12:14:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:14:35,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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) Word has length 8 [2024-11-08 12:14:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:14:35,732 INFO L225 Difference]: With dead ends: 19 [2024-11-08 12:14:35,732 INFO L226 Difference]: Without dead ends: 15 [2024-11-08 12:14:35,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-08 12:14:35,733 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.3s IncrementalHoareTripleChecker+Time [2024-11-08 12:14:35,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 14 Unknown, 0 Unchecked, 61.3s Time] [2024-11-08 12:14:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-08 12:14:35,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-08 12:14:35,745 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:14:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-08 12:14:35,746 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-08 12:14:35,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:14:35,747 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-08 12:14:35,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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:14:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-08 12:14:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 12:14:35,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:14:35,751 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-08 12:14:35,789 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:14:35,952 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:14:35,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:14:35,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:14:35,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754443, now seen corresponding path program 2 times [2024-11-08 12:14:35,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:14:35,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780795623] [2024-11-08 12:14:35,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:14:35,957 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:14:35,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:14:35,959 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:14:35,965 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