./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-nonlinear/bound-grocery.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/floats-nonlinear/bound-grocery.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 c1c842b4a36d74cf3c9ba6a921e1163d6c11fc4826eddbcec790a19f691a5540 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:46:53,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:46:53,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:46:53,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:46:53,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:46:53,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:46:53,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:46:53,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:46:53,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:46:53,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:46:53,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:46:53,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:46:53,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:46:53,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:46:53,409 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:46:53,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:46:53,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:46:53,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:46:53,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:46:53,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:46:53,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:46:53,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:46:53,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:46:53,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:46:53,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:46:53,414 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:46:53,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:46:53,414 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:46:53,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:46:53,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:46:53,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:46:53,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:46:53,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:46:53,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:46:53,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:46:53,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:46:53,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:46:53,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:46:53,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:46:53,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:46:53,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:46:53,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:46:53,417 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 -> c1c842b4a36d74cf3c9ba6a921e1163d6c11fc4826eddbcec790a19f691a5540 [2024-11-08 13:46:53,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:46:53,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:46:53,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:46:53,632 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:46:53,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:46:53,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/bound-grocery.c [2024-11-08 13:46:54,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:46:54,981 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:46:54,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-grocery.c [2024-11-08 13:46:54,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be334f01/8d18fc43d9bb427f9fba7d87bc73d190/FLAG4d6a724ec [2024-11-08 13:46:55,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be334f01/8d18fc43d9bb427f9fba7d87bc73d190 [2024-11-08 13:46:55,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:46:55,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:46:55,012 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:46:55,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:46:55,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:46:55,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:46:55" (1/1) ... [2024-11-08 13:46:55,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a08235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55, skipping insertion in model container [2024-11-08 13:46:55,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:46:55" (1/1) ... [2024-11-08 13:46:55,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:46:55,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-grocery.c[606,619] [2024-11-08 13:46:55,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:46:55,182 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:46:55,190 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-grocery.c[606,619] [2024-11-08 13:46:55,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:46:55,206 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:46:55,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55 WrapperNode [2024-11-08 13:46:55,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:46:55,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:46:55,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:46:55,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:46:55,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55" (1/1) ... [2024-11-08 13:46:55,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55" (1/1) ... [2024-11-08 13:46:55,231 INFO L138 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2024-11-08 13:46:55,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:46:55,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:46:55,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:46:55,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:46:55,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55" (1/1) ... [2024-11-08 13:46:55,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55" (1/1) ... [2024-11-08 13:46:55,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55" (1/1) ... [2024-11-08 13:46:55,254 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 13:46:55,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55" (1/1) ... [2024-11-08 13:46:55,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55" (1/1) ... [2024-11-08 13:46:55,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55" (1/1) ... [2024-11-08 13:46:55,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55" (1/1) ... [2024-11-08 13:46:55,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55" (1/1) ... [2024-11-08 13:46:55,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55" (1/1) ... [2024-11-08 13:46:55,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:46:55,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:46:55,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:46:55,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:46:55,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55" (1/1) ... [2024-11-08 13:46:55,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:46:55,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:46:55,291 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 13:46:55,296 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 13:46:55,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:46:55,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:46:55,333 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-08 13:46:55,333 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-08 13:46:55,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:46:55,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:46:55,389 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:46:55,391 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:46:55,541 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-08 13:46:55,541 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:46:55,554 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:46:55,554 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 13:46:55,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:46:55 BoogieIcfgContainer [2024-11-08 13:46:55,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:46:55,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:46:55,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:46:55,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:46:55,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:46:55" (1/3) ... [2024-11-08 13:46:55,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24eaf19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:46:55, skipping insertion in model container [2024-11-08 13:46:55,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:46:55" (2/3) ... [2024-11-08 13:46:55,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24eaf19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:46:55, skipping insertion in model container [2024-11-08 13:46:55,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:46:55" (3/3) ... [2024-11-08 13:46:55,561 INFO L112 eAbstractionObserver]: Analyzing ICFG bound-grocery.c [2024-11-08 13:46:55,574 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:46:55,574 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:46:55,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:46:55,620 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;@74bd231, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:46:55,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:46:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:46:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 13:46:55,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:46:55,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:46:55,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:46:55,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:46:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash -36567605, now seen corresponding path program 1 times [2024-11-08 13:46:55,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:46:55,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996630126] [2024-11-08 13:46:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:46:55,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:46:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:46:55,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:46:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:46:55,979 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 13:46:55,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:46:55,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996630126] [2024-11-08 13:46:55,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996630126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:46:55,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:46:55,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:46:55,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755629884] [2024-11-08 13:46:55,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:46:55,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:46:55,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:46:56,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:46:56,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:46:56,008 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:46:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:46:56,087 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2024-11-08 13:46:56,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:46:56,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-08 13:46:56,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:46:56,116 INFO L225 Difference]: With dead ends: 53 [2024-11-08 13:46:56,116 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 13:46:56,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:46:56,123 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:46:56,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:46:56,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 13:46:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-08 13:46:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 13:46:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-11-08 13:46:56,162 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 17 [2024-11-08 13:46:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:46:56,163 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-11-08 13:46:56,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:46:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-11-08 13:46:56,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 13:46:56,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:46:56,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:46:56,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:46:56,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:46:56,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:46:56,168 INFO L85 PathProgramCache]: Analyzing trace with hash -329970612, now seen corresponding path program 1 times [2024-11-08 13:46:56,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:46:56,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458753292] [2024-11-08 13:46:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:46:56,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:46:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:46:56,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:46:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:46:56,219 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 13:46:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:46:56,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458753292] [2024-11-08 13:46:56,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458753292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:46:56,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:46:56,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:46:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928423299] [2024-11-08 13:46:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:46:56,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:46:56,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:46:56,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:46:56,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:46:56,228 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:46:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:46:56,245 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2024-11-08 13:46:56,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:46:56,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-08 13:46:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:46:56,247 INFO L225 Difference]: With dead ends: 33 [2024-11-08 13:46:56,247 INFO L226 Difference]: Without dead ends: 29 [2024-11-08 13:46:56,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 13:46:56,249 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:46:56,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:46:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-08 13:46:56,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-08 13:46:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 13:46:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-11-08 13:46:56,258 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 17 [2024-11-08 13:46:56,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:46:56,259 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-11-08 13:46:56,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:46:56,260 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-08 13:46:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 13:46:56,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:46:56,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:46:56,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:46:56,262 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:46:56,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:46:56,262 INFO L85 PathProgramCache]: Analyzing trace with hash -329911030, now seen corresponding path program 1 times [2024-11-08 13:46:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:46:56,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12236870] [2024-11-08 13:46:56,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:46:56,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:46:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:46:56,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:46:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:46:56,365 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 13:46:56,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:46:56,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12236870] [2024-11-08 13:46:56,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12236870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:46:56,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:46:56,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:46:56,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302698264] [2024-11-08 13:46:56,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:46:56,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:46:56,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:46:56,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:46:56,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:46:56,367 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:46:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:46:56,380 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2024-11-08 13:46:56,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:46:56,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-08 13:46:56,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:46:56,381 INFO L225 Difference]: With dead ends: 33 [2024-11-08 13:46:56,381 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 13:46:56,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:46:56,382 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 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 13:46:56,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:46:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 13:46:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-08 13:46:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 13:46:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-11-08 13:46:56,387 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2024-11-08 13:46:56,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:46:56,388 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-08 13:46:56,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:46:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-11-08 13:46:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 13:46:56,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:46:56,392 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:46:56,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:46:56,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:46:56,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:46:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash -752866454, now seen corresponding path program 1 times [2024-11-08 13:46:56,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:46:56,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41644323] [2024-11-08 13:46:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:46:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:46:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:46:56,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:46:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:46:56,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 13:46:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:46:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 13:46:56,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:46:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41644323] [2024-11-08 13:46:56,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41644323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:46:56,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:46:56,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:46:56,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305492846] [2024-11-08 13:46:56,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:46:56,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:46:56,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:46:56,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:46:56,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:46:56,462 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:46:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:46:56,477 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-08 13:46:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:46:56,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-08 13:46:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:46:56,478 INFO L225 Difference]: With dead ends: 43 [2024-11-08 13:46:56,478 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 13:46:56,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:46:56,479 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:46:56,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:46:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 13:46:56,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-08 13:46:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 13:46:56,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-08 13:46:56,487 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2024-11-08 13:46:56,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:46:56,488 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-08 13:46:56,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 13:46:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-08 13:46:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 13:46:56,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:46:56,489 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:46:56,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:46:56,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:46:56,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:46:56,491 INFO L85 PathProgramCache]: Analyzing trace with hash 475007939, now seen corresponding path program 1 times [2024-11-08 13:46:56,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:46:56,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68405754] [2024-11-08 13:46:56,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:46:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:46:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:46:56,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:46:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:46:56,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 13:46:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:46:56,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 13:46:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:46:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 13:46:56,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:46:56,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68405754] [2024-11-08 13:46:56,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68405754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:46:56,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:46:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:46:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837333603] [2024-11-08 13:46:56,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:46:56,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:46:56,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:46:56,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:46:56,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:46:56,548 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:46:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:46:56,571 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2024-11-08 13:46:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:46:56,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-11-08 13:46:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:46:56,572 INFO L225 Difference]: With dead ends: 47 [2024-11-08 13:46:56,573 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 13:46:56,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:46:56,575 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:46:56,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:46:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 13:46:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-11-08 13:46:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:46:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-08 13:46:56,583 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 29 [2024-11-08 13:46:56,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:46:56,583 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-08 13:46:56,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:46:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-08 13:46:56,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 13:46:56,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:46:56,584 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:46:56,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:46:56,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:46:56,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:46:56,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1979909910, now seen corresponding path program 1 times [2024-11-08 13:46:56,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:46:56,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733130727] [2024-11-08 13:46:56,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:46:56,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:46:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:46:56,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 13:46:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:46:56,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 13:46:56,642 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 13:46:56,643 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 13:46:56,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 13:46:56,647 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 13:46:56,666 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 13:46:56,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 01:46:56 BoogieIcfgContainer [2024-11-08 13:46:56,670 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 13:46:56,671 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 13:46:56,671 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 13:46:56,671 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 13:46:56,671 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:46:55" (3/4) ... [2024-11-08 13:46:56,673 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 13:46:56,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 13:46:56,677 INFO L158 Benchmark]: Toolchain (without parser) took 1665.59ms. Allocated memory is still 159.4MB. Free memory was 131.9MB in the beginning and 70.3MB in the end (delta: 61.6MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2024-11-08 13:46:56,677 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 13:46:56,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.42ms. Allocated memory is still 159.4MB. Free memory was 131.2MB in the beginning and 118.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 13:46:56,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.19ms. Allocated memory is still 159.4MB. Free memory was 118.7MB in the beginning and 117.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:46:56,678 INFO L158 Benchmark]: Boogie Preprocessor took 28.91ms. Allocated memory is still 159.4MB. Free memory was 117.3MB in the beginning and 115.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:46:56,678 INFO L158 Benchmark]: RCFGBuilder took 293.27ms. Allocated memory is still 159.4MB. Free memory was 115.2MB in the beginning and 102.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 13:46:56,678 INFO L158 Benchmark]: TraceAbstraction took 1113.77ms. Allocated memory is still 159.4MB. Free memory was 101.3MB in the beginning and 70.3MB in the end (delta: 31.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-11-08 13:46:56,679 INFO L158 Benchmark]: Witness Printer took 6.10ms. Allocated memory is still 159.4MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 13:46:56,680 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.15ms. Allocated memory is still 121.6MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.42ms. Allocated memory is still 159.4MB. Free memory was 131.2MB in the beginning and 118.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.19ms. Allocated memory is still 159.4MB. Free memory was 118.7MB in the beginning and 117.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.91ms. Allocated memory is still 159.4MB. Free memory was 117.3MB in the beginning and 115.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 293.27ms. Allocated memory is still 159.4MB. Free memory was 115.2MB in the beginning and 102.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1113.77ms. Allocated memory is still 159.4MB. Free memory was 101.3MB in the beginning and 70.3MB in the end (delta: 31.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Witness Printer took 6.10ms. Allocated memory is still 159.4MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: 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 32. Possible FailurePath: [L40] int x, y, z, w; [L41] x = __VERIFIER_nondet_int() [L42] y = __VERIFIER_nondet_int() [L43] z = __VERIFIER_nondet_int() [L44] w = __VERIFIER_nondet_int() [L45] CALL, EXPR solve(x, y, z, w) [L30] CALL, EXPR check_domain(item1) VAL [\old(x)=0] [L26] COND TRUE x >= 0 && x <= 711 [L26] return 1; VAL [\old(x)=0, \result=1] [L30] RET, EXPR check_domain(item1) VAL [item1=0, item2=0, item3=0, item4=711] [L30] EXPR check_domain(item1) && check_domain(item2) VAL [item1=0, item2=0, item3=0, item4=711] [L30] CALL, EXPR check_domain(item2) VAL [\old(x)=0] [L26] COND TRUE x >= 0 && x <= 711 [L26] return 1; VAL [\old(x)=0, \result=1] [L30] RET, EXPR check_domain(item2) VAL [item1=0, item2=0, item3=0, item4=711] [L30] EXPR check_domain(item1) && check_domain(item2) VAL [item1=0, item2=0, item3=0, item4=711] [L30] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) VAL [item1=0, item2=0, item3=0, item4=711] [L30] CALL, EXPR check_domain(item3) VAL [\old(x)=0] [L26] COND TRUE x >= 0 && x <= 711 [L26] return 1; VAL [\old(x)=0, \result=1] [L30] RET, EXPR check_domain(item3) VAL [item1=0, item2=0, item3=0, item4=711] [L30] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) VAL [item1=0, item2=0, item3=0, item4=711] [L30-L31] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) && check_domain(item4) VAL [item1=0, item2=0, item3=0, item4=711] [L31] CALL, EXPR check_domain(item4) VAL [\old(x)=711] [L26] COND TRUE x >= 0 && x <= 711 [L26] return 1; VAL [\old(x)=711, \result=1] [L31] RET, EXPR check_domain(item4) VAL [item1=0, item2=0, item3=0, item4=711] [L30-L31] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) && check_domain(item4) VAL [item1=0, item2=0, item3=0, item4=711] [L30-L33] COND TRUE check_domain(item1) && check_domain(item2) && check_domain(item3) && check_domain(item4) && item1 + item2 + item3 + item4 == 711 && (item1 + 0.0) * item2 * item3 * item4 == 711.0 * 100 * 100 * 100 && item1 <= item2 && item2 <= item3 && item3 <= item4 [L34] return 1; VAL [\result=1] [L45] RET, EXPR solve(x, y, z, w) [L45] CALL __VERIFIER_assert(!solve(x, y, z, w)) [L16] COND TRUE !(cond) [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 398 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 250 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 148 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=2, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 16/16 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 13:46:56,705 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/floats-nonlinear/bound-grocery.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 c1c842b4a36d74cf3c9ba6a921e1163d6c11fc4826eddbcec790a19f691a5540 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:46:58,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:46:58,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 13:46:58,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:46:58,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:46:58,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:46:58,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:46:58,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:46:58,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:46:58,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:46:58,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:46:58,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:46:58,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:46:58,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:46:58,618 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:46:58,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:46:58,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:46:58,619 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:46:58,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:46:58,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:46:58,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:46:58,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:46:58,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:46:58,623 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 13:46:58,623 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 13:46:58,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:46:58,623 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 13:46:58,624 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:46:58,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:46:58,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:46:58,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:46:58,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:46:58,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:46:58,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:46:58,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:46:58,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:46:58,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:46:58,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:46:58,625 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 13:46:58,625 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 13:46:58,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:46:58,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:46:58,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:46:58,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:46:58,628 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 -> c1c842b4a36d74cf3c9ba6a921e1163d6c11fc4826eddbcec790a19f691a5540 [2024-11-08 13:46:58,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:46:58,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:46:58,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:46:58,888 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:46:58,888 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:46:58,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/bound-grocery.c [2024-11-08 13:47:00,157 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:47:00,308 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:47:00,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-grocery.c [2024-11-08 13:47:00,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ccca5d4/16b8aa224a3e4b65bfbf8d908d3fea5a/FLAGfc52481a1 [2024-11-08 13:47:00,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ccca5d4/16b8aa224a3e4b65bfbf8d908d3fea5a [2024-11-08 13:47:00,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:47:00,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:47:00,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:47:00,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:47:00,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:47:00,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:47:00" (1/1) ... [2024-11-08 13:47:00,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef0d124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00, skipping insertion in model container [2024-11-08 13:47:00,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:47:00" (1/1) ... [2024-11-08 13:47:00,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:47:00,483 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-grocery.c[606,619] [2024-11-08 13:47:00,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:47:00,507 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:47:00,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-grocery.c[606,619] [2024-11-08 13:47:00,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:47:00,549 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:47:00,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00 WrapperNode [2024-11-08 13:47:00,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:47:00,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:47:00,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:47:00,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:47:00,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00" (1/1) ... [2024-11-08 13:47:00,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00" (1/1) ... [2024-11-08 13:47:00,589 INFO L138 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-11-08 13:47:00,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:47:00,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:47:00,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:47:00,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:47:00,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00" (1/1) ... [2024-11-08 13:47:00,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00" (1/1) ... [2024-11-08 13:47:00,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00" (1/1) ... [2024-11-08 13:47:00,615 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 13:47:00,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00" (1/1) ... [2024-11-08 13:47:00,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00" (1/1) ... [2024-11-08 13:47:00,621 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00" (1/1) ... [2024-11-08 13:47:00,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00" (1/1) ... [2024-11-08 13:47:00,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00" (1/1) ... [2024-11-08 13:47:00,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00" (1/1) ... [2024-11-08 13:47:00,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:47:00,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:47:00,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:47:00,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:47:00,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00" (1/1) ... [2024-11-08 13:47:00,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:47:00,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:00,666 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 13:47:00,669 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 13:47:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:47:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 13:47:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-08 13:47:00,706 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-08 13:47:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:47:00,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:47:00,771 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:47:00,775 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:47:09,277 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-08 13:47:09,277 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:47:09,290 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:47:09,291 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 13:47:09,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:47:09 BoogieIcfgContainer [2024-11-08 13:47:09,291 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:47:09,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:47:09,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:47:09,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:47:09,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:47:00" (1/3) ... [2024-11-08 13:47:09,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5627059e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:47:09, skipping insertion in model container [2024-11-08 13:47:09,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:00" (2/3) ... [2024-11-08 13:47:09,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5627059e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:47:09, skipping insertion in model container [2024-11-08 13:47:09,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:47:09" (3/3) ... [2024-11-08 13:47:09,300 INFO L112 eAbstractionObserver]: Analyzing ICFG bound-grocery.c [2024-11-08 13:47:09,312 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:47:09,312 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:47:09,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:47:09,355 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;@6340a3c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:47:09,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:47:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 13:47:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 13:47:09,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:09,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:09,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:09,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:09,369 INFO L85 PathProgramCache]: Analyzing trace with hash -36567605, now seen corresponding path program 1 times [2024-11-08 13:47:09,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 13:47:09,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681692107] [2024-11-08 13:47:09,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:09,379 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 13:47:09,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 13:47:09,382 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 13:47:09,383 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 13:47:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:09,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 13:47:09,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:47:10,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:47:10,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 13:47:10,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681692107] [2024-11-08 13:47:10,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681692107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:10,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:10,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:47:10,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455114182] [2024-11-08 13:47:10,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:10,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:47:10,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 13:47:10,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:47:10,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:47:10,322 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:14,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 13:47:18,842 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 13:47:23,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 13:47:27,247 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 13:47:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:27,427 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2024-11-08 13:47:27,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:47:27,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-08 13:47:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:27,434 INFO L225 Difference]: With dead ends: 53 [2024-11-08 13:47:27,434 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 13:47:27,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:47:27,438 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:27,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 4 Unknown, 0 Unchecked, 17.1s Time] [2024-11-08 13:47:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 13:47:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-08 13:47:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 13:47:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-11-08 13:47:27,466 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 17 [2024-11-08 13:47:27,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:27,466 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-11-08 13:47:27,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-11-08 13:47:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 13:47:27,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:27,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:27,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 13:47:27,668 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 13:47:27,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:27,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:27,670 INFO L85 PathProgramCache]: Analyzing trace with hash -329970612, now seen corresponding path program 1 times [2024-11-08 13:47:27,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 13:47:27,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021813463] [2024-11-08 13:47:27,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:27,670 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 13:47:27,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 13:47:27,673 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 13:47:27,674 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 13:47:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:28,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 13:47:28,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:29,024 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 13:47:29,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:47:29,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 13:47:29,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021813463] [2024-11-08 13:47:29,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021813463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:29,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:29,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 13:47:29,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635720988] [2024-11-08 13:47:29,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:29,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:47:29,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 13:47:29,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:47:29,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:47:29,029 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:47:33,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 13:47:37,897 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 13:47:41,902 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 13:47:45,914 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 13:47:49,919 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 13:47:53,929 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 13:47:58,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 13:48:02,474 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 13:48:06,479 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 13:48:10,484 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 13:48:14,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 13:48:18,881 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 13:48:22,887 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 13:48:26,899 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 13:48:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:48:26,899 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2024-11-08 13:48:27,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 13:48:27,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-08 13:48:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:48:27,023 INFO L225 Difference]: With dead ends: 54 [2024-11-08 13:48:27,023 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 13:48:27,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:48:27,024 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.8s IncrementalHoareTripleChecker+Time [2024-11-08 13:48:27,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 14 Unknown, 0 Unchecked, 57.8s Time] [2024-11-08 13:48:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 13:48:27,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 13:48:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 13:48:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-08 13:48:27,030 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2024-11-08 13:48:27,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:48:27,030 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-08 13:48:27,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:48:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-08 13:48:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 13:48:27,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:48:27,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:48:27,049 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 13:48:27,231 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 13:48:27,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:48:27,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:48:27,232 INFO L85 PathProgramCache]: Analyzing trace with hash -329911030, now seen corresponding path program 1 times [2024-11-08 13:48:27,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 13:48:27,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411216939] [2024-11-08 13:48:27,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:48:27,233 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 13:48:27,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 13:48:27,234 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 13:48:27,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 13:48:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:48:27,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 13:48:27,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:48:27,926 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 13:48:27,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:48:27,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 13:48:27,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411216939] [2024-11-08 13:48:27,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411216939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:48:27,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:48:27,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:48:27,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614588786] [2024-11-08 13:48:27,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:48:27,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:48:27,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 13:48:27,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:48:27,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:48:27,927 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:48:32,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 13:48:32,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:48:32,387 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-11-08 13:48:32,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:48:32,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-08 13:48:32,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:48:32,389 INFO L225 Difference]: With dead ends: 37 [2024-11-08 13:48:32,389 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 13:48:32,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:48:32,390 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-08 13:48:32,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-08 13:48:32,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 13:48:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-08 13:48:32,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-08 13:48:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-08 13:48:32,394 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2024-11-08 13:48:32,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:48:32,394 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-08 13:48:32,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:48:32,395 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-08 13:48:32,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 13:48:32,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:48:32,396 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:48:32,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 13:48:32,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 13:48:32,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:48:32,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:48:32,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1979909910, now seen corresponding path program 1 times [2024-11-08 13:48:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 13:48:32,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454247768] [2024-11-08 13:48:32,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:48:32,599 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 13:48:32,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 13:48:32,600 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 13:48:32,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 13:48:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:48:39,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 13:48:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:48:42,120 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-08 13:48:42,120 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 13:48:42,121 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 13:48:42,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-08 13:48:42,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 13:48:42,326 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 13:48:42,343 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 13:48:42,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 01:48:42 BoogieIcfgContainer [2024-11-08 13:48:42,345 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 13:48:42,346 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 13:48:42,346 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 13:48:42,346 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 13:48:42,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:47:09" (3/4) ... [2024-11-08 13:48:42,347 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 13:48:42,377 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 13:48:42,377 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 13:48:42,378 INFO L158 Benchmark]: Toolchain (without parser) took 102049.72ms. Allocated memory is still 79.7MB. Free memory was 52.0MB in the beginning and 40.8MB in the end (delta: 11.2MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-11-08 13:48:42,378 INFO L158 Benchmark]: CDTParser took 1.46ms. Allocated memory is still 60.8MB. Free memory was 32.6MB in the beginning and 32.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 13:48:42,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.25ms. Allocated memory is still 79.7MB. Free memory was 51.8MB in the beginning and 60.0MB in the end (delta: -8.2MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-11-08 13:48:42,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.55ms. Allocated memory is still 79.7MB. Free memory was 60.0MB in the beginning and 58.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 13:48:42,378 INFO L158 Benchmark]: Boogie Preprocessor took 45.50ms. Allocated memory is still 79.7MB. Free memory was 58.3MB in the beginning and 56.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:48:42,379 INFO L158 Benchmark]: RCFGBuilder took 8654.01ms. Allocated memory is still 79.7MB. Free memory was 56.2MB in the beginning and 43.0MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 13:48:42,379 INFO L158 Benchmark]: TraceAbstraction took 93051.14ms. Allocated memory is still 79.7MB. Free memory was 42.3MB in the beginning and 42.9MB in the end (delta: -596.8kB). Peak memory consumption was 203.4kB. Max. memory is 16.1GB. [2024-11-08 13:48:42,379 INFO L158 Benchmark]: Witness Printer took 31.72ms. Allocated memory is still 79.7MB. Free memory was 42.9MB in the beginning and 40.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:48:42,380 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.46ms. Allocated memory is still 60.8MB. Free memory was 32.6MB in the beginning and 32.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.25ms. Allocated memory is still 79.7MB. Free memory was 51.8MB in the beginning and 60.0MB in the end (delta: -8.2MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.55ms. Allocated memory is still 79.7MB. Free memory was 60.0MB in the beginning and 58.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.50ms. Allocated memory is still 79.7MB. Free memory was 58.3MB in the beginning and 56.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 8654.01ms. Allocated memory is still 79.7MB. Free memory was 56.2MB in the beginning and 43.0MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 93051.14ms. Allocated memory is still 79.7MB. Free memory was 42.3MB in the beginning and 42.9MB in the end (delta: -596.8kB). Peak memory consumption was 203.4kB. Max. memory is 16.1GB. * Witness Printer took 31.72ms. Allocated memory is still 79.7MB. Free memory was 42.9MB in the beginning and 40.8MB in the end (delta: 2.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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L40] int x, y, z, w; [L41] x = __VERIFIER_nondet_int() [L42] y = __VERIFIER_nondet_int() [L43] z = __VERIFIER_nondet_int() [L44] w = __VERIFIER_nondet_int() [L45] CALL, EXPR solve(x, y, z, w) [L30] CALL, EXPR check_domain(item1) VAL [\old(x)=120] [L26] COND TRUE x >= 0 && x <= 711 [L26] return 1; VAL [\old(x)=120, \result=1] [L30] RET, EXPR check_domain(item1) VAL [item1=120, item2=125, item3=150, item4=316] [L30] EXPR check_domain(item1) && check_domain(item2) VAL [item1=120, item2=125, item3=150, item4=316] [L30] CALL, EXPR check_domain(item2) VAL [\old(x)=125] [L26] COND TRUE x >= 0 && x <= 711 [L26] return 1; VAL [\old(x)=125, \result=1] [L30] RET, EXPR check_domain(item2) VAL [item1=120, item2=125, item3=150, item4=316] [L30] EXPR check_domain(item1) && check_domain(item2) VAL [item1=120, item2=125, item3=150, item4=316] [L30] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) VAL [item1=120, item2=125, item3=150, item4=316] [L30] CALL, EXPR check_domain(item3) VAL [\old(x)=150] [L26] COND TRUE x >= 0 && x <= 711 [L26] return 1; VAL [\old(x)=150, \result=1] [L30] RET, EXPR check_domain(item3) VAL [item1=120, item2=125, item3=150, item4=316] [L30] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) VAL [item1=120, item2=125, item3=150, item4=316] [L30-L31] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) && check_domain(item4) VAL [item1=120, item2=125, item3=150, item4=316] [L31] CALL, EXPR check_domain(item4) VAL [\old(x)=316] [L26] COND TRUE x >= 0 && x <= 711 [L26] return 1; VAL [\old(x)=316, \result=1] [L31] RET, EXPR check_domain(item4) VAL [item1=120, item2=125, item3=150, item4=316] [L30-L31] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) && check_domain(item4) VAL [item1=120, item2=125, item3=150, item4=316] [L30-L33] COND TRUE check_domain(item1) && check_domain(item2) && check_domain(item3) && check_domain(item4) && item1 + item2 + item3 + item4 == 711 && (item1 + 0.0) * item2 * item3 * item4 == 711.0 * 100 * 100 * 100 && item1 <= item2 && item2 <= item3 && item3 <= item4 [L34] return 1; VAL [\result=1] [L45] RET, EXPR solve(x, y, z, w) [L45] CALL __VERIFIER_assert(!solve(x, y, z, w)) [L16] COND TRUE !(cond) [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 93.0s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 79.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 79.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 363 SdHoareTripleChecker+Invalid, 78.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 269 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 70 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 94 mSDtfsCounter, 70 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 8.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 70 SizeOfPredicates, 0 NumberOfNonLiveVariables, 137 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 13:48:42,501 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE