/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/bresenham-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:42:26,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:42:26,944 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 00:42:26,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:42:26,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:42:26,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:42:26,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:42:26,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:42:26,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:42:26,979 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:42:26,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:42:26,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:42:26,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:42:26,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:42:26,980 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:42:26,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:42:26,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:42:26,980 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:42:26,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:42:26,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:42:26,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:42:26,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:42:26,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:42:26,984 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:42:26,985 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:42:26,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:42:26,985 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:42:26,985 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:42:26,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:42:26,986 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:42:26,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:42:26,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:42:26,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:42:26,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:42:26,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:42:26,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:42:26,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:42:26,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:42:26,987 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:42:26,987 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:42:26,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:42:26,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:42:26,988 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:42:26,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:42:26,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:42:26,988 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:42:26,988 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 00:42:27,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:42:27,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:42:27,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:42:27,182 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:42:27,182 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:42:27,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c [2023-12-25 00:42:28,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:42:28,255 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:42:28,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c [2023-12-25 00:42:28,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9d2119e/bdc9e90883d54318a65bee1ed52d6c10/FLAGce317d3a0 [2023-12-25 00:42:28,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9d2119e/bdc9e90883d54318a65bee1ed52d6c10 [2023-12-25 00:42:28,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:42:28,675 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:42:28,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:42:28,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:42:28,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:42:28,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:42:28" (1/1) ... [2023-12-25 00:42:28,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7137bab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28, skipping insertion in model container [2023-12-25 00:42:28,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:42:28" (1/1) ... [2023-12-25 00:42:28,695 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:42:28,783 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/bresenham-ll_valuebound1.c[597,610] [2023-12-25 00:42:28,795 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:42:28,802 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:42:28,810 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/bresenham-ll_valuebound1.c[597,610] [2023-12-25 00:42:28,816 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:42:28,824 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:42:28,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28 WrapperNode [2023-12-25 00:42:28,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:42:28,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:42:28,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:42:28,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:42:28,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28" (1/1) ... [2023-12-25 00:42:28,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28" (1/1) ... [2023-12-25 00:42:28,850 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2023-12-25 00:42:28,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:42:28,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:42:28,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:42:28,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:42:28,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28" (1/1) ... [2023-12-25 00:42:28,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28" (1/1) ... [2023-12-25 00:42:28,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28" (1/1) ... [2023-12-25 00:42:28,880 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 00:42:28,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28" (1/1) ... [2023-12-25 00:42:28,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28" (1/1) ... [2023-12-25 00:42:28,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28" (1/1) ... [2023-12-25 00:42:28,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28" (1/1) ... [2023-12-25 00:42:28,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28" (1/1) ... [2023-12-25 00:42:28,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28" (1/1) ... [2023-12-25 00:42:28,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:42:28,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:42:28,894 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:42:28,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:42:28,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28" (1/1) ... [2023-12-25 00:42:28,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:42:28,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:42:28,933 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 00:42:28,952 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 00:42:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:42:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:42:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 00:42:28,960 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 00:42:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:42:28,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:42:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 00:42:28,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 00:42:29,013 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:42:29,017 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:42:29,356 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:42:29,373 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:42:29,373 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 00:42:29,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:42:29 BoogieIcfgContainer [2023-12-25 00:42:29,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:42:29,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:42:29,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:42:29,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:42:29,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:42:28" (1/3) ... [2023-12-25 00:42:29,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5deaaed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:42:29, skipping insertion in model container [2023-12-25 00:42:29,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:42:28" (2/3) ... [2023-12-25 00:42:29,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5deaaed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:42:29, skipping insertion in model container [2023-12-25 00:42:29,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:42:29" (3/3) ... [2023-12-25 00:42:29,381 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound1.c [2023-12-25 00:42:29,401 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:42:29,401 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:42:29,426 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:42:29,430 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;@4c7caf99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:42:29,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:42:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 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 00:42:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 00:42:29,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:42:29,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:42:29,438 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:42:29,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:42:29,443 INFO L85 PathProgramCache]: Analyzing trace with hash 866122637, now seen corresponding path program 1 times [2023-12-25 00:42:29,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:42:29,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562858534] [2023-12-25 00:42:29,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:42:29,450 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 00:42:29,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:42:29,452 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 00:42:29,455 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 00:42:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:42:29,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 00:42:29,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:42:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 00:42:29,568 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:42:29,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:42:29,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562858534] [2023-12-25 00:42:29,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562858534] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:42:29,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:42:29,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 00:42:29,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819053438] [2023-12-25 00:42:29,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:42:29,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 00:42:29,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:42:29,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 00:42:29,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:42:29,591 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:42:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:42:29,610 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2023-12-25 00:42:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 00:42:29,612 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-12-25 00:42:29,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:42:29,617 INFO L225 Difference]: With dead ends: 46 [2023-12-25 00:42:29,617 INFO L226 Difference]: Without dead ends: 22 [2023-12-25 00:42:29,619 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 00:42:29,621 INFO L413 NwaCegarLoop]: 25 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, 25 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 00:42:29,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:42:29,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-25 00:42:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-25 00:42:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 00:42:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-12-25 00:42:29,644 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2023-12-25 00:42:29,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:42:29,644 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-12-25 00:42:29,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:42:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-12-25 00:42:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 00:42:29,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:42:29,645 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:42:29,653 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 00:42:29,848 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 00:42:29,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:42:29,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:42:29,849 INFO L85 PathProgramCache]: Analyzing trace with hash 266317329, now seen corresponding path program 1 times [2023-12-25 00:42:29,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:42:29,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911395155] [2023-12-25 00:42:29,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:42:29,850 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 00:42:29,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:42:29,851 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 00:42:29,852 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 00:42:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:42:29,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 00:42:29,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:42:30,387 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 00:42:30,388 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:42:30,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:42:30,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911395155] [2023-12-25 00:42:30,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911395155] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:42:30,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:42:30,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 00:42:30,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343971467] [2023-12-25 00:42:30,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:42:30,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 00:42:30,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:42:30,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 00:42:30,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 00:42:30,397 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:42:30,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:42:30,926 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2023-12-25 00:42:30,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 00:42:30,928 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-12-25 00:42:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:42:30,929 INFO L225 Difference]: With dead ends: 40 [2023-12-25 00:42:30,929 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 00:42:30,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-12-25 00:42:30,930 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 00:42:30,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 50 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 00:42:30,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 00:42:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2023-12-25 00:42:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 00:42:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-12-25 00:42:30,936 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2023-12-25 00:42:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:42:30,937 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-12-25 00:42:30,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 00:42:30,937 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-12-25 00:42:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-25 00:42:30,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:42:30,937 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:42:30,942 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 00:42:31,142 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 00:42:31,143 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:42:31,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:42:31,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1056709002, now seen corresponding path program 1 times [2023-12-25 00:42:31,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:42:31,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930243201] [2023-12-25 00:42:31,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:42:31,144 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 00:42:31,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:42:31,146 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 00:42:31,152 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 00:42:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:42:31,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 00:42:31,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:42:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 00:42:32,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:42:38,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:42:38,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930243201] [2023-12-25 00:42:38,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930243201] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 00:42:38,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [337276801] [2023-12-25 00:42:38,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:42:38,810 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 00:42:38,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 00:42:38,855 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 00:42:38,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-25 00:42:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:42:39,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 00:42:39,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:42:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 00:42:42,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:43:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 00:43:11,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [337276801] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:43:11,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 00:43:11,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 22 [2023-12-25 00:43:11,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114862724] [2023-12-25 00:43:11,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 00:43:11,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 00:43:11,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:43:11,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 00:43:11,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2023-12-25 00:43:11,982 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 22 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-25 00:43:37,042 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 00:43:43,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:43:43,629 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2023-12-25 00:43:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 00:43:43,644 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 27 [2023-12-25 00:43:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:43:43,645 INFO L225 Difference]: With dead ends: 68 [2023-12-25 00:43:43,645 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 00:43:43,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 53.2s TimeCoverageRelationStatistics Valid=268, Invalid=992, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 00:43:43,647 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2023-12-25 00:43:43,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 123 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 264 Invalid, 1 Unknown, 0 Unchecked, 11.6s Time] [2023-12-25 00:43:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 00:43:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2023-12-25 00:43:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 00:43:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-12-25 00:43:43,656 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 27 [2023-12-25 00:43:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:43:43,656 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-12-25 00:43:43,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 8 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-25 00:43:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-12-25 00:43:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 00:43:43,657 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:43:43,657 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:43:43,664 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 (4)] Ended with exit code 0 [2023-12-25 00:43:43,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2023-12-25 00:43:44,057 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 00:43:44,058 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:43:44,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:43:44,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2017352516, now seen corresponding path program 1 times [2023-12-25 00:43:44,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:43:44,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615518154] [2023-12-25 00:43:44,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:43:44,059 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 00:43:44,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:43:44,060 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:43:44,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 00:43:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:43:44,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-25 00:43:44,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:43:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 00:43:48,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:44:13,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:44:13,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615518154] [2023-12-25 00:44:13,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615518154] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 00:44:13,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1638040678] [2023-12-25 00:44:13,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:44:13,602 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 00:44:13,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 00:44:13,603 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 00:44:13,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-25 00:44:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:44:13,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 00:44:13,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:44:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 00:44:17,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:45:20,973 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 00:45:25,325 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 32) |c_ULTIMATE.start_main_~Y~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~X~0#1|))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~x~0#1| (_ bv1 64))) (.cse2 (bvneg .cse1)) (.cse5 (bvmul (_ bv2 64) .cse3)) (.cse4 (bvmul (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~x~0#1| .cse3)))) (or (bvsle .cse0 .cse1) (= (_ bv0 64) (bvadd (bvneg (bvmul (bvmul (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv1 64)) .cse0) (_ bv2 64))) .cse2 (_ bv2 64) (bvmul |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)) (bvmul .cse3 (_ bv4 64)) .cse4 (bvneg (bvadd .cse5 |c_ULTIMATE.start_main_~v~0#1| (bvmul .cse2 (_ bv2 64)))))) (not (= (_ bv0 64) (bvadd (bvneg |c_ULTIMATE.start_main_~v~0#1|) .cse2 .cse5 (bvneg (bvmul (bvmul |c_ULTIMATE.start_main_~y~0#1| .cse1) (_ bv2 64))) .cse4))) (bvslt |c_ULTIMATE.start_main_~v~0#1| (_ bv0 64)) (not (bvsle |c_ULTIMATE.start_main_~x~0#1| .cse1))))) is different from true [2023-12-25 00:45:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2023-12-25 00:45:25,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1638040678] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:45:25,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 00:45:25,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 13] total 31 [2023-12-25 00:45:25,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526771028] [2023-12-25 00:45:25,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 00:45:25,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-25 00:45:25,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:45:25,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-25 00:45:25,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=786, Unknown=2, NotChecked=58, Total=992 [2023-12-25 00:45:25,387 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 31 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 10 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2023-12-25 00:45:56,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:46:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:46:51,132 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2023-12-25 00:46:51,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-25 00:46:51,158 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 10 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) Word has length 34 [2023-12-25 00:46:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:46:51,159 INFO L225 Difference]: With dead ends: 74 [2023-12-25 00:46:51,159 INFO L226 Difference]: Without dead ends: 44 [2023-12-25 00:46:51,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 128.3s TimeCoverageRelationStatistics Valid=374, Invalid=1884, Unknown=2, NotChecked=92, Total=2352 [2023-12-25 00:46:51,160 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 72 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2023-12-25 00:46:51,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 121 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 292 Invalid, 0 Unknown, 50 Unchecked, 19.1s Time] [2023-12-25 00:46:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-25 00:46:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2023-12-25 00:46:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 00:46:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-12-25 00:46:51,168 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 34 [2023-12-25 00:46:51,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:46:51,169 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-12-25 00:46:51,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 10 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 8 states have call successors, (11) [2023-12-25 00:46:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-12-25 00:46:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-25 00:46:51,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:46:51,169 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:46:51,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-12-25 00:46:51,385 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 (6)] Forceful destruction successful, exit code 0 [2023-12-25 00:46:51,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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 00:46:51,577 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:46:51,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:46:51,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1224179215, now seen corresponding path program 1 times [2023-12-25 00:46:51,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:46:51,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870268459] [2023-12-25 00:46:51,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:46:51,578 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 00:46:51,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:46:51,579 INFO L229 MonitoredProcess]: Starting monitored process 8 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 00:46:51,580 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 (8)] Waiting until timeout for monitored process [2023-12-25 00:46:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:46:51,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 00:46:51,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:46:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 00:46:58,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:47:36,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:47:36,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870268459] [2023-12-25 00:47:36,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870268459] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 00:47:36,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [74373401] [2023-12-25 00:47:36,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:47:36,877 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 00:47:36,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 00:47:36,878 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 00:47:36,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-25 00:47:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:47:37,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 00:47:37,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:47:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 00:47:42,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:48:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 00:48:35,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [74373401] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:48:35,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 00:48:35,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 13] total 34 [2023-12-25 00:48:35,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921222086] [2023-12-25 00:48:35,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 00:48:35,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-25 00:48:35,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:48:35,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-25 00:48:35,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=995, Unknown=1, NotChecked=0, Total=1190 [2023-12-25 00:48:35,358 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 34 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 31 states have internal predecessors, (50), 11 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-25 00:48:48,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:48:48,405 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2023-12-25 00:48:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 00:48:48,408 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 31 states have internal predecessors, (50), 11 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 36 [2023-12-25 00:48:48,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:48:48,408 INFO L225 Difference]: With dead ends: 51 [2023-12-25 00:48:48,408 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 00:48:48,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 91.5s TimeCoverageRelationStatistics Valid=280, Invalid=1441, Unknown=1, NotChecked=0, Total=1722 [2023-12-25 00:48:48,409 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-25 00:48:48,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 101 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-25 00:48:48,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 00:48:48,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 00:48:48,410 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 00:48:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 00:48:48,410 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2023-12-25 00:48:48,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:48:48,410 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 00:48:48,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 31 states have internal predecessors, (50), 11 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-25 00:48:48,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 00:48:48,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 00:48:48,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 00:48:48,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2023-12-25 00:48:48,631 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 (8)] Forceful destruction successful, exit code 0 [2023-12-25 00:48:48,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /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 00:48:48,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 00:48:57,001 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 81 DAG size of output: 68 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 00:49:14,085 WARN L293 SmtUtils]: Spent 17.06s on a formula simplification. DAG size of input: 95 DAG size of output: 59 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 00:49:21,665 WARN L293 SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 93 DAG size of output: 71 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 00:49:21,668 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 00:49:21,669 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~X~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~X~0#1| (_ bv1 32))) [2023-12-25 00:49:21,669 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2023-12-25 00:49:21,669 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2023-12-25 00:49:21,669 INFO L899 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2023-12-25 00:49:21,669 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse5 ((_ sign_extend 32) |ULTIMATE.start_main_~X~0#1|)) (.cse8 ((_ sign_extend 32) |ULTIMATE.start_main_~Y~0#1|))) (let ((.cse1 (bvneg |ULTIMATE.start_main_~v~0#1|)) (.cse0 (bvmul (_ bv2 64) (bvmul |ULTIMATE.start_main_~x~0#1| .cse8))) (.cse2 (bvmul (_ bv2 64) .cse8)) (.cse3 (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64))) (.cse4 (bvneg .cse5)) (.cse6 (not (bvsle |ULTIMATE.start_main_~x~0#1| .cse5)))) (and (= (_ bv0 64) (bvadd .cse0 .cse1 .cse2 .cse3 (bvneg (bvmul (_ bv2 64) (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~x~0#1|))) .cse4)) (bvsge |ULTIMATE.start_main_~X~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~Y~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~X~0#1| (_ bv1 32)) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~yx~0#1| (_ bv2 64)) .cse1 .cse2 .cse3 .cse4 (bvneg (bvmul |ULTIMATE.start_main_~xy~0#1| (_ bv2 64))))) (or (not (bvslt |ULTIMATE.start_main_~v~0#1| (_ bv0 64))) (= (_ bv0 64) (bvadd .cse0 .cse1 .cse2 (bvneg (bvmul (bvmul |ULTIMATE.start_main_~y~0#1| .cse5) (_ bv2 64))) .cse4)) .cse6) (let ((.cse7 (bvadd |ULTIMATE.start_main_~x~0#1| (_ bv1 64)))) (or (bvsle .cse7 .cse5) (= (bvadd .cse0 (bvneg (bvmul (_ bv2 64) (bvmul (bvadd |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) .cse7))) (bvneg (bvadd (bvmul (_ bv2 64) .cse4) |ULTIMATE.start_main_~v~0#1| .cse2)) (_ bv2 64) (bvmul (_ bv4 64) .cse8) .cse3 .cse4) (_ bv0 64)) .cse6)) (bvsle |ULTIMATE.start_main_~Y~0#1| (_ bv1 32))))) [2023-12-25 00:49:21,669 INFO L899 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2023-12-25 00:49:21,669 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 00:49:21,669 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 45) no Hoare annotation was computed. [2023-12-25 00:49:21,669 INFO L899 garLoopResultBuilder]: For program point L40-2(lines 40 45) no Hoare annotation was computed. [2023-12-25 00:49:21,670 INFO L895 garLoopResultBuilder]: At program point L32-2(lines 32 47) the Hoare annotation is: (let ((.cse14 ((_ sign_extend 32) |ULTIMATE.start_main_~X~0#1|)) (.cse15 ((_ sign_extend 32) |ULTIMATE.start_main_~Y~0#1|))) (let ((.cse12 (bvneg |ULTIMATE.start_main_~v~0#1|)) (.cse17 (bvmul (_ bv2 64) .cse15)) (.cse11 (bvmul (_ bv18446744073709551614 64) .cse15)) (.cse13 (bvmul (_ bv4 64) .cse15)) (.cse10 (bvneg .cse14))) (let ((.cse7 (bvsge |ULTIMATE.start_main_~X~0#1| (_ bv0 32))) (.cse5 (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64))) (.cse0 (= |ULTIMATE.start_main_~v~0#1| (bvadd .cse13 .cse10))) (.cse1 (bvslt (bvadd |ULTIMATE.start_main_~v~0#1| .cse11) (_ bv0 64))) (.cse2 (bvsge |ULTIMATE.start_main_~Y~0#1| (_ bv0 32))) (.cse3 (bvsle |ULTIMATE.start_main_~X~0#1| (_ bv1 32))) (.cse4 (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|)) (.cse8 (bvadd .cse17 .cse10)) (.cse6 (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~yx~0#1| (_ bv2 64)) .cse12 .cse17 .cse10 (bvneg (bvmul |ULTIMATE.start_main_~xy~0#1| (_ bv2 64)))))) (.cse9 (bvsle |ULTIMATE.start_main_~Y~0#1| (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse3 (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) .cse4 (= |ULTIMATE.start_main_~v~0#1| .cse8) .cse9) (and .cse7 (not (bvslt (bvadd (bvmul (_ bv18446744073709551614 64) .cse10) |ULTIMATE.start_main_~v~0#1| .cse11) (_ bv0 64))) .cse3 (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) .cse5 (= (_ bv0 64) (bvadd .cse12 .cse13 .cse10 (bvneg (bvmul (_ bv2 64) .cse14)))) .cse9) (and (= (_ bv0 64) |ULTIMATE.start_main_~xy~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~yx~0#1| .cse15)) (let ((.cse16 (bvmul .cse15 (_ bv6 64)))) (and (not (bvslt .cse8 (_ bv0 64))) (= |ULTIMATE.start_main_~v~0#1| (bvadd .cse16 (bvmul .cse10 (_ bv5 64)))) (= |ULTIMATE.start_main_~y~0#1| (_ bv2 64)) (= (bvadd .cse12 .cse16 .cse10) (_ bv4 64)) .cse6 .cse9 (= |ULTIMATE.start_main_~x~0#1| (_ bv2 64)))))))) [2023-12-25 00:49:21,670 INFO L899 garLoopResultBuilder]: For program point L32-3(lines 32 47) no Hoare annotation was computed. [2023-12-25 00:49:21,670 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse14 ((_ sign_extend 32) |ULTIMATE.start_main_~X~0#1|)) (.cse13 ((_ sign_extend 32) |ULTIMATE.start_main_~Y~0#1|))) (let ((.cse0 (bvsge |ULTIMATE.start_main_~X~0#1| (_ bv0 32))) (.cse7 (bvmul (_ bv2 64) .cse13)) (.cse4 (bvneg |ULTIMATE.start_main_~v~0#1|)) (.cse6 (bvmul (_ bv2 64) .cse14)) (.cse8 (bvsle |ULTIMATE.start_main_~Y~0#1| (_ bv1 32))) (.cse9 (= (_ bv0 64) |ULTIMATE.start_main_~xy~0#1|)) (.cse5 (bvmul (_ bv4 64) .cse13)) (.cse1 (bvneg .cse14)) (.cse2 (bvmul (_ bv18446744073709551614 64) .cse13)) (.cse10 (bvsge |ULTIMATE.start_main_~Y~0#1| (_ bv0 32))) (.cse3 (bvsle |ULTIMATE.start_main_~X~0#1| (_ bv1 32))) (.cse11 (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|))) (or (and .cse0 (not (bvslt (bvadd (bvmul (_ bv18446744073709551614 64) .cse1) |ULTIMATE.start_main_~v~0#1| .cse2) (_ bv0 64))) .cse3 (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (= (_ bv0 64) (bvadd .cse4 .cse5 .cse1 (bvneg .cse6))) (= (_ bv0 64) (bvadd (bvmul |ULTIMATE.start_main_~yx~0#1| (_ bv2 64)) .cse4 .cse7 .cse1 (bvneg (bvmul |ULTIMATE.start_main_~xy~0#1| (_ bv2 64))))) .cse8) (and .cse9 .cse0 .cse10 .cse3 (= |ULTIMATE.start_main_~yx~0#1| (_ bv0 64)) (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) .cse11 (= (_ bv0 64) (bvadd .cse4 .cse7 .cse1)) .cse8) (let ((.cse12 (bvmul .cse13 (_ bv6 64)))) (and (not (bvslt (bvadd .cse7 .cse1) (_ bv0 64))) (= |ULTIMATE.start_main_~v~0#1| (bvadd .cse12 (bvmul .cse1 (_ bv5 64)))) (= |ULTIMATE.start_main_~yx~0#1| .cse7) (= |ULTIMATE.start_main_~y~0#1| (_ bv2 64)) (= (bvadd .cse4 .cse12 .cse1) (_ bv4 64)) (= |ULTIMATE.start_main_~xy~0#1| .cse6) .cse8 (= |ULTIMATE.start_main_~x~0#1| (_ bv2 64)))) (and .cse9 (= |ULTIMATE.start_main_~v~0#1| (bvadd .cse5 .cse1)) (bvslt (bvadd |ULTIMATE.start_main_~v~0#1| .cse2) (_ bv0 64)) .cse10 .cse3 .cse11 (= |ULTIMATE.start_main_~yx~0#1| .cse13))))) [2023-12-25 00:49:21,670 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 32 47) no Hoare annotation was computed. [2023-12-25 00:49:21,670 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2023-12-25 00:49:21,670 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 10 12) the Hoare annotation is: true [2023-12-25 00:49:21,670 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 12) no Hoare annotation was computed. [2023-12-25 00:49:21,670 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 10 12) no Hoare annotation was computed. [2023-12-25 00:49:21,670 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 16) no Hoare annotation was computed. [2023-12-25 00:49:21,670 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 17) no Hoare annotation was computed. [2023-12-25 00:49:21,670 INFO L899 garLoopResultBuilder]: For program point L14-2(lines 13 19) no Hoare annotation was computed. [2023-12-25 00:49:21,670 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 13 19) no Hoare annotation was computed. [2023-12-25 00:49:21,671 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 13 19) the Hoare annotation is: true [2023-12-25 00:49:21,671 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2023-12-25 00:49:21,673 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-25 00:49:21,675 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 00:49:21,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 12:49:21 BoogieIcfgContainer [2023-12-25 00:49:21,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 00:49:21,690 INFO L158 Benchmark]: Toolchain (without parser) took 413015.00ms. Allocated memory was 292.6MB in the beginning and 351.3MB in the end (delta: 58.7MB). Free memory was 244.9MB in the beginning and 272.1MB in the end (delta: -27.1MB). Peak memory consumption was 194.5MB. Max. memory is 8.0GB. [2023-12-25 00:49:21,690 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 204.5MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 00:49:21,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.83ms. Allocated memory is still 292.6MB. Free memory was 244.9MB in the beginning and 233.2MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 00:49:21,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.33ms. Allocated memory is still 292.6MB. Free memory was 233.2MB in the beginning and 231.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 00:49:21,691 INFO L158 Benchmark]: Boogie Preprocessor took 42.26ms. Allocated memory is still 292.6MB. Free memory was 231.6MB in the beginning and 229.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 00:49:21,691 INFO L158 Benchmark]: RCFGBuilder took 479.65ms. Allocated memory is still 292.6MB. Free memory was 229.5MB in the beginning and 216.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 00:49:21,692 INFO L158 Benchmark]: TraceAbstraction took 412312.80ms. Allocated memory was 292.6MB in the beginning and 351.3MB in the end (delta: 58.7MB). Free memory was 215.9MB in the beginning and 272.1MB in the end (delta: -56.2MB). Peak memory consumption was 166.1MB. Max. memory is 8.0GB. [2023-12-25 00:49:21,694 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.41ms. Allocated memory is still 204.5MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 147.83ms. Allocated memory is still 292.6MB. Free memory was 244.9MB in the beginning and 233.2MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.33ms. Allocated memory is still 292.6MB. Free memory was 233.2MB in the beginning and 231.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.26ms. Allocated memory is still 292.6MB. Free memory was 231.6MB in the beginning and 229.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 479.65ms. Allocated memory is still 292.6MB. Free memory was 229.5MB in the beginning and 216.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 412312.80ms. Allocated memory was 292.6MB in the beginning and 351.3MB in the end (delta: 58.7MB). Free memory was 215.9MB in the beginning and 272.1MB in the end (delta: -56.2MB). Peak memory consumption was 166.1MB. 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: 16]: 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, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 412.3s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 131.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 32.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 36.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 420 SdHoareTripleChecker+Invalid, 33.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 50 IncrementalHoareTripleChecker+Unchecked, 354 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 940 IncrementalHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 66 mSDtfsCounter, 940 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 241 SyntacticMatches, 8 SemanticMatches, 132 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 273.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=4, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 27 PreInvPairs, 41 NumberOfFragments, 583 HoareAnnotationTreeSize, 27 FormulaSimplifications, 275 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FormulaSimplificationsInter, 398 FormulaSimplificationTreeSizeReductionInter, 32.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 245.0s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 316 ConstructedInterpolants, 1 QuantifiedInterpolants, 3665 SizeOfPredicates, 48 NumberOfNonLiveVariables, 434 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 89/140 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: 32]: Loop Invariant Derived loop invariant: (((((((((((v == (((4 * Y) + -(X)) % 1)) && (((v + (-2 * Y)) % 1) < 0)) && (Y >= 0)) && (X <= 1)) && (0 == y)) && (x == 1)) && (0 == (((x * 2) + -(v)) % 1))) || (((((((X >= 0) && (Y >= 0)) && (X <= 1)) && (0 == x)) && (0 == y)) && (v == (((2 * Y) + -(X)) % 1))) && (Y <= 1))) || (((((((X >= 0) && !(((((-2 * -(X)) + v) % 1) < 0))) && (X <= 1)) && (y == 1)) && (x == 1)) && (0 == ((-(v) + (4 * Y)) % 1))) && (Y <= 1))) || (((((((0 == x) && (v == (((4 * Y) + -(X)) % 1))) && (((v + (-2 * Y)) % 1) < 0)) && (Y >= 0)) && (X <= 1)) && (0 == y)) && (x == Y))) || ((((((!(((((2 * Y) + -(X)) % 1) < 0)) && (v == (((Y * 6) + (-(X) * 5)) % 1))) && (y == 2)) && (((-(v) + (Y * 6)) % 1) == 4)) && (0 == (((x * 2) + -(v)) % 1))) && (Y <= 1)) && (x == 2))) RESULT: Ultimate proved your program to be correct! [2023-12-25 00:49:21,775 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...