/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/prod4br-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 04:25:54,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 04:25:55,058 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 04:25:55,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 04:25:55,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 04:25:55,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 04:25:55,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 04:25:55,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 04:25:55,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 04:25:55,088 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 04:25:55,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 04:25:55,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 04:25:55,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 04:25:55,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 04:25:55,090 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 04:25:55,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 04:25:55,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 04:25:55,090 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 04:25:55,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 04:25:55,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 04:25:55,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 04:25:55,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 04:25:55,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 04:25:55,092 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 04:25:55,092 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 04:25:55,092 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 04:25:55,092 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 04:25:55,092 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 04:25:55,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 04:25:55,093 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 04:25:55,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 04:25:55,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 04:25:55,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 04:25:55,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 04:25:55,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:25:55,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 04:25:55,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 04:25:55,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 04:25:55,095 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 04:25:55,095 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 04:25:55,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 04:25:55,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 04:25:55,095 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 04:25:55,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 04:25:55,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 04:25:55,096 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 04:25:55,096 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 04:25:55,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 04:25:55,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 04:25:55,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 04:25:55,300 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 04:25:55,300 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 04:25:55,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound5.c [2023-12-25 04:25:56,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 04:25:56,466 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 04:25:56,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound5.c [2023-12-25 04:25:56,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7e9ba11/8ffa11f684444646a6f73a50ccb98d6b/FLAG7299ad33b [2023-12-25 04:25:56,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a7e9ba11/8ffa11f684444646a6f73a50ccb98d6b [2023-12-25 04:25:56,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 04:25:56,483 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 04:25:56,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 04:25:56,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 04:25:56,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 04:25:56,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:25:56" (1/1) ... [2023-12-25 04:25:56,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68898b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56, skipping insertion in model container [2023-12-25 04:25:56,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:25:56" (1/1) ... [2023-12-25 04:25:56,501 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 04:25:56,604 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/prod4br-ll_valuebound5.c[524,537] [2023-12-25 04:25:56,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:25:56,625 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 04:25:56,636 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/prod4br-ll_valuebound5.c[524,537] [2023-12-25 04:25:56,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:25:56,655 INFO L206 MainTranslator]: Completed translation [2023-12-25 04:25:56,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56 WrapperNode [2023-12-25 04:25:56,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 04:25:56,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 04:25:56,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 04:25:56,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 04:25:56,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56" (1/1) ... [2023-12-25 04:25:56,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56" (1/1) ... [2023-12-25 04:25:56,684 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2023-12-25 04:25:56,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 04:25:56,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 04:25:56,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 04:25:56,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 04:25:56,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56" (1/1) ... [2023-12-25 04:25:56,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56" (1/1) ... [2023-12-25 04:25:56,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56" (1/1) ... [2023-12-25 04:25:56,711 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 04:25:56,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56" (1/1) ... [2023-12-25 04:25:56,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56" (1/1) ... [2023-12-25 04:25:56,714 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56" (1/1) ... [2023-12-25 04:25:56,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56" (1/1) ... [2023-12-25 04:25:56,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56" (1/1) ... [2023-12-25 04:25:56,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56" (1/1) ... [2023-12-25 04:25:56,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 04:25:56,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 04:25:56,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 04:25:56,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 04:25:56,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56" (1/1) ... [2023-12-25 04:25:56,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:25:56,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 04:25:56,766 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 04:25:56,817 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 04:25:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 04:25:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 04:25:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 04:25:56,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 04:25:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 04:25:56,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 04:25:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 04:25:56,824 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 04:25:56,898 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 04:25:56,901 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 04:25:57,617 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 04:25:57,632 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 04:25:57,633 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 04:25:57,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:25:57 BoogieIcfgContainer [2023-12-25 04:25:57,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 04:25:57,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 04:25:57,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 04:25:57,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 04:25:57,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 04:25:56" (1/3) ... [2023-12-25 04:25:57,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e78f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:25:57, skipping insertion in model container [2023-12-25 04:25:57,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:25:56" (2/3) ... [2023-12-25 04:25:57,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e78f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:25:57, skipping insertion in model container [2023-12-25 04:25:57,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:25:57" (3/3) ... [2023-12-25 04:25:57,639 INFO L112 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound5.c [2023-12-25 04:25:57,650 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 04:25:57,650 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 04:25:57,686 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 04:25:57,691 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;@19d5e2be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 04:25:57,691 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 04:25:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:25:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 04:25:57,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:25:57,700 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:25:57,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:25:57,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:25:57,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1790489630, now seen corresponding path program 1 times [2023-12-25 04:25:57,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:25:57,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364474258] [2023-12-25 04:25:57,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:25:57,713 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 04:25:57,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:25:57,715 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 04:25:57,725 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 04:25:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:25:57,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 04:25:57,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:25:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 04:25:57,837 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:25:57,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:25:57,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364474258] [2023-12-25 04:25:57,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364474258] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:25:57,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:25:57,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 04:25:57,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880599967] [2023-12-25 04:25:57,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:25:57,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 04:25:57,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:25:57,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 04:25:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:25:57,861 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 04:25:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:25:57,884 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. [2023-12-25 04:25:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 04:25:57,887 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-25 04:25:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:25:57,902 INFO L225 Difference]: With dead ends: 50 [2023-12-25 04:25:57,902 INFO L226 Difference]: Without dead ends: 24 [2023-12-25 04:25:57,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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 04:25:57,907 INFO L413 NwaCegarLoop]: 31 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, 31 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 04:25:57,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 04:25:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-25 04:25:57,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-25 04:25:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 04:25:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-25 04:25:57,930 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 23 [2023-12-25 04:25:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:25:57,931 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-25 04:25:57,931 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 04:25:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-25 04:25:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 04:25:57,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:25:57,932 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:25:57,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 04:25:58,138 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 04:25:58,139 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:25:58,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:25:58,139 INFO L85 PathProgramCache]: Analyzing trace with hash 641782300, now seen corresponding path program 1 times [2023-12-25 04:25:58,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:25:58,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249191535] [2023-12-25 04:25:58,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:25:58,140 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 04:25:58,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:25:58,141 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 04:25:58,144 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 04:25:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:25:58,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 04:25:58,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:25:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:25:58,636 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:25:58,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:25:58,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249191535] [2023-12-25 04:25:58,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249191535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:25:58,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:25:58,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-25 04:25:58,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040952921] [2023-12-25 04:25:58,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:25:58,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 04:25:58,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:25:58,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 04:25:58,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 04:25:58,639 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 04:26:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:26:00,380 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2023-12-25 04:26:00,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 04:26:00,385 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2023-12-25 04:26:00,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:26:00,386 INFO L225 Difference]: With dead ends: 38 [2023-12-25 04:26:00,386 INFO L226 Difference]: Without dead ends: 36 [2023-12-25 04:26:00,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-25 04:26:00,388 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-25 04:26:00,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 80 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-25 04:26:00,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-25 04:26:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2023-12-25 04:26:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:26:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-12-25 04:26:00,395 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 23 [2023-12-25 04:26:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:26:00,395 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-12-25 04:26:00,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 04:26:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-12-25 04:26:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-25 04:26:00,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:26:00,396 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:26:00,417 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 04:26:00,600 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 04:26:00,600 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:26:00,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:26:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1418577099, now seen corresponding path program 1 times [2023-12-25 04:26:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:26:00,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266827086] [2023-12-25 04:26:00,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:26:00,602 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 04:26:00,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:26:00,604 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 04:26:00,626 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 04:26:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:26:00,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 04:26:00,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:26:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:26:01,176 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:26:01,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:26:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266827086] [2023-12-25 04:26:01,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266827086] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:26:01,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:26:01,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 04:26:01,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270342936] [2023-12-25 04:26:01,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:26:01,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 04:26:01,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:26:01,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 04:26:01,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-25 04:26:01,178 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:26:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:26:02,846 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-12-25 04:26:02,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 04:26:02,854 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2023-12-25 04:26:02,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:26:02,854 INFO L225 Difference]: With dead ends: 42 [2023-12-25 04:26:02,854 INFO L226 Difference]: Without dead ends: 34 [2023-12-25 04:26:02,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-12-25 04:26:02,855 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-25 04:26:02,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 111 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-25 04:26:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-25 04:26:02,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2023-12-25 04:26:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 04:26:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-12-25 04:26:02,861 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2023-12-25 04:26:02,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:26:02,861 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-12-25 04:26:02,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 04:26:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-12-25 04:26:02,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-25 04:26:02,862 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:26:02,862 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:26:02,875 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 04:26:03,067 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 04:26:03,068 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:26:03,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:26:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1440936176, now seen corresponding path program 1 times [2023-12-25 04:26:03,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:26:03,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001060878] [2023-12-25 04:26:03,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:26:03,069 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 04:26:03,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:26:03,070 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 04:26:03,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 04:26:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:26:03,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 04:26:03,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:26:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 04:26:19,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:27:45,105 WARN L293 SmtUtils]: Spent 8.89s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:28:29,053 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (or (= (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse0 .cse1)) (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))))) is different from true [2023-12-25 04:28:37,407 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:28:55,407 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~y~0#1|)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~x~0#1|))) (or (= (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse0 .cse1)) (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (not (bvsge |c_ULTIMATE.start_main_~y~0#1| (_ bv1 32))) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))))) is different from true [2023-12-25 04:29:12,527 WARN L293 SmtUtils]: Spent 8.28s 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 04:29:25,505 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10|)) (.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13|))) (or (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (bvsge |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10| (_ bv1 32)) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))) (= (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse1 .cse0))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:29:42,247 WARN L293 SmtUtils]: Spent 8.28s 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 04:30:07,952 WARN L293 SmtUtils]: Spent 8.28s 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 04:30:21,382 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10|)) (.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_13|))) (or (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (bvsge |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_10| (_ bv1 32)) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))) (= (bvmul (_ bv4 64) (bvmul (bvsdiv .cse0 (_ bv2 64)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse1 .cse0))))) (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:30:38,033 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-25 04:30:58,993 WARN L293 SmtUtils]: Spent 8.30s 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 04:31:24,673 WARN L293 SmtUtils]: Spent 8.35s 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 04:31:42,565 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11|)) (.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_14|))) (or (bvsle |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ bv5 32)) (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))) (= (bvmul .cse1 .cse0) (bvmul (bvmul (bvsdiv .cse1 (_ bv2 64)) (bvsdiv .cse0 (_ bv2 64))) (_ bv4 64)))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:31:54,936 WARN L293 SmtUtils]: Spent 8.29s 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 04:32:20,877 WARN L293 SmtUtils]: Spent 8.31s 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 04:32:38,543 WARN L876 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_14| (_ BitVec 32)) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11|)) (.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_14|))) (or (bvsle |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_11| (_ bv5 32)) (not (= (_ bv0 64) (bvsrem .cse0 (_ bv2 64)))) (not (= (_ bv0 64) (bvsrem .cse1 (_ bv2 64)))) (= (bvmul .cse1 .cse0) (bvmul (bvmul (bvsdiv .cse1 (_ bv2 64)) (bvsdiv .cse0 (_ bv2 64))) (_ bv4 64)))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-12-25 04:32:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 2 times theorem prover too weak. 3 trivial. 3 not checked. [2023-12-25 04:32:38,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:32:38,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001060878] [2023-12-25 04:32:38,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001060878] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:32:38,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:32:38,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2023-12-25 04:32:38,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70985180] [2023-12-25 04:32:38,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:32:38,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 04:32:38,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:32:38,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 04:32:38,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=220, Unknown=8, NotChecked=210, Total=506 [2023-12-25 04:32:38,644 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 17 states have internal predecessors, (33), 8 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 04:32:39,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 04:32:40,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 04:32:42,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:32:49,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:32:52,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:32:53,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:32:57,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:33:56,720 WARN L293 SmtUtils]: Spent 23.58s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:34:05,550 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 04:34:09,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:13,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:17,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:44,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:48,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:53,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:34:57,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:01,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:05,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:09,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:13,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:18,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:22,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:26,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:29,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:33,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:38,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:35:42,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:36:12,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:36:16,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:36:21,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:36:25,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:36:29,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:36:33,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:06,896 WARN L293 SmtUtils]: Spent 13.01s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:37:09,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:11,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:40,267 WARN L293 SmtUtils]: Spent 8.79s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 04:37:42,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:44,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:48,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:51,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:52,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:55,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:37:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:37:55,359 INFO L93 Difference]: Finished difference Result 64 states and 88 transitions. [2023-12-25 04:37:55,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 04:37:55,459 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 17 states have internal predecessors, (33), 8 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 31 [2023-12-25 04:37:55,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:37:55,460 INFO L225 Difference]: With dead ends: 64 [2023-12-25 04:37:55,460 INFO L226 Difference]: Without dead ends: 56 [2023-12-25 04:37:55,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 272.0s TimeCoverageRelationStatistics Valid=121, Invalid=396, Unknown=13, NotChecked=282, Total=812 [2023-12-25 04:37:55,461 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 106 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 51 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 140.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 442 IncrementalHoareTripleChecker+Unchecked, 147.8s IncrementalHoareTripleChecker+Time [2023-12-25 04:37:55,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 135 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 272 Invalid, 21 Unknown, 442 Unchecked, 147.8s Time] [2023-12-25 04:37:55,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-25 04:37:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2023-12-25 04:37:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 35 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 04:37:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2023-12-25 04:37:55,478 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 31 [2023-12-25 04:37:55,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:37:55,478 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2023-12-25 04:37:55,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 17 states have internal predecessors, (33), 8 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 04:37:55,478 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2023-12-25 04:37:55,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 04:37:55,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:37:55,482 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:37:55,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 04:37:55,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 04:37:55,689 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:37:55,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:37:55,690 INFO L85 PathProgramCache]: Analyzing trace with hash -748842225, now seen corresponding path program 1 times [2023-12-25 04:37:55,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:37:55,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809110677] [2023-12-25 04:37:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:37:55,690 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 04:37:55,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:37:55,692 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 04:37:55,693 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 04:37:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:37:55,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 04:37:55,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:37:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 04:37:59,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:38:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 04:38:14,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:38:14,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809110677] [2023-12-25 04:38:14,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809110677] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:38:14,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:38:14,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 19 [2023-12-25 04:38:14,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154350371] [2023-12-25 04:38:14,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:38:14,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 04:38:14,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:38:14,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 04:38:14,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2023-12-25 04:38:14,930 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 19 states, 16 states have (on average 2.1875) internal successors, (35), 14 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 04:38:26,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:38:26,180 INFO L93 Difference]: Finished difference Result 82 states and 109 transitions. [2023-12-25 04:38:26,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 04:38:26,202 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.1875) internal successors, (35), 14 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2023-12-25 04:38:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:38:26,204 INFO L225 Difference]: With dead ends: 82 [2023-12-25 04:38:26,204 INFO L226 Difference]: Without dead ends: 66 [2023-12-25 04:38:26,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2023-12-25 04:38:26,205 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 52 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-12-25 04:38:26,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 134 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2023-12-25 04:38:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-25 04:38:26,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2023-12-25 04:38:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 04:38:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2023-12-25 04:38:26,215 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 38 [2023-12-25 04:38:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:38:26,216 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2023-12-25 04:38:26,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 2.1875) internal successors, (35), 14 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 04:38:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2023-12-25 04:38:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 04:38:26,224 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:38:26,224 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:38:26,235 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 04:38:26,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 04:38:26,440 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:38:26,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:38:26,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2033404295, now seen corresponding path program 1 times [2023-12-25 04:38:26,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:38:26,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387557985] [2023-12-25 04:38:26,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:38:26,441 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 04:38:26,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:38:26,443 INFO L229 MonitoredProcess]: Starting monitored process 7 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 04:38:26,444 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 (7)] Waiting until timeout for monitored process [2023-12-25 04:38:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:38:26,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 04:38:26,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:38:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 04:38:28,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:38:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 04:38:29,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:38:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387557985] [2023-12-25 04:38:29,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387557985] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 04:38:29,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 04:38:29,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-12-25 04:38:29,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431725835] [2023-12-25 04:38:29,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:38:29,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 04:38:29,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:38:29,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 04:38:29,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-25 04:38:29,008 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 04:38:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:38:31,154 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2023-12-25 04:38:31,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 04:38:31,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2023-12-25 04:38:31,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:38:31,164 INFO L225 Difference]: With dead ends: 89 [2023-12-25 04:38:31,164 INFO L226 Difference]: Without dead ends: 71 [2023-12-25 04:38:31,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-25 04:38:31,165 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-25 04:38:31,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-25 04:38:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-25 04:38:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2023-12-25 04:38:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 50 states have internal predecessors, (62), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 04:38:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2023-12-25 04:38:31,175 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 42 [2023-12-25 04:38:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:38:31,175 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2023-12-25 04:38:31,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 04:38:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2023-12-25 04:38:31,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-25 04:38:31,176 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:38:31,176 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:38:31,187 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 (7)] Forceful destruction successful, exit code 0 [2023-12-25 04:38:31,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 04:38:31,385 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:38:31,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:38:31,385 INFO L85 PathProgramCache]: Analyzing trace with hash 753540617, now seen corresponding path program 1 times [2023-12-25 04:38:31,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:38:31,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748326568] [2023-12-25 04:38:31,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:38:31,385 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 04:38:31,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:38:31,390 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 04:38:31,391 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 04:38:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:38:31,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 04:38:31,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:38:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 04:38:34,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:38:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 04:38:38,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:38:38,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748326568] [2023-12-25 04:38:38,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748326568] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:38:38,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:38:38,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-12-25 04:38:38,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620346827] [2023-12-25 04:38:38,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:38:38,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 04:38:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:38:38,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 04:38:38,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2023-12-25 04:38:38,311 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 15 states have internal predecessors, (37), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-25 04:38:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:38:43,172 INFO L93 Difference]: Finished difference Result 100 states and 132 transitions. [2023-12-25 04:38:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 04:38:43,181 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 15 states have internal predecessors, (37), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 42 [2023-12-25 04:38:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:38:43,182 INFO L225 Difference]: With dead ends: 100 [2023-12-25 04:38:43,182 INFO L226 Difference]: Without dead ends: 78 [2023-12-25 04:38:43,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2023-12-25 04:38:43,183 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-25 04:38:43,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 173 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-25 04:38:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-25 04:38:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2023-12-25 04:38:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 50 states have internal predecessors, (62), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 04:38:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2023-12-25 04:38:43,196 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 42 [2023-12-25 04:38:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:38:43,196 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2023-12-25 04:38:43,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 15 states have internal predecessors, (37), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-25 04:38:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2023-12-25 04:38:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-25 04:38:43,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:38:43,197 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:38:43,209 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 04:38:43,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 04:38:43,399 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:38:43,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:38:43,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1258465685, now seen corresponding path program 1 times [2023-12-25 04:38:43,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:38:43,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018065252] [2023-12-25 04:38:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:38:43,400 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 04:38:43,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:38:43,401 INFO L229 MonitoredProcess]: Starting monitored process 9 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 04:38:43,401 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 (9)] Waiting until timeout for monitored process [2023-12-25 04:38:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:38:43,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 04:38:43,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:38:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 04:38:47,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:38:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 04:38:52,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:38:52,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018065252] [2023-12-25 04:38:52,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018065252] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 04:38:52,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 04:38:52,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2023-12-25 04:38:52,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342058180] [2023-12-25 04:38:52,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:38:52,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 04:38:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:38:52,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 04:38:52,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-12-25 04:38:52,183 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 04:38:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:38:56,880 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2023-12-25 04:38:56,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 04:38:56,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2023-12-25 04:38:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:38:56,893 INFO L225 Difference]: With dead ends: 74 [2023-12-25 04:38:56,893 INFO L226 Difference]: Without dead ends: 62 [2023-12-25 04:38:56,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-25 04:38:56,894 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-25 04:38:56,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 104 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-12-25 04:38:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-25 04:38:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2023-12-25 04:38:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 46 states have internal predecessors, (54), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 04:38:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2023-12-25 04:38:56,904 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 44 [2023-12-25 04:38:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:38:56,904 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2023-12-25 04:38:56,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 04:38:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2023-12-25 04:38:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-25 04:38:56,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:38:56,905 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:38:56,913 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 (9)] Forceful destruction successful, exit code 0 [2023-12-25 04:38:57,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 04:38:57,113 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:38:57,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:38:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash -202410866, now seen corresponding path program 1 times [2023-12-25 04:38:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:38:57,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812864259] [2023-12-25 04:38:57,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:38:57,114 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 04:38:57,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:38:57,129 INFO L229 MonitoredProcess]: Starting monitored process 10 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 04:38:57,130 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 (10)] Waiting until timeout for monitored process [2023-12-25 04:38:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:38:57,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 04:38:57,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:39:16,057 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 04:39:16,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:39:48,703 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 04:39:48,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:39:48,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812864259] [2023-12-25 04:39:48,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812864259] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:39:48,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:39:48,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-12-25 04:39:48,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153222441] [2023-12-25 04:39:48,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:39:48,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 04:39:48,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:39:48,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 04:39:48,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-12-25 04:39:48,705 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2023-12-25 04:39:59,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 04:40:15,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 04:40:28,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] Received shutdown request... [2023-12-25 04:40:42,283 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 04:40:42,297 WARN L340 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 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 04:40:43,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 04:40:43,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 50.8s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2023-12-25 04:40:43,011 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2023-12-25 04:40:43,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 162 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 32.7s Time] [2023-12-25 04:40:43,013 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 04:40:43,070 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 (10)] Forceful destruction successful, exit code 0 [2023-12-25 04:40:43,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 04:40:43,214 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (61states) and FLOYD_HOARE automaton (currently 12 states, 15 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. [2023-12-25 04:40:43,217 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:40:43,219 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 04:40:43,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 04:40:43 BoogieIcfgContainer [2023-12-25 04:40:43,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 04:40:43,220 INFO L158 Benchmark]: Toolchain (without parser) took 886737.52ms. Allocated memory was 196.1MB in the beginning and 235.9MB in the end (delta: 39.8MB). Free memory was 132.5MB in the beginning and 124.8MB in the end (delta: 7.7MB). Peak memory consumption was 49.1MB. Max. memory is 8.0GB. [2023-12-25 04:40:43,221 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 196.1MB. Free memory was 146.0MB in the beginning and 145.9MB in the end (delta: 89.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 04:40:43,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.81ms. Allocated memory is still 196.1MB. Free memory was 132.2MB in the beginning and 120.4MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 04:40:43,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.91ms. Allocated memory is still 196.1MB. Free memory was 120.4MB in the beginning and 118.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 04:40:43,221 INFO L158 Benchmark]: Boogie Preprocessor took 41.29ms. Allocated memory is still 196.1MB. Free memory was 118.8MB in the beginning and 116.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 04:40:43,221 INFO L158 Benchmark]: RCFGBuilder took 906.22ms. Allocated memory was 196.1MB in the beginning and 235.9MB in the end (delta: 39.8MB). Free memory was 116.7MB in the beginning and 193.4MB in the end (delta: -76.6MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2023-12-25 04:40:43,221 INFO L158 Benchmark]: TraceAbstraction took 885585.30ms. Allocated memory is still 235.9MB. Free memory was 192.3MB in the beginning and 124.8MB in the end (delta: 67.5MB). Peak memory consumption was 67.5MB. Max. memory is 8.0GB. [2023-12-25 04:40:43,222 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.14ms. Allocated memory is still 196.1MB. Free memory was 146.0MB in the beginning and 145.9MB in the end (delta: 89.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.81ms. Allocated memory is still 196.1MB. Free memory was 132.2MB in the beginning and 120.4MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.91ms. Allocated memory is still 196.1MB. Free memory was 120.4MB in the beginning and 118.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.29ms. Allocated memory is still 196.1MB. Free memory was 118.8MB in the beginning and 116.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 906.22ms. Allocated memory was 196.1MB in the beginning and 235.9MB in the end (delta: 39.8MB). Free memory was 116.7MB in the beginning and 193.4MB in the end (delta: -76.6MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * TraceAbstraction took 885585.30ms. Allocated memory is still 235.9MB. Free memory was 192.3MB in the beginning and 124.8MB in the end (delta: 67.5MB). Peak memory consumption was 67.5MB. 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 - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 14). Cancelled while NwaCegarLoop was constructing difference of abstraction (61states) and FLOYD_HOARE automaton (currently 12 states, 15 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 23 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 885.5s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 397.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 21 mSolverCounterUnknown, 315 SdHoareTripleChecker+Valid, 201.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 304 mSDsluCounter, 1006 SdHoareTripleChecker+Invalid, 189.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 442 IncrementalHoareTripleChecker+Unchecked, 812 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1168 IncrementalHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 194 mSDtfsCounter, 1168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 587 GetRequests, 446 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 344.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=6, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 36 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 484.3s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 550 ConstructedInterpolants, 50 QuantifiedInterpolants, 3903 SizeOfPredicates, 45 NumberOfNonLiveVariables, 589 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 347/394 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown