/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/cohendiv-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:59:26,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:59:26,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 00:59:26,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:59:26,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:59:27,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:59:27,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:59:27,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:59:27,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:59:27,007 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:59:27,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:59:27,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:59:27,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:59:27,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:59:27,009 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:59:27,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:59:27,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:59:27,010 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:59:27,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:59:27,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:59:27,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:59:27,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:59:27,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:59:27,011 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:59:27,011 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:59:27,011 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:59:27,011 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:59:27,012 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:59:27,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:59:27,012 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:59:27,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:59:27,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:59:27,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:59:27,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:59:27,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:59:27,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:59:27,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:59:27,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:59:27,014 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:59:27,014 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:59:27,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:59:27,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:59:27,014 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:59:27,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:59:27,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:59:27,015 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:59:27,015 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 00:59:27,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:59:27,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:59:27,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:59:27,226 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:59:27,228 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:59:27,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound50.c [2023-12-25 00:59:28,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:59:28,464 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:59:28,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound50.c [2023-12-25 00:59:28,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823794bf8/71f0bb0baa544c329d1e19c069d57fc5/FLAGdb31c5996 [2023-12-25 00:59:28,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823794bf8/71f0bb0baa544c329d1e19c069d57fc5 [2023-12-25 00:59:28,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:59:28,493 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:59:28,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:59:28,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:59:28,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:59:28,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:59:28" (1/1) ... [2023-12-25 00:59:28,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4432d62d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28, skipping insertion in model container [2023-12-25 00:59:28,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:59:28" (1/1) ... [2023-12-25 00:59:28,519 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:59:28,619 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/cohendiv-ll_valuebound50.c[576,589] [2023-12-25 00:59:28,631 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:59:28,640 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:59:28,648 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/cohendiv-ll_valuebound50.c[576,589] [2023-12-25 00:59:28,653 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:59:28,662 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:59:28,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28 WrapperNode [2023-12-25 00:59:28,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:59:28,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:59:28,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:59:28,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:59:28,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28" (1/1) ... [2023-12-25 00:59:28,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28" (1/1) ... [2023-12-25 00:59:28,694 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-12-25 00:59:28,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:59:28,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:59:28,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:59:28,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:59:28,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28" (1/1) ... [2023-12-25 00:59:28,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28" (1/1) ... [2023-12-25 00:59:28,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28" (1/1) ... [2023-12-25 00:59:28,718 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 00:59:28,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28" (1/1) ... [2023-12-25 00:59:28,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28" (1/1) ... [2023-12-25 00:59:28,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28" (1/1) ... [2023-12-25 00:59:28,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28" (1/1) ... [2023-12-25 00:59:28,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28" (1/1) ... [2023-12-25 00:59:28,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28" (1/1) ... [2023-12-25 00:59:28,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:59:28,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:59:28,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:59:28,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:59:28,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28" (1/1) ... [2023-12-25 00:59:28,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:59:28,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:59:28,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 00:59:28,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 00:59:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:59:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:59:28,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 00:59:28,786 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 00:59:28,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:59:28,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:59:28,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 00:59:28,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 00:59:28,851 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:59:28,857 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:59:29,044 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:59:29,080 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:59:29,080 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 00:59:29,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:59:29 BoogieIcfgContainer [2023-12-25 00:59:29,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:59:29,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:59:29,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:59:29,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:59:29,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:59:28" (1/3) ... [2023-12-25 00:59:29,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798478c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:59:29, skipping insertion in model container [2023-12-25 00:59:29,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:59:28" (2/3) ... [2023-12-25 00:59:29,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798478c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:59:29, skipping insertion in model container [2023-12-25 00:59:29,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:59:29" (3/3) ... [2023-12-25 00:59:29,090 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound50.c [2023-12-25 00:59:29,104 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:59:29,106 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:59:29,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:59:29,150 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;@3e934954, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:59:29,150 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:59:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 00:59:29,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 00:59:29,159 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:59:29,160 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 00:59:29,160 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:59:29,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:59:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1096708698, now seen corresponding path program 1 times [2023-12-25 00:59:29,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:59:29,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77623187] [2023-12-25 00:59:29,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:59:29,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:59:29,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:59:29,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:59:29,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 00:59:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:59:29,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 00:59:29,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:59:29,325 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 00:59:29,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:59:29,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:59:29,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77623187] [2023-12-25 00:59:29,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77623187] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:59:29,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:59:29,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 00:59:29,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765306439] [2023-12-25 00:59:29,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:59:29,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 00:59:29,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:59:29,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 00:59:29,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:59:29,350 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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 00:59:29,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:59:29,369 INFO L93 Difference]: Finished difference Result 60 states and 99 transitions. [2023-12-25 00:59:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 00:59:29,371 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 00:59:29,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:59:29,376 INFO L225 Difference]: With dead ends: 60 [2023-12-25 00:59:29,376 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 00:59:29,379 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 00:59:29,383 INFO L413 NwaCegarLoop]: 38 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, 38 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:59:29,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:59:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 00:59:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-25 00:59:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 00:59:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-12-25 00:59:29,414 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 23 [2023-12-25 00:59:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:59:29,415 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-12-25 00:59:29,415 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 00:59:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2023-12-25 00:59:29,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 00:59:29,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:59:29,417 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 00:59:29,421 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 00:59:29,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:59:29,621 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:59:29,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:59:29,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2049551268, now seen corresponding path program 1 times [2023-12-25 00:59:29,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:59:29,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759565175] [2023-12-25 00:59:29,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:59:29,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:59:29,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:59:29,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:59:29,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 00:59:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:59:29,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 00:59:29,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:59:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 00:59:29,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:59:30,956 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 00:59:30,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:59:30,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759565175] [2023-12-25 00:59:30,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759565175] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 00:59:30,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 00:59:30,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-25 00:59:30,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528425023] [2023-12-25 00:59:30,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:59:30,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 00:59:30,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:59:30,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 00:59:30,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-25 00:59:30,959 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 00:59:36,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:59:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:59:37,214 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2023-12-25 00:59:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 00:59:37,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-25 00:59:37,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:59:37,216 INFO L225 Difference]: With dead ends: 48 [2023-12-25 00:59:37,216 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 00:59:37,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 00:59:37,218 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-12-25 00:59:37,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 100 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2023-12-25 00:59:37,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 00:59:37,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2023-12-25 00:59:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-25 00:59:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2023-12-25 00:59:37,227 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 23 [2023-12-25 00:59:37,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:59:37,227 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2023-12-25 00:59:37,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 00:59:37,228 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2023-12-25 00:59:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 00:59:37,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:59:37,228 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] [2023-12-25 00:59:37,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-25 00:59:37,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:59:37,432 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:59:37,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:59:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1906772284, now seen corresponding path program 1 times [2023-12-25 00:59:37,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:59:37,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919144053] [2023-12-25 00:59:37,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:59:37,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:59:37,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:59:37,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:59:37,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 00:59:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:59:37,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 00:59:37,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:59:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 00:59:37,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:59:39,305 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 00:59:39,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:59:39,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919144053] [2023-12-25 00:59:39,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919144053] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 00:59:39,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 00:59:39,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-25 00:59:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812745777] [2023-12-25 00:59:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:59:39,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 00:59:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:59:39,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 00:59:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-25 00:59:39,307 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 00:59:41,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:59:41,783 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2023-12-25 00:59:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 00:59:41,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-12-25 00:59:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:59:41,792 INFO L225 Difference]: With dead ends: 66 [2023-12-25 00:59:41,792 INFO L226 Difference]: Without dead ends: 63 [2023-12-25 00:59:41,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 00:59:41,793 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-25 00:59:41,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 110 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-25 00:59:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-25 00:59:41,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2023-12-25 00:59:41,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 00:59:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2023-12-25 00:59:41,811 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 28 [2023-12-25 00:59:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:59:41,812 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2023-12-25 00:59:41,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 00:59:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2023-12-25 00:59:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 00:59:41,813 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:59:41,813 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:59:41,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 00:59:42,018 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 00:59:42,019 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:59:42,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:59:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash -170967411, now seen corresponding path program 1 times [2023-12-25 00:59:42,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:59:42,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485934010] [2023-12-25 00:59:42,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:59:42,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:59:42,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:59:42,021 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 00:59:42,025 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 00:59:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:59:42,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 00:59:42,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:59:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 00:59:42,379 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:59:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 00:59:42,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:59:42,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485934010] [2023-12-25 00:59:42,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485934010] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:59:42,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:59:42,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-25 00:59:42,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680853684] [2023-12-25 00:59:42,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:59:42,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 00:59:42,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:59:42,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 00:59:42,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-25 00:59:42,576 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-25 00:59:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:59:43,844 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2023-12-25 00:59:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 00:59:43,850 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 45 [2023-12-25 00:59:43,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:59:43,851 INFO L225 Difference]: With dead ends: 69 [2023-12-25 00:59:43,851 INFO L226 Difference]: Without dead ends: 67 [2023-12-25 00:59:43,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-12-25 00:59:43,852 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 00:59:43,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 182 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 00:59:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-12-25 00:59:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2023-12-25 00:59:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 00:59:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2023-12-25 00:59:43,866 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 45 [2023-12-25 00:59:43,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:59:43,866 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2023-12-25 00:59:43,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-25 00:59:43,866 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2023-12-25 00:59:43,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 00:59:43,867 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:59:43,867 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:59:43,877 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 (5)] Ended with exit code 0 [2023-12-25 00:59:44,073 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 00:59:44,073 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:59:44,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:59:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1378270461, now seen corresponding path program 1 times [2023-12-25 00:59:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:59:44,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306116136] [2023-12-25 00:59:44,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:59:44,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 00:59:44,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:59:44,075 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 00:59:44,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 00:59:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:59:44,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 00:59:44,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:59:44,760 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-25 00:59:44,760 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:00:06,044 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-25 01:00:06,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:00:06,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306116136] [2023-12-25 01:00:06,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306116136] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:00:06,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:00:06,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2023-12-25 01:00:06,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501533050] [2023-12-25 01:00:06,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:00:06,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 01:00:06,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:00:06,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 01:00:06,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=353, Unknown=2, NotChecked=0, Total=420 [2023-12-25 01:00:06,047 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2023-12-25 01:00:13,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:00:17,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:00:20,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:00:26,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:00:31,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:00:35,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:00:39,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:00:44,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:00:48,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:00:56,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:01:00,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:04,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:01:08,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:01:12,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:17,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:01:22,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:01:26,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:01:32,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:36,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:40,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:44,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:48,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:52,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:01:56,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:00,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:02:00,675 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2023-12-25 01:02:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 01:02:00,687 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) Word has length 51 [2023-12-25 01:02:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:02:00,689 INFO L225 Difference]: With dead ends: 111 [2023-12-25 01:02:00,689 INFO L226 Difference]: Without dead ends: 109 [2023-12-25 01:02:00,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=166, Invalid=761, Unknown=3, NotChecked=0, Total=930 [2023-12-25 01:02:00,690 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 109 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 98 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 101.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:02:00,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 158 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 220 Invalid, 23 Unknown, 0 Unchecked, 101.7s Time] [2023-12-25 01:02:00,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-25 01:02:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2023-12-25 01:02:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 61 states have internal predecessors, (67), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-25 01:02:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2023-12-25 01:02:00,711 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 51 [2023-12-25 01:02:00,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:02:00,711 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2023-12-25 01:02:00,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 11 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2023-12-25 01:02:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2023-12-25 01:02:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-25 01:02:00,721 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:02:00,721 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:02:00,731 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 01:02:00,931 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 01:02:00,931 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:02:00,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:02:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1550111725, now seen corresponding path program 1 times [2023-12-25 01:02:00,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:02:00,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427856194] [2023-12-25 01:02:00,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:02:00,932 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 01:02:00,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:02:00,933 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 01:02:00,935 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 01:02:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:02:01,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 01:02:01,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:02:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 01:02:02,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:02:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 01:02:25,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:02:25,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427856194] [2023-12-25 01:02:25,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427856194] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:02:25,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:02:25,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2023-12-25 01:02:25,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591205209] [2023-12-25 01:02:25,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:02:25,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 01:02:25,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:02:25,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 01:02:25,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2023-12-25 01:02:25,018 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-25 01:02:31,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:42,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:46,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:51,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:02:55,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:03:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:03:05,510 INFO L93 Difference]: Finished difference Result 119 states and 162 transitions. [2023-12-25 01:03:05,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 01:03:05,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 58 [2023-12-25 01:03:05,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:03:05,533 INFO L225 Difference]: With dead ends: 119 [2023-12-25 01:03:05,533 INFO L226 Difference]: Without dead ends: 116 [2023-12-25 01:03:05,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2023-12-25 01:03:05,534 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 34 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:03:05,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 135 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 86 Invalid, 4 Unknown, 0 Unchecked, 32.6s Time] [2023-12-25 01:03:05,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-25 01:03:05,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2023-12-25 01:03:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 67 states have internal predecessors, (72), 43 states have call successors, (43), 9 states have call predecessors, (43), 9 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-25 01:03:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 157 transitions. [2023-12-25 01:03:05,553 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 157 transitions. Word has length 58 [2023-12-25 01:03:05,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:03:05,553 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 157 transitions. [2023-12-25 01:03:05,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-25 01:03:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 157 transitions. [2023-12-25 01:03:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-25 01:03:05,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:03:05,554 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:03:05,561 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 01:03:05,760 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 01:03:05,761 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:03:05,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:03:05,761 INFO L85 PathProgramCache]: Analyzing trace with hash -426664645, now seen corresponding path program 1 times [2023-12-25 01:03:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:03:05,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110932813] [2023-12-25 01:03:05,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:03:05,762 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 01:03:05,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:03:05,763 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 01:03:05,765 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 01:03:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:03:05,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 01:03:05,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:03:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-25 01:03:06,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:03:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-25 01:03:14,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:03:14,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110932813] [2023-12-25 01:03:14,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110932813] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:03:14,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:03:14,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2023-12-25 01:03:14,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289001474] [2023-12-25 01:03:14,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:03:14,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 01:03:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:03:14,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 01:03:14,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-12-25 01:03:14,134 INFO L87 Difference]: Start difference. First operand 115 states and 157 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 01:03:16,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:03:16,679 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2023-12-25 01:03:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:03:16,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 58 [2023-12-25 01:03:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:03:16,706 INFO L225 Difference]: With dead ends: 121 [2023-12-25 01:03:16,706 INFO L226 Difference]: Without dead ends: 119 [2023-12-25 01:03:16,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-12-25 01:03:16,707 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:03:16,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 92 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-25 01:03:16,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-25 01:03:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-12-25 01:03:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 70 states have internal predecessors, (75), 43 states have call successors, (43), 10 states have call predecessors, (43), 10 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-25 01:03:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2023-12-25 01:03:16,736 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 58 [2023-12-25 01:03:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:03:16,737 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2023-12-25 01:03:16,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 01:03:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2023-12-25 01:03:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-25 01:03:16,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:03:16,737 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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 01:03:16,746 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 01:03:16,944 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 01:03:16,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:03:16,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:03:16,945 INFO L85 PathProgramCache]: Analyzing trace with hash 673882661, now seen corresponding path program 1 times [2023-12-25 01:03:16,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:03:16,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878764450] [2023-12-25 01:03:16,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:03:16,945 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 01:03:16,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:03:16,946 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 01:03:16,947 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 01:03:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:03:17,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 01:03:17,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:03:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-12-25 01:03:18,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:04:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-12-25 01:04:03,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:04:03,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878764450] [2023-12-25 01:04:03,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878764450] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:04:03,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:04:03,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2023-12-25 01:04:03,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957026897] [2023-12-25 01:04:03,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:04:03,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 01:04:03,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:04:03,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 01:04:03,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2023-12-25 01:04:03,854 INFO L87 Difference]: Start difference. First operand 119 states and 160 transitions. Second operand has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 19 states have internal predecessors, (37), 13 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (26), 14 states have call predecessors, (26), 13 states have call successors, (26) [2023-12-25 01:04:35,879 WARN L293 SmtUtils]: Spent 14.17s 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 01:04:51,219 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 01:04:55,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:04:59,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:03,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:10,261 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 01:05:14,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:18,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:28,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:32,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:36,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:40,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:44,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:48,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:52,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:05:59,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:03,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:07,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:11,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:18,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:22,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:26,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:06:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:06:56,773 INFO L93 Difference]: Finished difference Result 214 states and 297 transitions. [2023-12-25 01:06:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-25 01:06:56,796 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 19 states have internal predecessors, (37), 13 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (26), 14 states have call predecessors, (26), 13 states have call successors, (26) Word has length 81 [2023-12-25 01:06:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:06:56,798 INFO L225 Difference]: With dead ends: 214 [2023-12-25 01:06:56,798 INFO L226 Difference]: Without dead ends: 210 [2023-12-25 01:06:56,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 84.4s TimeCoverageRelationStatistics Valid=316, Invalid=1090, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 01:06:56,799 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 122 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 131 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 113.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 117.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:06:56,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 448 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 589 Invalid, 21 Unknown, 0 Unchecked, 117.0s Time] [2023-12-25 01:06:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-12-25 01:06:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 202. [2023-12-25 01:06:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 109 states have (on average 1.165137614678899) internal successors, (127), 115 states have internal predecessors, (127), 78 states have call successors, (78), 14 states have call predecessors, (78), 14 states have return successors, (77), 72 states have call predecessors, (77), 77 states have call successors, (77) [2023-12-25 01:06:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 282 transitions. [2023-12-25 01:06:56,841 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 282 transitions. Word has length 81 [2023-12-25 01:06:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:06:56,841 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 282 transitions. [2023-12-25 01:06:56,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 19 states have internal predecessors, (37), 13 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (26), 14 states have call predecessors, (26), 13 states have call successors, (26) [2023-12-25 01:06:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 282 transitions. [2023-12-25 01:06:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-25 01:06:56,844 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:06:56,844 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:06:56,853 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 01:06:57,052 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 01:06:57,053 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:06:57,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:06:57,053 INFO L85 PathProgramCache]: Analyzing trace with hash -474239165, now seen corresponding path program 2 times [2023-12-25 01:06:57,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:06:57,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942028872] [2023-12-25 01:06:57,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 01:06:57,054 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 01:06:57,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:06:57,055 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 01:06:57,059 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 01:06:57,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 01:06:57,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:06:57,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-25 01:06:57,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:06:58,981 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 55 proven. 32 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2023-12-25 01:06:58,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:09:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 58 proven. 29 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2023-12-25 01:09:07,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:09:07,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942028872] [2023-12-25 01:09:07,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942028872] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 01:09:07,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 01:09:07,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 29 [2023-12-25 01:09:07,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573748630] [2023-12-25 01:09:07,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 01:09:07,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-25 01:09:07,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:09:07,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-25 01:09:07,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=671, Unknown=10, NotChecked=0, Total=812 [2023-12-25 01:09:07,496 INFO L87 Difference]: Start difference. First operand 202 states and 282 transitions. Second operand has 29 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 25 states have internal predecessors, (46), 19 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (32), 16 states have call predecessors, (32), 17 states have call successors, (32) [2023-12-25 01:09:17,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:21,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:25,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:29,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:33,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:37,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:42,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:46,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:50,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:09:54,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:39,682 WARN L293 SmtUtils]: Spent 41.42s on a formula simplification. DAG size of input: 49 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:10:42,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:10:50,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:11:38,577 WARN L293 SmtUtils]: Spent 40.81s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:12:25,740 WARN L293 SmtUtils]: Spent 41.35s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:12:29,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:33,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:37,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:41,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:45,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:49,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:53,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:12:58,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:02,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:06,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:08,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 01:13:12,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:16,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:13:20,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:14:12,140 WARN L293 SmtUtils]: Spent 37.45s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-25 01:14:12,980 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 01:14:12,981 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 01:14:13,991 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 (10)] Ended with exit code 0 [2023-12-25 01:14:14,180 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 01:14:14,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 288.9s TimeCoverageRelationStatistics Valid=257, Invalid=1212, Unknown=13, NotChecked=0, Total=1482 [2023-12-25 01:14:14,194 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 48 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 67 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 110.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 112.3s IncrementalHoareTripleChecker+Time [2023-12-25 01:14:14,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 277 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 276 Invalid, 23 Unknown, 0 Unchecked, 112.3s Time] [2023-12-25 01:14:14,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-25 01:14:14,200 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:14:14,201 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-25 01:14:14,204 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:14:14,205 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:14:14,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:14:14 BoogieIcfgContainer [2023-12-25 01:14:14,207 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:14:14,207 INFO L158 Benchmark]: Toolchain (without parser) took 885713.81ms. Allocated memory is still 408.9MB. Free memory was 353.8MB in the beginning and 283.2MB in the end (delta: 70.6MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. [2023-12-25 01:14:14,207 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 233.8MB. Free memory was 180.5MB in the beginning and 180.4MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:14:14,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.94ms. Allocated memory is still 408.9MB. Free memory was 353.6MB in the beginning and 342.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 01:14:14,207 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.34ms. Allocated memory is still 408.9MB. Free memory was 342.0MB in the beginning and 340.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:14:14,207 INFO L158 Benchmark]: Boogie Preprocessor took 32.00ms. Allocated memory is still 408.9MB. Free memory was 340.4MB in the beginning and 338.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:14:14,208 INFO L158 Benchmark]: RCFGBuilder took 353.68ms. Allocated memory is still 408.9MB. Free memory was 338.4MB in the beginning and 326.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 01:14:14,208 INFO L158 Benchmark]: TraceAbstraction took 885123.42ms. Allocated memory is still 408.9MB. Free memory was 325.3MB in the beginning and 283.2MB in the end (delta: 42.1MB). Peak memory consumption was 42.2MB. Max. memory is 8.0GB. [2023-12-25 01:14:14,209 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.12ms. Allocated memory is still 233.8MB. Free memory was 180.5MB in the beginning and 180.4MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 167.94ms. Allocated memory is still 408.9MB. Free memory was 353.6MB in the beginning and 342.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.34ms. Allocated memory is still 408.9MB. Free memory was 342.0MB in the beginning and 340.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.00ms. Allocated memory is still 408.9MB. Free memory was 340.4MB in the beginning and 338.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 353.68ms. Allocated memory is still 408.9MB. Free memory was 338.4MB in the beginning and 326.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 885123.42ms. Allocated memory is still 408.9MB. Free memory was 325.3MB in the beginning and 283.2MB in the end (delta: 42.1MB). Peak memory consumption was 42.2MB. 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: 17]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 17). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 885.1s, OverallIterations: 9, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 647.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 72 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 375.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 396 mSDsluCounter, 1540 SdHoareTripleChecker+Invalid, 366.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1291 mSDsCounter, 374 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1419 IncrementalHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 374 mSolverCounterUnsat, 249 mSDtfsCounter, 1419 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 932 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 436.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=8, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 20 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 234.3s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 888 ConstructedInterpolants, 55 QuantifiedInterpolants, 5347 SizeOfPredicates, 40 NumberOfNonLiveVariables, 770 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 1671/1800 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