/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/floats-nonlinear/bound-grocery.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 10:45:10,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 10:45:10,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 10:45:10,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 10:45:10,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 10:45:10,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 10:45:10,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 10:45:10,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 10:45:10,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 10:45:10,368 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 10:45:10,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 10:45:10,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 10:45:10,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 10:45:10,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 10:45:10,369 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 10:45:10,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 10:45:10,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 10:45:10,372 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 10:45:10,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 10:45:10,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 10:45:10,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 10:45:10,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 10:45:10,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 10:45:10,375 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 10:45:10,375 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 10:45:10,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 10:45:10,375 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 10:45:10,375 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 10:45:10,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 10:45:10,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 10:45:10,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 10:45:10,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 10:45:10,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 10:45:10,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 10:45:10,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 10:45:10,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 10:45:10,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 10:45:10,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 10:45:10,378 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 10:45:10,378 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 10:45:10,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 10:45:10,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 10:45:10,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 10:45:10,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 10:45:10,379 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> 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-03 10:45:10,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 10:45:10,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 10:45:10,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 10:45:10,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 10:45:10,629 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 10:45:10,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-nonlinear/bound-grocery.c [2024-11-03 10:45:12,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 10:45:12,164 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 10:45:12,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/bound-grocery.c [2024-11-03 10:45:12,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/534792e26/75173483b6864914815850ff5e41b5fa/FLAGdb8c86663 [2024-11-03 10:45:12,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/534792e26/75173483b6864914815850ff5e41b5fa [2024-11-03 10:45:12,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 10:45:12,186 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 10:45:12,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 10:45:12,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 10:45:12,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 10:45:12,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 10:45:12" (1/1) ... [2024-11-03 10:45:12,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8982ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12, skipping insertion in model container [2024-11-03 10:45:12,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 10:45:12" (1/1) ... [2024-11-03 10:45:12,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 10:45:12,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/bound-grocery.c[606,619] [2024-11-03 10:45:12,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 10:45:12,381 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 10:45:12,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/bound-grocery.c[606,619] [2024-11-03 10:45:12,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 10:45:12,409 INFO L204 MainTranslator]: Completed translation [2024-11-03 10:45:12,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12 WrapperNode [2024-11-03 10:45:12,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 10:45:12,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 10:45:12,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 10:45:12,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 10:45:12,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12" (1/1) ... [2024-11-03 10:45:12,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12" (1/1) ... [2024-11-03 10:45:12,443 INFO L138 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-11-03 10:45:12,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 10:45:12,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 10:45:12,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 10:45:12,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 10:45:12,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12" (1/1) ... [2024-11-03 10:45:12,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12" (1/1) ... [2024-11-03 10:45:12,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12" (1/1) ... [2024-11-03 10:45:12,466 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-03 10:45:12,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12" (1/1) ... [2024-11-03 10:45:12,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12" (1/1) ... [2024-11-03 10:45:12,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12" (1/1) ... [2024-11-03 10:45:12,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12" (1/1) ... [2024-11-03 10:45:12,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12" (1/1) ... [2024-11-03 10:45:12,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12" (1/1) ... [2024-11-03 10:45:12,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 10:45:12,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 10:45:12,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 10:45:12,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 10:45:12,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12" (1/1) ... [2024-11-03 10:45:12,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 10:45:12,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 10:45:12,516 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-03 10:45:12,523 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-03 10:45:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 10:45:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 10:45:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-03 10:45:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-03 10:45:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 10:45:12,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 10:45:12,621 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 10:45:12,623 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 10:45:21,096 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-03 10:45:21,096 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 10:45:21,111 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 10:45:21,112 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-03 10:45:21,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 10:45:21 BoogieIcfgContainer [2024-11-03 10:45:21,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 10:45:21,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 10:45:21,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 10:45:21,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 10:45:21,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 10:45:12" (1/3) ... [2024-11-03 10:45:21,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4dec63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 10:45:21, skipping insertion in model container [2024-11-03 10:45:21,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 10:45:12" (2/3) ... [2024-11-03 10:45:21,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4dec63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 10:45:21, skipping insertion in model container [2024-11-03 10:45:21,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 10:45:21" (3/3) ... [2024-11-03 10:45:21,126 INFO L112 eAbstractionObserver]: Analyzing ICFG bound-grocery.c [2024-11-03 10:45:21,147 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 10:45:21,148 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 10:45:21,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 10:45:21,207 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;@7b21490, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 10:45:21,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 10:45:21,210 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-03 10:45:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-03 10:45:21,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:21,216 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:45:21,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:21,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:21,220 INFO L85 PathProgramCache]: Analyzing trace with hash -36567605, now seen corresponding path program 1 times [2024-11-03 10:45:21,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:21,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [333326414] [2024-11-03 10:45:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:21,227 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-03 10:45:21,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:21,228 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-03 10:45:21,230 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-03 10:45:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:21,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 10:45:21,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:22,171 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-03 10:45:22,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:22,713 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-03 10:45:22,714 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:22,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [333326414] [2024-11-03 10:45:22,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [333326414] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:45:22,715 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:45:22,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2024-11-03 10:45:22,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497113510] [2024-11-03 10:45:22,717 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:45:22,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-03 10:45:22,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:22,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-03 10:45:22,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-03 10:45:22,741 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 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 10:45:27,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 10:45:31,306 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-03 10:45:35,312 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-03 10:45:39,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 10:45:43,703 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-03 10:45:47,709 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-03 10:45:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:45:47,884 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2024-11-03 10:45:47,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 10:45:47,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-11-03 10:45:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:45:47,892 INFO L225 Difference]: With dead ends: 53 [2024-11-03 10:45:47,892 INFO L226 Difference]: Without dead ends: 28 [2024-11-03 10:45:47,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-03 10:45:47,896 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2024-11-03 10:45:47,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 6 Unknown, 0 Unchecked, 25.1s Time] [2024-11-03 10:45:47,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-03 10:45:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-03 10:45:47,925 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-03 10:45:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-11-03 10:45:47,927 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 17 [2024-11-03 10:45:47,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:45:47,928 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-11-03 10:45:47,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 10:45:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-11-03 10:45:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-03 10:45:47,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:45:47,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:45:47,966 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-03 10:45:48,148 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-03 10:45:48,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:45:48,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:45:48,149 INFO L85 PathProgramCache]: Analyzing trace with hash -329970612, now seen corresponding path program 1 times [2024-11-03 10:45:48,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:45:48,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [365214734] [2024-11-03 10:45:48,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:45:48,150 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-03 10:45:48,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:45:48,153 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-03 10:45:48,154 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-03 10:45:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:45:48,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 10:45:48,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:45:49,442 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-03 10:45:49,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:45:49,861 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-03 10:45:49,861 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:45:49,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [365214734] [2024-11-03 10:45:49,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [365214734] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:45:49,862 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:45:49,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2024-11-03 10:45:49,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779487967] [2024-11-03 10:45:49,862 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:45:49,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-03 10:45:49,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:45:49,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-03 10:45:49,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-03 10:45:49,867 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-03 10:45:54,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 10:45:58,689 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-03 10:46:02,698 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-03 10:46:06,709 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-03 10:46:10,720 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-03 10:46:14,726 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-03 10:46:19,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 10:46:23,244 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-03 10:46:27,247 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-03 10:46:31,250 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-03 10:46:35,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 10:46:39,586 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-03 10:46:43,594 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-03 10:46:47,597 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-03 10:46:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:46:47,598 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2024-11-03 10:46:47,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 10:46:47,696 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-03 10:46:47,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:46:47,697 INFO L225 Difference]: With dead ends: 54 [2024-11-03 10:46:47,697 INFO L226 Difference]: Without dead ends: 33 [2024-11-03 10:46:47,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-03 10:46:47,698 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.4s 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.7s IncrementalHoareTripleChecker+Time [2024-11-03 10:46:47,699 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.7s Time] [2024-11-03 10:46:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-03 10:46:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-03 10:46:47,704 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-03 10:46:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-03 10:46:47,705 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2024-11-03 10:46:47,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:46:47,705 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-03 10:46:47,705 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-03 10:46:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-03 10:46:47,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-03 10:46:47,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:46:47,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 10:46:47,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-03 10:46:47,906 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-03 10:46:47,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:46:47,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:46:47,907 INFO L85 PathProgramCache]: Analyzing trace with hash -329911030, now seen corresponding path program 1 times [2024-11-03 10:46:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:46:47,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1947210618] [2024-11-03 10:46:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:46:47,908 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-03 10:46:47,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:46:47,909 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-03 10:46:47,910 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-03 10:46:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 10:46:48,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 10:46:48,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 10:46:48,482 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-03 10:46:48,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 10:46:48,655 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-03 10:46:48,655 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 10:46:48,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1947210618] [2024-11-03 10:46:48,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1947210618] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 10:46:48,655 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 10:46:48,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2024-11-03 10:46:48,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000463063] [2024-11-03 10:46:48,656 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 10:46:48,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-03 10:46:48,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 10:46:48,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-03 10:46:48,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-03 10:46:48,657 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-03 10:46:52,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 10:46:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 10:46:53,022 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-11-03 10:46:53,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 10:46:53,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-03 10:46:53,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 10:46:53,023 INFO L225 Difference]: With dead ends: 37 [2024-11-03 10:46:53,024 INFO L226 Difference]: Without dead ends: 26 [2024-11-03 10:46:53,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-03 10:46:53,025 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.4s IncrementalHoareTripleChecker+Time [2024-11-03 10:46:53,025 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.4s Time] [2024-11-03 10:46:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-03 10:46:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-03 10:46:53,029 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-03 10:46:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-03 10:46:53,030 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2024-11-03 10:46:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 10:46:53,030 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-03 10:46:53,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-03 10:46:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-03 10:46:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-03 10:46:53,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 10:46:53,031 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-03 10:46:53,051 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-03 10:46:53,231 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-03 10:46:53,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 10:46:53,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 10:46:53,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1979909910, now seen corresponding path program 1 times [2024-11-03 10:46:53,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 10:46:53,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1265931095] [2024-11-03 10:46:53,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 10:46:53,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-03 10:46:53,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 10:46:53,234 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-03 10:46:53,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 (5)] Waiting until timeout for monitored process [2024-11-03 10:46:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 10:46:56,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-03 10:46:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 10:46:59,220 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-03 10:46:59,220 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-03 10:46:59,221 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 10:46:59,243 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-03 10:46:59,422 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-03 10:46:59,425 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-03 10:46:59,446 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 10:46:59,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 10:46:59 BoogieIcfgContainer [2024-11-03 10:46:59,448 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 10:46:59,449 INFO L158 Benchmark]: Toolchain (without parser) took 107262.94ms. Allocated memory is still 210.8MB. Free memory was 173.9MB in the beginning and 148.8MB in the end (delta: 25.1MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. [2024-11-03 10:46:59,449 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 210.8MB. Free memory is still 169.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 10:46:59,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.85ms. Allocated memory is still 210.8MB. Free memory was 173.4MB in the beginning and 160.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-03 10:46:59,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.17ms. Allocated memory is still 210.8MB. Free memory was 160.7MB in the beginning and 158.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 10:46:59,451 INFO L158 Benchmark]: Boogie Preprocessor took 34.47ms. Allocated memory is still 210.8MB. Free memory was 158.7MB in the beginning and 156.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 10:46:59,451 INFO L158 Benchmark]: RCFGBuilder took 8632.98ms. Allocated memory is still 210.8MB. Free memory was 156.6MB in the beginning and 143.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-03 10:46:59,451 INFO L158 Benchmark]: TraceAbstraction took 98331.31ms. Allocated memory is still 210.8MB. Free memory was 142.5MB in the beginning and 148.8MB in the end (delta: -6.3MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 10:46:59,452 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.11ms. Allocated memory is still 210.8MB. Free memory is still 169.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.85ms. Allocated memory is still 210.8MB. Free memory was 173.4MB in the beginning and 160.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.17ms. Allocated memory is still 210.8MB. Free memory was 160.7MB in the beginning and 158.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.47ms. Allocated memory is still 210.8MB. Free memory was 158.7MB in the beginning and 156.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 8632.98ms. Allocated memory is still 210.8MB. Free memory was 156.6MB in the beginning and 143.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 98331.31ms. Allocated memory is still 210.8MB. Free memory was 142.5MB in the beginning and 148.8MB in the end (delta: -6.3MB). There was no memory consumed. Max. memory is 8.0GB. * 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: 98.2s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 87.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 21 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 87.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 392 SdHoareTripleChecker+Invalid, 86.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 298 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 94 mSDtfsCounter, 74 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s 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, 4.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 137 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-03 10:46:59,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...