/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 02:59:28,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 02:59:28,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 02:59:28,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 02:59:28,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 02:59:28,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 02:59:28,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 02:59:28,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 02:59:28,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 02:59:28,734 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 02:59:28,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 02:59:28,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 02:59:28,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 02:59:28,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 02:59:28,737 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 02:59:28,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 02:59:28,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 02:59:28,738 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 02:59:28,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 02:59:28,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 02:59:28,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 02:59:28,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 02:59:28,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 02:59:28,739 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 02:59:28,740 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 02:59:28,740 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 02:59:28,740 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 02:59:28,740 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 02:59:28,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 02:59:28,741 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 02:59:28,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 02:59:28,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 02:59:28,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 02:59:28,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 02:59:28,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 02:59:28,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 02:59:28,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 02:59:28,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 02:59:28,743 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 02:59:28,743 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 02:59:28,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 02:59:28,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 02:59:28,744 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 02:59:28,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 02:59:28,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 02:59:28,744 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 02:59:28,744 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 [2023-12-25 02:59:28,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 02:59:29,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 02:59:29,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 02:59:29,018 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 02:59:29,018 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 02:59:29,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound2.c [2023-12-25 02:59:30,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 02:59:30,349 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 02:59:30,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound2.c [2023-12-25 02:59:30,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d20ca287/6980a9bb3b67495f8787b7aa935c852c/FLAG012d72c2f [2023-12-25 02:59:30,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d20ca287/6980a9bb3b67495f8787b7aa935c852c [2023-12-25 02:59:30,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 02:59:30,370 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 02:59:30,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 02:59:30,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 02:59:30,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 02:59:30,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 02:59:30" (1/1) ... [2023-12-25 02:59:30,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4b5a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30, skipping insertion in model container [2023-12-25 02:59:30,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 02:59:30" (1/1) ... [2023-12-25 02:59:30,402 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 02:59:30,528 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound2.c[524,537] [2023-12-25 02:59:30,541 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 02:59:30,555 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 02:59:30,566 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound2.c[524,537] [2023-12-25 02:59:30,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 02:59:30,583 INFO L206 MainTranslator]: Completed translation [2023-12-25 02:59:30,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30 WrapperNode [2023-12-25 02:59:30,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 02:59:30,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 02:59:30,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 02:59:30,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 02:59:30,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30" (1/1) ... [2023-12-25 02:59:30,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30" (1/1) ... [2023-12-25 02:59:30,614 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2023-12-25 02:59:30,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 02:59:30,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 02:59:30,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 02:59:30,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 02:59:30,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30" (1/1) ... [2023-12-25 02:59:30,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30" (1/1) ... [2023-12-25 02:59:30,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30" (1/1) ... [2023-12-25 02:59:30,643 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]. [2023-12-25 02:59:30,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30" (1/1) ... [2023-12-25 02:59:30,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30" (1/1) ... [2023-12-25 02:59:30,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30" (1/1) ... [2023-12-25 02:59:30,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30" (1/1) ... [2023-12-25 02:59:30,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30" (1/1) ... [2023-12-25 02:59:30,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30" (1/1) ... [2023-12-25 02:59:30,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 02:59:30,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 02:59:30,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 02:59:30,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 02:59:30,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30" (1/1) ... [2023-12-25 02:59:30,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 02:59:30,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 02:59:30,702 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) [2023-12-25 02:59:30,730 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 [2023-12-25 02:59:30,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 02:59:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 02:59:30,738 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 02:59:30,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 02:59:30,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 02:59:30,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 02:59:30,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 02:59:30,741 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 02:59:30,801 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 02:59:30,806 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 02:59:31,133 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 02:59:31,156 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 02:59:31,156 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 02:59:31,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 02:59:31 BoogieIcfgContainer [2023-12-25 02:59:31,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 02:59:31,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 02:59:31,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 02:59:31,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 02:59:31,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 02:59:30" (1/3) ... [2023-12-25 02:59:31,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a3af3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 02:59:31, skipping insertion in model container [2023-12-25 02:59:31,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 02:59:30" (2/3) ... [2023-12-25 02:59:31,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a3af3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 02:59:31, skipping insertion in model container [2023-12-25 02:59:31,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 02:59:31" (3/3) ... [2023-12-25 02:59:31,165 INFO L112 eAbstractionObserver]: Analyzing ICFG geo2-ll_valuebound2.c [2023-12-25 02:59:31,182 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 02:59:31,182 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 02:59:31,233 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 02:59:31,238 INFO L357 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, mHoare=true, 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;@6afaffa8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 02:59:31,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 02:59:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 02:59:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 02:59:31,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:59:31,260 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:59:31,260 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:59:31,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:59:31,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1508852555, now seen corresponding path program 1 times [2023-12-25 02:59:31,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:59:31,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455570906] [2023-12-25 02:59:31,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:59:31,281 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 [2023-12-25 02:59:31,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:59:31,288 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) [2023-12-25 02:59:31,307 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 [2023-12-25 02:59:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:59:31,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 02:59:31,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:59:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 02:59:31,431 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 02:59:31,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:59:31,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455570906] [2023-12-25 02:59:31,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455570906] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 02:59:31,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 02:59:31,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 02:59:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607752602] [2023-12-25 02:59:31,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:59:31,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 02:59:31,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:59:31,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 02:59:31,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 02:59:31,472 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 02:59:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:59:31,496 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2023-12-25 02:59:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 02:59:31,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-25 02:59:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:59:31,503 INFO L225 Difference]: With dead ends: 40 [2023-12-25 02:59:31,503 INFO L226 Difference]: Without dead ends: 19 [2023-12-25 02:59:31,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 02:59:31,509 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 02:59:31,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 02:59:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-25 02:59:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-25 02:59:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 02:59:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-12-25 02:59:31,539 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 18 [2023-12-25 02:59:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:59:31,539 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-12-25 02:59:31,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 02:59:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-12-25 02:59:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 02:59:31,541 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:59:31,541 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:59:31,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 02:59:31,748 WARN L477 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 [2023-12-25 02:59:31,748 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:59:31,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:59:31,749 INFO L85 PathProgramCache]: Analyzing trace with hash 901599497, now seen corresponding path program 1 times [2023-12-25 02:59:31,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:59:31,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687300619] [2023-12-25 02:59:31,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:59:31,750 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 [2023-12-25 02:59:31,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:59:31,752 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) [2023-12-25 02:59:31,753 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 [2023-12-25 02:59:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:59:31,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 02:59:31,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:59:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 02:59:32,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 02:59:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 02:59:34,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 02:59:34,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687300619] [2023-12-25 02:59:34,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687300619] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 02:59:34,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 02:59:34,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-25 02:59:34,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108696045] [2023-12-25 02:59:34,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 02:59:34,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 02:59:34,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 02:59:34,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 02:59:34,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-25 02:59:34,936 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 02:59:39,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 02:59:41,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 02:59:41,310 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-12-25 02:59:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 02:59:41,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-25 02:59:41,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 02:59:41,323 INFO L225 Difference]: With dead ends: 29 [2023-12-25 02:59:41,323 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 02:59:41,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 02:59:41,325 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-25 02:59:41,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 61 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2023-12-25 02:59:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 02:59:41,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-25 02:59:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 02:59:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2023-12-25 02:59:41,333 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2023-12-25 02:59:41,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 02:59:41,334 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2023-12-25 02:59:41,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 02:59:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2023-12-25 02:59:41,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 02:59:41,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 02:59:41,335 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 02:59:41,349 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 [2023-12-25 02:59:41,536 WARN L477 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 [2023-12-25 02:59:41,536 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 02:59:41,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 02:59:41,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1808695034, now seen corresponding path program 1 times [2023-12-25 02:59:41,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 02:59:41,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658826844] [2023-12-25 02:59:41,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 02:59:41,538 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 [2023-12-25 02:59:41,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 02:59:41,539 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) [2023-12-25 02:59:41,564 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 [2023-12-25 02:59:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 02:59:41,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 02:59:41,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 02:59:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 02:59:42,255 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 03:00:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 03:00:07,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 03:00:07,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658826844] [2023-12-25 03:00:07,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658826844] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 03:00:07,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 03:00:07,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2023-12-25 03:00:07,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007703219] [2023-12-25 03:00:07,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 03:00:07,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 03:00:07,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 03:00:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 03:00:07,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2023-12-25 03:00:07,424 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 03:00:10,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:00:14,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:00:24,754 WARN L293 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 03:00:29,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 03:00:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 03:00:34,336 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2023-12-25 03:00:34,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 03:00:34,376 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2023-12-25 03:00:34,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 03:00:34,376 INFO L225 Difference]: With dead ends: 30 [2023-12-25 03:00:34,376 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 03:00:34,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=48, Invalid=191, Unknown=1, NotChecked=0, Total=240 [2023-12-25 03:00:34,378 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2023-12-25 03:00:34,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 103 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 1 Unknown, 0 Unchecked, 11.7s Time] [2023-12-25 03:00:34,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 03:00:34,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 03:00:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 03:00:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 03:00:34,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2023-12-25 03:00:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 03:00:34,380 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 03:00:34,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-25 03:00:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 03:00:34,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 03:00:34,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 03:00:34,392 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 [2023-12-25 03:00:34,592 WARN L477 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 [2023-12-25 03:00:34,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 03:00:49,069 WARN L293 SmtUtils]: Spent 14.43s on a formula simplification. DAG size of input: 35 DAG size of output: 24 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 03:01:03,301 WARN L293 SmtUtils]: Spent 14.23s on a formula simplification. DAG size of input: 35 DAG size of output: 24 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 03:01:04,432 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 44) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~z~0#1|))) (let ((.cse1 (bvmul |ULTIMATE.start_main_~y~0#1| .cse0)) (.cse2 (bvmul |ULTIMATE.start_main_~x~0#1| .cse0))) (and (bvsge |ULTIMATE.start_main_~z~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~z~0#1| (_ bv2 32)) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~x~0#1| .cse0 .cse0) (bvneg (bvmul .cse1 .cse0)) (_ bv1 64) (bvneg (bvadd .cse2 (_ bv1 64))) .cse0)) (= (_ bv0 64) (bvadd (bvneg .cse1) .cse2 (_ bv1 64) (bvneg |ULTIMATE.start_main_~x~0#1|)))))) [2023-12-25 03:01:04,432 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 03:01:04,432 INFO L895 garLoopResultBuilder]: At program point L35-3(lines 35 44) the Hoare annotation is: (= (_ bv0 64) (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~z~0#1|))) (bvadd (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| .cse0)) (bvmul |ULTIMATE.start_main_~x~0#1| .cse0) (_ bv1 64) (bvneg |ULTIMATE.start_main_~x~0#1|)))) [2023-12-25 03:01:04,432 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~z~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~z~0#1| (_ bv2 32))) [2023-12-25 03:01:04,432 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2023-12-25 03:01:04,433 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2023-12-25 03:01:04,433 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2023-12-25 03:01:04,433 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 03:01:04,433 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~z~0#1|))) (let ((.cse1 (bvmul |ULTIMATE.start_main_~y~0#1| .cse0)) (.cse2 (bvmul |ULTIMATE.start_main_~x~0#1| .cse0))) (and (bvsge |ULTIMATE.start_main_~z~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~z~0#1| (_ bv2 32)) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~x~0#1| .cse0 .cse0) (bvneg (bvmul .cse1 .cse0)) (_ bv1 64) (bvneg (bvadd .cse2 (_ bv1 64))) .cse0)) (= (_ bv0 64) (bvadd (bvneg .cse1) .cse2 (_ bv1 64) (bvneg |ULTIMATE.start_main_~x~0#1|)))))) [2023-12-25 03:01:04,433 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 35 44) no Hoare annotation was computed. [2023-12-25 03:01:04,433 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-12-25 03:01:04,433 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-12-25 03:01:04,434 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2023-12-25 03:01:04,434 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 13) the Hoare annotation is: true [2023-12-25 03:01:04,434 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2023-12-25 03:01:04,434 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-12-25 03:01:04,434 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-12-25 03:01:04,434 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-12-25 03:01:04,434 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-12-25 03:01:04,434 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-12-25 03:01:04,435 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-12-25 03:01:04,438 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-25 03:01:04,444 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 03:01:04,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 03:01:04 BoogieIcfgContainer [2023-12-25 03:01:04,460 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 03:01:04,462 INFO L158 Benchmark]: Toolchain (without parser) took 94091.17ms. Allocated memory is still 275.8MB. Free memory was 223.4MB in the beginning and 123.7MB in the end (delta: 99.7MB). Peak memory consumption was 100.6MB. Max. memory is 8.0GB. [2023-12-25 03:01:04,462 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 198.2MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 03:01:04,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.11ms. Allocated memory is still 275.8MB. Free memory was 223.4MB in the beginning and 211.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 03:01:04,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.81ms. Allocated memory is still 275.8MB. Free memory was 211.9MB in the beginning and 210.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 03:01:04,463 INFO L158 Benchmark]: Boogie Preprocessor took 40.41ms. Allocated memory is still 275.8MB. Free memory was 210.4MB in the beginning and 208.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 03:01:04,463 INFO L158 Benchmark]: RCFGBuilder took 501.12ms. Allocated memory is still 275.8MB. Free memory was 208.6MB in the beginning and 196.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 03:01:04,463 INFO L158 Benchmark]: TraceAbstraction took 93302.42ms. Allocated memory is still 275.8MB. Free memory was 196.2MB in the beginning and 123.7MB in the end (delta: 72.4MB). Peak memory consumption was 73.3MB. Max. memory is 8.0GB. [2023-12-25 03:01:04,465 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.19ms. Allocated memory is still 198.2MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.11ms. Allocated memory is still 275.8MB. Free memory was 223.4MB in the beginning and 211.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.81ms. Allocated memory is still 275.8MB. Free memory was 211.9MB in the beginning and 210.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.41ms. Allocated memory is still 275.8MB. Free memory was 210.4MB in the beginning and 208.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 501.12ms. Allocated memory is still 275.8MB. Free memory was 208.6MB in the beginning and 196.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 93302.42ms. Allocated memory is still 275.8MB. Free memory was 196.2MB in the beginning and 123.7MB in the end (delta: 72.4MB). Peak memory consumption was 73.3MB. 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 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 93.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 33.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 29.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 18.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 185 SdHoareTripleChecker+Invalid, 17.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 50 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 38.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, InterpolantAutomatonStates: 18, 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: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 16 PreInvPairs, 26 NumberOfFragments, 123 HoareAnnotationTreeSize, 16 FormulaSimplifications, 68 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FormulaSimplificationsInter, 96 FormulaSimplificationTreeSizeReductionInter, 29.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 28.8s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 397 SizeOfPredicates, 4 NumberOfNonLiveVariables, 123 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 18/28 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((z >= 0) && (z <= 2)) && (0 == (((x * z) + -(((y * z) * z))) % 1))) && (0 == ((-((y * z)) + (x * z)) % 1))) RESULT: Ultimate proved your program to be correct! [2023-12-25 03:01:04,535 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...