/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/verifythis/elimination_max_rec_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:31:56,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:31:56,708 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 06:31:56,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:31:56,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:31:56,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:31:56,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:31:56,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:31:56,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:31:56,742 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:31:56,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:31:56,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:31:56,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:31:56,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:31:56,743 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:31:56,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:31:56,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:31:56,746 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:31:56,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:31:56,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:31:56,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:31:56,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:31:56,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:31:56,751 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:31:56,751 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:31:56,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:31:56,751 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:31:56,752 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:31:56,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:31:56,752 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:31:56,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:31:56,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:31:56,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:31:56,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:31:56,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:31:56,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:31:56,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:31:56,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:31:56,753 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:31:56,754 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:31:56,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:31:56,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:31:56,756 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:31:56,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:31:56,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:31:56,756 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:31:56,756 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 06:31:56,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:31:56,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:31:56,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:31:56,977 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:31:56,977 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:31:56,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2023-12-25 06:31:58,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:31:58,248 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:31:58,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2023-12-25 06:31:58,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c497eed56/479c63cdf29440ecaea95f38e213b2af/FLAG32e59a389 [2023-12-25 06:31:58,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c497eed56/479c63cdf29440ecaea95f38e213b2af [2023-12-25 06:31:58,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:31:58,265 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:31:58,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:31:58,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:31:58,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:31:58,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:31:58" (1/1) ... [2023-12-25 06:31:58,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b55ed34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58, skipping insertion in model container [2023-12-25 06:31:58,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:31:58" (1/1) ... [2023-12-25 06:31:58,290 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:31:58,405 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c[502,515] [2023-12-25 06:31:58,422 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:31:58,438 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:31:58,448 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c[502,515] [2023-12-25 06:31:58,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:31:58,481 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:31:58,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58 WrapperNode [2023-12-25 06:31:58,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:31:58,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:31:58,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:31:58,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:31:58,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58" (1/1) ... [2023-12-25 06:31:58,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58" (1/1) ... [2023-12-25 06:31:58,522 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2023-12-25 06:31:58,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:31:58,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:31:58,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:31:58,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:31:58,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58" (1/1) ... [2023-12-25 06:31:58,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58" (1/1) ... [2023-12-25 06:31:58,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58" (1/1) ... [2023-12-25 06:31:58,557 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2023-12-25 06:31:58,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58" (1/1) ... [2023-12-25 06:31:58,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58" (1/1) ... [2023-12-25 06:31:58,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58" (1/1) ... [2023-12-25 06:31:58,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58" (1/1) ... [2023-12-25 06:31:58,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58" (1/1) ... [2023-12-25 06:31:58,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58" (1/1) ... [2023-12-25 06:31:58,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:31:58,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:31:58,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:31:58,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:31:58,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58" (1/1) ... [2023-12-25 06:31:58,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:31:58,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:31:58,601 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 06:31:58,618 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 06:31:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:31:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:31:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 06:31:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 06:31:58,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 06:31:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure check [2023-12-25 06:31:58,626 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2023-12-25 06:31:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-25 06:31:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 06:31:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 06:31:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:31:58,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:31:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 06:31:58,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 06:31:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-25 06:31:58,695 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:31:58,697 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:31:58,884 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:31:58,910 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:31:58,910 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:31:58,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:31:58 BoogieIcfgContainer [2023-12-25 06:31:58,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:31:58,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:31:58,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:31:58,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:31:58,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:31:58" (1/3) ... [2023-12-25 06:31:58,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0724fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:31:58, skipping insertion in model container [2023-12-25 06:31:58,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:58" (2/3) ... [2023-12-25 06:31:58,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0724fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:31:58, skipping insertion in model container [2023-12-25 06:31:58,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:31:58" (3/3) ... [2023-12-25 06:31:58,917 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2023-12-25 06:31:58,929 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:31:58,929 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:31:58,973 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:31:58,981 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;@dc13fea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:31:58,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:31:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 06:31:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-25 06:31:58,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:58,992 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:31:58,993 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:58,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:58,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1773256560, now seen corresponding path program 1 times [2023-12-25 06:31:59,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:59,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949002190] [2023-12-25 06:31:59,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:59,008 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 06:31:59,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:59,010 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 06:31:59,014 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 06:31:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:59,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 06:31:59,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 06:31:59,134 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:31:59,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:59,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949002190] [2023-12-25 06:31:59,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949002190] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:31:59,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:31:59,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 06:31:59,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753189523] [2023-12-25 06:31:59,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:31:59,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 06:31:59,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:59,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 06:31:59,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 06:31:59,169 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:31:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:31:59,197 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2023-12-25 06:31:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 06:31:59,199 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-12-25 06:31:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:31:59,204 INFO L225 Difference]: With dead ends: 62 [2023-12-25 06:31:59,205 INFO L226 Difference]: Without dead ends: 30 [2023-12-25 06:31:59,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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 06:31:59,213 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:31:59,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:31:59,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-25 06:31:59,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-25 06:31:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 06:31:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-12-25 06:31:59,249 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 20 [2023-12-25 06:31:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:31:59,249 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-12-25 06:31:59,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:31:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-12-25 06:31:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-25 06:31:59,251 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:59,251 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:31:59,254 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 06:31:59,452 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 06:31:59,453 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:59,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:59,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1634427412, now seen corresponding path program 1 times [2023-12-25 06:31:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:59,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931619157] [2023-12-25 06:31:59,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:59,454 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 06:31:59,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:59,455 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 06:31:59,456 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 06:31:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:59,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 06:31:59,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 06:31:59,904 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:31:59,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:59,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931619157] [2023-12-25 06:31:59,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931619157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:31:59,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:31:59,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 06:31:59,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851628997] [2023-12-25 06:31:59,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:31:59,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 06:31:59,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:59,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 06:31:59,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:31:59,907 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:32:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:32:00,218 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2023-12-25 06:32:00,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 06:32:00,220 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-12-25 06:32:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:32:00,222 INFO L225 Difference]: With dead ends: 50 [2023-12-25 06:32:00,222 INFO L226 Difference]: Without dead ends: 48 [2023-12-25 06:32:00,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:32:00,223 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:32:00,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 166 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:32:00,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-25 06:32:00,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2023-12-25 06:32:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 06:32:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2023-12-25 06:32:00,235 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 20 [2023-12-25 06:32:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:32:00,236 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2023-12-25 06:32:00,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:32:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2023-12-25 06:32:00,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-25 06:32:00,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:32:00,237 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:32:00,241 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 06:32:00,439 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 06:32:00,439 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:32:00,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:32:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1846124153, now seen corresponding path program 1 times [2023-12-25 06:32:00,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:32:00,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391089936] [2023-12-25 06:32:00,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:32:00,440 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 06:32:00,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:32:00,442 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 06:32:00,443 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 06:32:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:32:00,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 06:32:00,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:32:00,697 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 06:32:00,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 06:32:00,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2023-12-25 06:32:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 06:32:00,768 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:32:00,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:32:00,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391089936] [2023-12-25 06:32:00,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391089936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:32:00,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:32:00,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-25 06:32:00,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729454133] [2023-12-25 06:32:00,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:32:00,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 06:32:00,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:32:00,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 06:32:00,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-12-25 06:32:00,771 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 06:32:01,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:32:01,034 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2023-12-25 06:32:01,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 06:32:01,034 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2023-12-25 06:32:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:32:01,035 INFO L225 Difference]: With dead ends: 58 [2023-12-25 06:32:01,035 INFO L226 Difference]: Without dead ends: 48 [2023-12-25 06:32:01,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-12-25 06:32:01,036 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:32:01,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 222 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:32:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-25 06:32:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2023-12-25 06:32:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 06:32:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2023-12-25 06:32:01,043 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 23 [2023-12-25 06:32:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:32:01,044 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2023-12-25 06:32:01,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 06:32:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2023-12-25 06:32:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 06:32:01,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:32:01,044 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 06:32:01,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 06:32:01,246 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 06:32:01,247 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:32:01,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:32:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash 179298221, now seen corresponding path program 1 times [2023-12-25 06:32:01,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:32:01,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422005728] [2023-12-25 06:32:01,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:32:01,248 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 06:32:01,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:32:01,250 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 06:32:01,251 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 06:32:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:32:01,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 06:32:01,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:32:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 06:32:01,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:32:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 06:32:02,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:32:02,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422005728] [2023-12-25 06:32:02,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422005728] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:32:02,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:32:02,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2023-12-25 06:32:02,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225856459] [2023-12-25 06:32:02,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:32:02,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 06:32:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:32:02,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 06:32:02,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2023-12-25 06:32:02,001 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 17 states have internal predecessors, (33), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-25 06:32:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:32:03,087 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2023-12-25 06:32:03,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-25 06:32:03,088 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 17 states have internal predecessors, (33), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 35 [2023-12-25 06:32:03,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:32:03,089 INFO L225 Difference]: With dead ends: 98 [2023-12-25 06:32:03,089 INFO L226 Difference]: Without dead ends: 96 [2023-12-25 06:32:03,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 06:32:03,091 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 89 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 06:32:03,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 286 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 06:32:03,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-25 06:32:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2023-12-25 06:32:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 49 states have internal predecessors, (53), 23 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 06:32:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2023-12-25 06:32:03,102 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 35 [2023-12-25 06:32:03,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:32:03,102 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2023-12-25 06:32:03,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 17 states have internal predecessors, (33), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-25 06:32:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2023-12-25 06:32:03,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 06:32:03,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:32:03,103 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-25 06:32:03,108 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 06:32:03,306 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 06:32:03,306 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:32:03,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:32:03,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2056086235, now seen corresponding path program 1 times [2023-12-25 06:32:03,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:32:03,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127912263] [2023-12-25 06:32:03,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:32:03,307 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 06:32:03,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:32:03,308 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 06:32:03,311 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 06:32:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:32:03,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-25 06:32:03,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:32:04,079 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 06:32:04,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 06:32:04,150 INFO L349 Elim1Store]: treesize reduction 56, result has 46.2 percent of original size [2023-12-25 06:32:04,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 43 treesize of output 60 [2023-12-25 06:32:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 06:32:04,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:32:17,358 INFO L349 Elim1Store]: treesize reduction 5, result has 92.3 percent of original size [2023-12-25 06:32:17,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 67 [2023-12-25 06:32:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 06:32:18,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:32:18,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127912263] [2023-12-25 06:32:18,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127912263] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:32:18,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:32:18,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 31 [2023-12-25 06:32:18,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211721991] [2023-12-25 06:32:18,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:32:18,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-25 06:32:18,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:32:18,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-25 06:32:18,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=834, Unknown=3, NotChecked=0, Total=930 [2023-12-25 06:32:18,408 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 23 states have internal predecessors, (37), 9 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2023-12-25 06:32:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:32:22,745 INFO L93 Difference]: Finished difference Result 123 states and 156 transitions. [2023-12-25 06:32:22,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-25 06:32:22,749 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 23 states have internal predecessors, (37), 9 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 38 [2023-12-25 06:32:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:32:22,751 INFO L225 Difference]: With dead ends: 123 [2023-12-25 06:32:22,751 INFO L226 Difference]: Without dead ends: 121 [2023-12-25 06:32:22,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=279, Invalid=2268, Unknown=3, NotChecked=0, Total=2550 [2023-12-25 06:32:22,753 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 108 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:32:22,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 339 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-25 06:32:22,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-25 06:32:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 91. [2023-12-25 06:32:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 60 states have internal predecessors, (62), 24 states have call successors, (24), 10 states have call predecessors, (24), 12 states have return successors, (28), 20 states have call predecessors, (28), 23 states have call successors, (28) [2023-12-25 06:32:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2023-12-25 06:32:22,788 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 38 [2023-12-25 06:32:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:32:22,789 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2023-12-25 06:32:22,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 23 states have internal predecessors, (37), 9 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2023-12-25 06:32:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2023-12-25 06:32:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-25 06:32:22,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:32:22,797 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2023-12-25 06:32:22,823 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 06:32:23,004 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 06:32:23,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:32:23,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:32:23,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1541112042, now seen corresponding path program 1 times [2023-12-25 06:32:23,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:32:23,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434050955] [2023-12-25 06:32:23,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:32:23,005 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 06:32:23,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:32:23,007 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 06:32:23,008 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 06:32:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:32:23,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 06:32:23,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:32:23,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 06:32:23,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2023-12-25 06:32:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-25 06:32:23,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:32:24,312 INFO L349 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2023-12-25 06:32:24,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 95 [2023-12-25 06:32:25,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:32:25,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434050955] [2023-12-25 06:32:25,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434050955] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:32:25,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1387415543] [2023-12-25 06:32:25,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:32:25,283 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:32:25,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:32:25,297 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:32:25,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-25 06:32:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:32:25,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:32:25,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:32:25,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-12-25 06:32:29,463 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2|))) is different from true [2023-12-25 06:32:29,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-12-25 06:32:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 4 not checked. [2023-12-25 06:32:29,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:32:57,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1387415543] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:32:57,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:32:57,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2023-12-25 06:32:57,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642139646] [2023-12-25 06:32:57,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:32:57,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 06:32:57,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:32:57,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 06:32:57,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=323, Unknown=8, NotChecked=36, Total=420 [2023-12-25 06:32:57,879 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand has 15 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 7 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-25 06:33:10,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:33:14,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:34:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:34:11,179 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2023-12-25 06:34:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 06:34:11,180 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 7 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 47 [2023-12-25 06:34:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:34:11,183 INFO L225 Difference]: With dead ends: 142 [2023-12-25 06:34:11,183 INFO L226 Difference]: Without dead ends: 114 [2023-12-25 06:34:11,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 97.7s TimeCoverageRelationStatistics Valid=167, Invalid=935, Unknown=24, NotChecked=64, Total=1190 [2023-12-25 06:34:11,185 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:34:11,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 256 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 238 Invalid, 2 Unknown, 114 Unchecked, 8.4s Time] [2023-12-25 06:34:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-25 06:34:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2023-12-25 06:34:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 72 states have internal predecessors, (76), 29 states have call successors, (29), 13 states have call predecessors, (29), 14 states have return successors, (32), 24 states have call predecessors, (32), 26 states have call successors, (32) [2023-12-25 06:34:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 137 transitions. [2023-12-25 06:34:11,221 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 137 transitions. Word has length 47 [2023-12-25 06:34:11,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:34:11,221 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 137 transitions. [2023-12-25 06:34:11,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 7 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-25 06:34:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 137 transitions. [2023-12-25 06:34:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-25 06:34:11,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:34:11,223 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:34:11,230 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 (7)] Ended with exit code 0 [2023-12-25 06:34:11,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-25 06:34:11,626 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-25 06:34:11,627 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:34:11,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:34:11,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1634408140, now seen corresponding path program 1 times [2023-12-25 06:34:11,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:34:11,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194128633] [2023-12-25 06:34:11,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:34:11,627 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 06:34:11,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:34:11,628 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 06:34:11,632 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 06:34:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:34:11,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-25 06:34:11,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 06:34:12,475 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-25 06:34:13,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:34:13,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194128633] [2023-12-25 06:34:13,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194128633] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:34:13,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:34:13,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 26 [2023-12-25 06:34:13,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782465104] [2023-12-25 06:34:13,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:34:13,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-25 06:34:13,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:34:13,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-25 06:34:13,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2023-12-25 06:34:13,138 INFO L87 Difference]: Start difference. First operand 110 states and 137 transitions. Second operand has 26 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 12 states have call successors, (19), 7 states have call predecessors, (19), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-25 06:34:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:34:15,863 INFO L93 Difference]: Finished difference Result 198 states and 256 transitions. [2023-12-25 06:34:15,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-25 06:34:15,865 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 12 states have call successors, (19), 7 states have call predecessors, (19), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 50 [2023-12-25 06:34:15,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:34:15,866 INFO L225 Difference]: With dead ends: 198 [2023-12-25 06:34:15,866 INFO L226 Difference]: Without dead ends: 194 [2023-12-25 06:34:15,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2023-12-25 06:34:15,868 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 120 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:34:15,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 395 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 06:34:15,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-12-25 06:34:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 161. [2023-12-25 06:34:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 96 states have (on average 1.15625) internal successors, (111), 105 states have internal predecessors, (111), 44 states have call successors, (44), 19 states have call predecessors, (44), 20 states have return successors, (47), 36 states have call predecessors, (47), 41 states have call successors, (47) [2023-12-25 06:34:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 202 transitions. [2023-12-25 06:34:15,892 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 202 transitions. Word has length 50 [2023-12-25 06:34:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:34:15,893 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 202 transitions. [2023-12-25 06:34:15,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 12 states have call successors, (19), 7 states have call predecessors, (19), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-25 06:34:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 202 transitions. [2023-12-25 06:34:15,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 06:34:15,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:34:15,893 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2023-12-25 06:34:15,900 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 06:34:16,100 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 06:34:16,103 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:34:16,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:34:16,103 INFO L85 PathProgramCache]: Analyzing trace with hash -144634828, now seen corresponding path program 2 times [2023-12-25 06:34:16,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:34:16,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318744189] [2023-12-25 06:34:16,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:34:16,104 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 06:34:16,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:34:16,105 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 06:34:16,105 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 06:34:16,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:34:16,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:34:16,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-25 06:34:16,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:34:18,181 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-25 06:34:18,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 06:34:18,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 06:34:18,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 06:34:18,298 INFO L349 Elim1Store]: treesize reduction 68, result has 50.0 percent of original size [2023-12-25 06:34:18,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 69 treesize of output 86 [2023-12-25 06:34:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 06:34:18,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:34:37,236 INFO L349 Elim1Store]: treesize reduction 63, result has 32.3 percent of original size [2023-12-25 06:34:37,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 41 [2023-12-25 06:34:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-25 06:34:38,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:34:38,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318744189] [2023-12-25 06:34:38,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318744189] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:34:38,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:34:38,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 41 [2023-12-25 06:34:38,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661938373] [2023-12-25 06:34:38,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:34:38,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-25 06:34:38,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:34:38,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-25 06:34:38,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1483, Unknown=4, NotChecked=0, Total=1640 [2023-12-25 06:34:38,823 INFO L87 Difference]: Start difference. First operand 161 states and 202 transitions. Second operand has 41 states, 35 states have (on average 1.457142857142857) internal successors, (51), 30 states have internal predecessors, (51), 12 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2023-12-25 06:34:57,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:34:57,020 INFO L93 Difference]: Finished difference Result 299 states and 391 transitions. [2023-12-25 06:34:57,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-25 06:34:57,023 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.457142857142857) internal successors, (51), 30 states have internal predecessors, (51), 12 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) Word has length 53 [2023-12-25 06:34:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:34:57,025 INFO L225 Difference]: With dead ends: 299 [2023-12-25 06:34:57,025 INFO L226 Difference]: Without dead ends: 297 [2023-12-25 06:34:57,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1254 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=620, Invalid=5076, Unknown=4, NotChecked=0, Total=5700 [2023-12-25 06:34:57,027 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 207 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-25 06:34:57,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 423 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-25 06:34:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-25 06:34:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 214. [2023-12-25 06:34:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 126 states have (on average 1.1507936507936507) internal successors, (145), 139 states have internal predecessors, (145), 60 states have call successors, (60), 23 states have call predecessors, (60), 27 states have return successors, (71), 51 states have call predecessors, (71), 57 states have call successors, (71) [2023-12-25 06:34:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 276 transitions. [2023-12-25 06:34:57,100 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 276 transitions. Word has length 53 [2023-12-25 06:34:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:34:57,100 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 276 transitions. [2023-12-25 06:34:57,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.457142857142857) internal successors, (51), 30 states have internal predecessors, (51), 12 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2023-12-25 06:34:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 276 transitions. [2023-12-25 06:34:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 06:34:57,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:34:57,101 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2023-12-25 06:34:57,107 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 06:34:57,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:34:57,304 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:34:57,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:34:57,304 INFO L85 PathProgramCache]: Analyzing trace with hash 618469364, now seen corresponding path program 1 times [2023-12-25 06:34:57,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:34:57,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453248787] [2023-12-25 06:34:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:34:57,304 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 06:34:57,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:34:57,305 INFO L229 MonitoredProcess]: Starting monitored process 11 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 06:34:57,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 06:34:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:34:57,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-25 06:34:57,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:35:50,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 06:35:50,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-25 06:35:51,221 INFO L349 Elim1Store]: treesize reduction 252, result has 42.9 percent of original size [2023-12-25 06:35:51,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 97 treesize of output 215 [2023-12-25 06:35:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 06:35:51,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:36:12,614 INFO L349 Elim1Store]: treesize reduction 41, result has 36.9 percent of original size [2023-12-25 06:36:12,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 33 [2023-12-25 06:36:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-25 06:36:13,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:36:13,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453248787] [2023-12-25 06:36:13,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453248787] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:36:13,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:36:13,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20] total 46 [2023-12-25 06:36:13,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224574792] [2023-12-25 06:36:13,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:36:13,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-25 06:36:13,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:36:13,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-25 06:36:13,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1872, Unknown=12, NotChecked=0, Total=2070 [2023-12-25 06:36:13,871 INFO L87 Difference]: Start difference. First operand 214 states and 276 transitions. Second operand has 46 states, 38 states have (on average 1.368421052631579) internal successors, (52), 34 states have internal predecessors, (52), 13 states have call successors, (19), 9 states have call predecessors, (19), 7 states have return successors, (14), 11 states have call predecessors, (14), 8 states have call successors, (14) [2023-12-25 06:36:20,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:36:21,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 06:36:25,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 06:36:55,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 06:37:25,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 06:37:29,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:37:43,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:37:47,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:37:51,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:37:56,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:38:08,773 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification. DAG size of input: 72 DAG size of output: 70 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 06:38:17,704 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 77 DAG size of output: 75 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 06:38:54,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:38:58,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:02,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:06,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:11,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:15,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:19,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:23,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:27,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:31,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:35,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:39,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:43,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:47,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:51,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:55,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:39:59,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:40:03,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:40:07,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:40:11,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:40:15,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:40:19,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:40:23,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:40:27,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:40:31,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:40:35,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:40:40,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:40:44,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:40:48,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:40:52,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:40:56,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:41:00,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:41:04,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:41:08,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:41:12,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:41:16,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:41:20,243 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (not (bvsle (_ bv0 32) c_check_~i))) (.cse5 (not (bvslt c_check_~i c_check_~n))) (.cse7 (bvsge c_check_~x (bvadd c_check_~y (_ bv4294967295 32)))) (.cse11 (bvmul (_ bv4 32) c_check_~i)) (.cse10 (bvmul c_check_~y (_ bv4 32))) (.cse3 (bvmul |c_check_#res| (_ bv4 32))) (.cse17 (bvsge |c_check_#in~x| |c_check_#in~y|)) (.cse12 (bvmul (_ bv4 32) c_check_~x)) (.cse2 (bvmul (_ bv4 32) |c_check_#in~x|)) (.cse6 (bvsge c_check_~x c_check_~y))) (and (forall ((v_check_~a.offset_BEFORE_CALL_23 (_ BitVec 32)) (v_check_~i_BEFORE_CALL_27 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_17 (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_17))) (let ((.cse0 (select .cse1 (bvadd (bvmul (_ bv4 32) v_check_~i_BEFORE_CALL_27) v_check_~a.offset_BEFORE_CALL_23)))) (or (not (bvsle .cse0 (select .cse1 (bvadd .cse2 v_check_~a.offset_BEFORE_CALL_23)))) (bvsle .cse0 (select .cse1 (bvadd .cse3 v_check_~a.offset_BEFORE_CALL_23))))))) (let ((.cse9 (select |c_#memory_int#1| c_check_~a.base))) (let ((.cse8 (select .cse9 (bvadd c_check_~a.offset .cse12)))) (or .cse4 .cse5 .cse6 (not .cse7) (bvsle .cse8 (select .cse9 (bvadd c_check_~a.offset .cse10))) (bvsle (select .cse9 (bvadd .cse11 c_check_~a.offset)) .cse8)))) (exists ((v_check_~y_BEFORE_CALL_38 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_14 (_ BitVec 32))) (let ((.cse13 (bvadd (_ bv2 32) v_check_~y_BEFORE_CALL_38))) (and (bvslt .cse13 (_ bv1073741824 32)) (not (bvsge (_ bv0 32) v_check_~y_BEFORE_CALL_38)) (not (let ((.cse14 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_14))) (bvsle (select .cse14 (_ bv0 32)) (select .cse14 (bvadd (_ bv4 32) (bvmul (_ bv4 32) v_check_~y_BEFORE_CALL_38)))))) (bvslt (_ bv0 32) .cse13)))) (let ((.cse15 (select |c_#memory_int#1| |c_check_#in~a.base|))) (let ((.cse16 (select .cse15 (bvadd |c_check_#in~a.offset| .cse2)))) (or (not (bvsge |c_check_#in~x| (bvadd |c_check_#in~y| (_ bv4294967295 32)))) (bvsle (select .cse15 (bvadd |c_check_#in~a.offset| (bvmul (_ bv4 32) |c_check_#in~i|))) .cse16) (not (bvslt |c_check_#in~i| |c_check_#in~n|)) .cse17 (bvsle .cse16 (select .cse15 (bvadd |c_check_#in~a.offset| (bvmul |c_check_#in~y| (_ bv4 32))))) (not (bvsle (_ bv0 32) |c_check_#in~i|))))) (or .cse4 .cse5 .cse6 (= .cse11 .cse12) (not (bvsge c_check_~x (bvadd c_check_~y (_ bv4294967294 32)))) .cse7 (= (bvadd (_ bv4 32) .cse11) .cse10) (= .cse11 .cse10)) (or .cse17 (forall ((v_check_~a.offset_BEFORE_CALL_23 (_ BitVec 32)) (v_check_~i_BEFORE_CALL_27 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_17 (_ BitVec 32))) (let ((.cse18 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_17))) (bvsle (select .cse18 (bvadd (bvmul (_ bv4 32) v_check_~i_BEFORE_CALL_27) v_check_~a.offset_BEFORE_CALL_23)) (select .cse18 (bvadd .cse3 v_check_~a.offset_BEFORE_CALL_23)))))) (or (and (or .cse17 (forall ((v_check_~a.offset_BEFORE_CALL_23 (_ BitVec 32)) (v_check_~i_BEFORE_CALL_27 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_17 (_ BitVec 32))) (let ((.cse19 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_17))) (bvsle (select .cse19 (bvadd (bvmul (_ bv4 32) v_check_~i_BEFORE_CALL_27) v_check_~a.offset_BEFORE_CALL_23)) (select .cse19 (bvadd v_check_~a.offset_BEFORE_CALL_23 .cse12)))))) (forall ((v_check_~a.offset_BEFORE_CALL_23 (_ BitVec 32)) (v_check_~i_BEFORE_CALL_27 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_17 (_ BitVec 32))) (let ((.cse21 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_17))) (let ((.cse20 (select .cse21 (bvadd (bvmul (_ bv4 32) v_check_~i_BEFORE_CALL_27) v_check_~a.offset_BEFORE_CALL_23)))) (or (bvsle .cse20 (select .cse21 (bvadd v_check_~a.offset_BEFORE_CALL_23 .cse12))) (not (bvsle .cse20 (select .cse21 (bvadd .cse2 v_check_~a.offset_BEFORE_CALL_23))))))))) (not .cse6)))) is different from false [2023-12-25 06:41:36,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:41:39,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:41:43,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:41:47,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:41:51,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:41:56,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:42:00,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:42:04,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:42:08,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:42:12,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:42:16,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:42:20,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:42:24,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:42:28,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:42:32,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:42:36,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:42:40,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:42:44,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:42:48,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:42:52,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:43:00,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:43:12,572 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 63 DAG size of output: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 06:43:21,390 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 83 DAG size of output: 81 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 06:43:31,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 06:43:41,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 06:45:03,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 06:45:07,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 06:45:11,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 06:45:15,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 06:45:19,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 06:45:23,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 06:45:27,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 06:45:36,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 06:45:40,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 06:45:44,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-25 06:46:18,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:46:22,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:46:26,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:46:30,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-25 06:46:34,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Received shutdown request... [2023-12-25 06:46:37,565 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 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 06:46:37,572 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 06:46:38,376 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (not (bvsle (_ bv0 32) c_check_~i))) (.cse5 (not (bvslt c_check_~i c_check_~n))) (.cse7 (bvsge c_check_~x (bvadd c_check_~y (_ bv4294967295 32)))) (.cse11 (bvmul (_ bv4 32) c_check_~i)) (.cse10 (bvmul c_check_~y (_ bv4 32))) (.cse3 (bvmul |c_check_#res| (_ bv4 32))) (.cse15 (bvsge |c_check_#in~x| |c_check_#in~y|)) (.cse12 (bvmul (_ bv4 32) c_check_~x)) (.cse2 (bvmul (_ bv4 32) |c_check_#in~x|)) (.cse6 (bvsge c_check_~x c_check_~y))) (and (forall ((v_check_~a.offset_BEFORE_CALL_23 (_ BitVec 32)) (v_check_~i_BEFORE_CALL_27 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_17 (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_17))) (let ((.cse0 (select .cse1 (bvadd (bvmul (_ bv4 32) v_check_~i_BEFORE_CALL_27) v_check_~a.offset_BEFORE_CALL_23)))) (or (not (bvsle .cse0 (select .cse1 (bvadd .cse2 v_check_~a.offset_BEFORE_CALL_23)))) (bvsle .cse0 (select .cse1 (bvadd .cse3 v_check_~a.offset_BEFORE_CALL_23))))))) (let ((.cse9 (select |c_#memory_int#1| c_check_~a.base))) (let ((.cse8 (select .cse9 (bvadd c_check_~a.offset .cse12)))) (or .cse4 .cse5 .cse6 (not .cse7) (bvsle .cse8 (select .cse9 (bvadd c_check_~a.offset .cse10))) (bvsle (select .cse9 (bvadd .cse11 c_check_~a.offset)) .cse8)))) (exists ((v_check_~y_BEFORE_CALL_38 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_14 (_ BitVec 32))) (let ((.cse13 (bvadd (_ bv2 32) v_check_~y_BEFORE_CALL_38))) (and (bvslt .cse13 (_ bv1073741824 32)) (not (bvsge (_ bv0 32) v_check_~y_BEFORE_CALL_38)) (not (let ((.cse14 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_14))) (bvsle (select .cse14 (_ bv0 32)) (select .cse14 (bvadd (_ bv4 32) (bvmul (_ bv4 32) v_check_~y_BEFORE_CALL_38)))))) (bvslt (_ bv0 32) .cse13)))) (or .cse4 .cse5 .cse6 (= .cse11 .cse12) (not (bvsge c_check_~x (bvadd c_check_~y (_ bv4294967294 32)))) .cse7 (= (bvadd (_ bv4 32) .cse11) .cse10) (= .cse11 .cse10)) (or .cse15 (forall ((v_check_~a.offset_BEFORE_CALL_23 (_ BitVec 32)) (v_check_~i_BEFORE_CALL_27 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_17 (_ BitVec 32))) (let ((.cse16 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_17))) (bvsle (select .cse16 (bvadd (bvmul (_ bv4 32) v_check_~i_BEFORE_CALL_27) v_check_~a.offset_BEFORE_CALL_23)) (select .cse16 (bvadd .cse3 v_check_~a.offset_BEFORE_CALL_23)))))) (or (and (or .cse15 (forall ((v_check_~a.offset_BEFORE_CALL_23 (_ BitVec 32)) (v_check_~i_BEFORE_CALL_27 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_17 (_ BitVec 32))) (let ((.cse17 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_17))) (bvsle (select .cse17 (bvadd (bvmul (_ bv4 32) v_check_~i_BEFORE_CALL_27) v_check_~a.offset_BEFORE_CALL_23)) (select .cse17 (bvadd v_check_~a.offset_BEFORE_CALL_23 .cse12)))))) (forall ((v_check_~a.offset_BEFORE_CALL_23 (_ BitVec 32)) (v_check_~i_BEFORE_CALL_27 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_17 (_ BitVec 32))) (let ((.cse19 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_17))) (let ((.cse18 (select .cse19 (bvadd (bvmul (_ bv4 32) v_check_~i_BEFORE_CALL_27) v_check_~a.offset_BEFORE_CALL_23)))) (or (bvsle .cse18 (select .cse19 (bvadd v_check_~a.offset_BEFORE_CALL_23 .cse12))) (not (bvsle .cse18 (select .cse19 (bvadd .cse2 v_check_~a.offset_BEFORE_CALL_23))))))))) (not .cse6)))) is different from false [2023-12-25 06:46:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-12-25 06:46:38,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2638 ImplicationChecksByTransitivity, 352.6s TimeCoverageRelationStatistics Valid=971, Invalid=9081, Unknown=56, NotChecked=398, Total=10506 [2023-12-25 06:46:38,419 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 159 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 117 mSolverCounterUnsat, 82 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 343.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 82 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 345.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:46:38,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 786 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1709 Invalid, 82 Unknown, 44 Unchecked, 345.1s Time] [2023-12-25 06:46:38,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:46:38,426 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 (11)] Forceful destruction successful, exit code 0 [2023-12-25 06:46:38,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 06:46:38,623 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (214states) and FLOYD_HOARE automaton (currently 77 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 103 known predicates. [2023-12-25 06:46:38,627 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:46:38,629 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:46:38,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:46:38 BoogieIcfgContainer [2023-12-25 06:46:38,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:46:38,636 INFO L158 Benchmark]: Toolchain (without parser) took 880368.54ms. Allocated memory was 203.4MB in the beginning and 280.0MB in the end (delta: 76.5MB). Free memory was 141.8MB in the beginning and 186.0MB in the end (delta: -44.3MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2023-12-25 06:46:38,636 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 203.4MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:46:38,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.74ms. Allocated memory is still 203.4MB. Free memory was 141.5MB in the beginning and 129.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 06:46:38,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.72ms. Allocated memory is still 203.4MB. Free memory was 129.7MB in the beginning and 128.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:46:38,637 INFO L158 Benchmark]: Boogie Preprocessor took 45.14ms. Allocated memory is still 203.4MB. Free memory was 128.2MB in the beginning and 126.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:46:38,638 INFO L158 Benchmark]: RCFGBuilder took 342.16ms. Allocated memory was 203.4MB in the beginning and 280.0MB in the end (delta: 76.5MB). Free memory was 126.0MB in the beginning and 237.7MB in the end (delta: -111.6MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2023-12-25 06:46:38,638 INFO L158 Benchmark]: TraceAbstraction took 879720.80ms. Allocated memory is still 280.0MB. Free memory was 237.2MB in the beginning and 186.0MB in the end (delta: 51.1MB). Peak memory consumption was 51.6MB. Max. memory is 8.0GB. [2023-12-25 06:46:38,645 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.13ms. Allocated memory is still 203.4MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.74ms. Allocated memory is still 203.4MB. Free memory was 141.5MB in the beginning and 129.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.72ms. Allocated memory is still 203.4MB. Free memory was 129.7MB in the beginning and 128.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.14ms. Allocated memory is still 203.4MB. Free memory was 128.2MB in the beginning and 126.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 342.16ms. Allocated memory was 203.4MB in the beginning and 280.0MB in the end (delta: 76.5MB). Free memory was 126.0MB in the beginning and 237.7MB in the end (delta: -111.6MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * TraceAbstraction took 879720.80ms. Allocated memory is still 280.0MB. Free memory was 237.2MB in the beginning and 186.0MB in the end (delta: 51.1MB). Peak memory consumption was 51.6MB. 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: 11]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 11). Cancelled while NwaCegarLoop was constructing difference of abstraction (214states) and FLOYD_HOARE automaton (currently 77 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 103 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 879.7s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 724.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 84 mSolverCounterUnknown, 784 SdHoareTripleChecker+Valid, 362.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 754 mSDsluCounter, 2908 SdHoareTripleChecker+Invalid, 359.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 158 IncrementalHoareTripleChecker+Unchecked, 2657 mSDsCounter, 568 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4853 IncrementalHoareTripleChecker+Invalid, 5663 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 568 mSolverCounterUnsat, 251 mSDtfsCounter, 4853 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 807 GetRequests, 438 SyntacticMatches, 8 SemanticMatches, 360 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5064 ImplicationChecksByTransitivity, 504.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=8, InterpolantAutomatonStates: 172, 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, 173 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 151.6s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 600 ConstructedInterpolants, 76 QuantifiedInterpolants, 7230 SizeOfPredicates, 150 NumberOfNonLiveVariables, 1022 ConjunctsInSsa, 285 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 262/388 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