/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:05:13,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:05:13,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:05:13,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:05:13,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:05:13,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:05:13,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:05:13,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:05:13,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:05:13,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:05:13,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:05:13,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:05:13,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:05:13,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:05:13,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:05:13,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:05:13,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:05:13,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:05:13,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:05:13,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:05:13,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:05:13,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:05:13,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:05:13,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:05:13,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:05:13,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:05:13,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:05:13,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:05:13,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:05:13,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:05:13,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:05:13,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:05:13,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:05:13,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:05:13,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:05:13,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:05:13,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:05:13,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:05:13,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:05:13,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:05:13,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:05:13,796 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 03:05:13,829 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:05:13,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:05:13,829 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:05:13,829 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:05:13,830 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:05:13,830 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:05:13,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:05:13,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:05:13,831 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:05:13,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:05:13,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:05:13,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:05:13,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:05:13,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:05:13,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:05:13,837 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:05:13,837 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:05:13,837 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:05:13,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:05:13,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:05:13,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:05:13,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:05:13,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:05:13,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:05:13,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:05:13,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:05:13,838 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:05:13,838 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:05:13,839 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:05:13,839 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:05:13,839 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:05:13,839 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:05:13,839 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:05:13,839 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 03:05:14,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:05:14,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:05:14,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:05:14,101 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:05:14,102 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:05:14,103 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound5.i [2022-01-10 03:05:14,161 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85267372/4de4d9b47c7b4bd0b1067d3e837895bf/FLAG19e533ee4 [2022-01-10 03:05:14,610 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:05:14,610 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound5.i [2022-01-10 03:05:14,619 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85267372/4de4d9b47c7b4bd0b1067d3e837895bf/FLAG19e533ee4 [2022-01-10 03:05:14,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85267372/4de4d9b47c7b4bd0b1067d3e837895bf [2022-01-10 03:05:14,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:05:14,638 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:05:14,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:05:14,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:05:14,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:05:14,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:05:14" (1/1) ... [2022-01-10 03:05:14,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ffb9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:05:14, skipping insertion in model container [2022-01-10 03:05:14,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:05:14" (1/1) ... [2022-01-10 03:05:14,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:05:14,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:05:14,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound5.i[951,964] [2022-01-10 03:05:14,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:05:14,904 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:05:14,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound5.i[951,964] [2022-01-10 03:05:14,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:05:14,947 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:05:14,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:05:14 WrapperNode [2022-01-10 03:05:14,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:05:14,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:05:14,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:05:14,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:05:14,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:05:14" (1/1) ... [2022-01-10 03:05:14,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:05:14" (1/1) ... [2022-01-10 03:05:14,979 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2022-01-10 03:05:14,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:05:14,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:05:14,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:05:14,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:05:14,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:05:14" (1/1) ... [2022-01-10 03:05:14,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:05:14" (1/1) ... [2022-01-10 03:05:14,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:05:14" (1/1) ... [2022-01-10 03:05:14,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:05:14" (1/1) ... [2022-01-10 03:05:15,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:05:14" (1/1) ... [2022-01-10 03:05:15,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:05:14" (1/1) ... [2022-01-10 03:05:15,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:05:14" (1/1) ... [2022-01-10 03:05:15,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:05:15,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:05:15,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:05:15,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:05:15,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:05:14" (1/1) ... [2022-01-10 03:05:15,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:05:15,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:05:15,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 03:05:15,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 03:05:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:05:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:05:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:05:15,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:05:15,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:05:15,093 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:05:15,149 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:05:15,151 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:05:15,310 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:05:15,314 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:05:15,315 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 03:05:15,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:05:15 BoogieIcfgContainer [2022-01-10 03:05:15,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:05:15,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:05:15,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:05:15,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:05:15,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:05:14" (1/3) ... [2022-01-10 03:05:15,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4e66b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:05:15, skipping insertion in model container [2022-01-10 03:05:15,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:05:14" (2/3) ... [2022-01-10 03:05:15,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4e66b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:05:15, skipping insertion in model container [2022-01-10 03:05:15,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:05:15" (3/3) ... [2022-01-10 03:05:15,336 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound5.i [2022-01-10 03:05:15,340 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:05:15,340 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:05:15,401 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:05:15,406 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 03:05:15,406 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:05:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:05:15,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 03:05:15,423 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:05:15,423 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:05:15,424 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:05:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:05:15,429 INFO L85 PathProgramCache]: Analyzing trace with hash 553144752, now seen corresponding path program 1 times [2022-01-10 03:05:15,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:05:15,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222693099] [2022-01-10 03:05:15,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:05:15,441 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:05:15,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:05:15,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:05:15,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 03:05:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:05:15,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:05:15,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:05:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:05:15,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:05:15,577 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:05:15,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222693099] [2022-01-10 03:05:15,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222693099] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:05:15,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:05:15,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:05:15,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886386305] [2022-01-10 03:05:15,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:05:15,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:05:15,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:05:15,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:05:15,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:05:15,617 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:05:15,635 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2022-01-10 03:05:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:05:15,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-01-10 03:05:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:05:15,642 INFO L225 Difference]: With dead ends: 37 [2022-01-10 03:05:15,643 INFO L226 Difference]: Without dead ends: 17 [2022-01-10 03:05:15,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:05:15,650 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:05:15,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:05:15,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-10 03:05:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-10 03:05:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:05:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-01-10 03:05:15,682 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 8 [2022-01-10 03:05:15,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:05:15,682 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-01-10 03:05:15,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-01-10 03:05:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 03:05:15,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:05:15,684 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:05:15,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 03:05:15,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:05:15,903 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:05:15,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:05:15,906 INFO L85 PathProgramCache]: Analyzing trace with hash -803059042, now seen corresponding path program 1 times [2022-01-10 03:05:15,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:05:15,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988331874] [2022-01-10 03:05:15,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:05:15,908 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:05:15,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:05:15,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:05:15,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 03:05:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:05:15,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:05:15,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:05:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:05:16,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:05:16,010 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:05:16,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988331874] [2022-01-10 03:05:16,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988331874] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:05:16,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:05:16,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:05:16,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808297377] [2022-01-10 03:05:16,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:05:16,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:05:16,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:05:16,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:05:16,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:05:16,013 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:16,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:05:16,029 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-01-10 03:05:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:05:16,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-01-10 03:05:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:05:16,031 INFO L225 Difference]: With dead ends: 31 [2022-01-10 03:05:16,031 INFO L226 Difference]: Without dead ends: 19 [2022-01-10 03:05:16,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:05:16,032 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:05:16,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:05:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-10 03:05:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-01-10 03:05:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:05:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-01-10 03:05:16,037 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 10 [2022-01-10 03:05:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:05:16,038 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-01-10 03:05:16,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-01-10 03:05:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 03:05:16,039 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:05:16,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:05:16,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-01-10 03:05:16,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:05:16,247 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:05:16,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:05:16,248 INFO L85 PathProgramCache]: Analyzing trace with hash 549278495, now seen corresponding path program 1 times [2022-01-10 03:05:16,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:05:16,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816030293] [2022-01-10 03:05:16,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:05:16,249 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:05:16,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:05:16,250 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:05:16,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 03:05:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:05:16,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:05:16,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:05:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:05:16,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:05:16,329 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:05:16,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816030293] [2022-01-10 03:05:16,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816030293] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:05:16,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:05:16,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 03:05:16,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49960759] [2022-01-10 03:05:16,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:05:16,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:05:16,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:05:16,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:05:16,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:05:16,332 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:05:16,352 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-01-10 03:05:16,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:05:16,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-01-10 03:05:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:05:16,354 INFO L225 Difference]: With dead ends: 30 [2022-01-10 03:05:16,354 INFO L226 Difference]: Without dead ends: 23 [2022-01-10 03:05:16,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:05:16,355 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:05:16,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:05:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-10 03:05:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-01-10 03:05:16,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:05:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-01-10 03:05:16,360 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 11 [2022-01-10 03:05:16,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:05:16,360 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-01-10 03:05:16,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-01-10 03:05:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 03:05:16,361 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:05:16,361 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:05:16,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 03:05:16,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:05:16,574 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:05:16,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:05:16,575 INFO L85 PathProgramCache]: Analyzing trace with hash 551065955, now seen corresponding path program 1 times [2022-01-10 03:05:16,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:05:16,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681099053] [2022-01-10 03:05:16,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:05:16,576 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:05:16,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:05:16,577 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:05:16,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 03:05:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:05:16,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:05:16,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:05:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:05:16,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:05:16,847 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:05:16,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681099053] [2022-01-10 03:05:16,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681099053] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:05:16,847 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:05:16,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 03:05:16,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507081712] [2022-01-10 03:05:16,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:05:16,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 03:05:16,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:05:16,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 03:05:16,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:05:16,849 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:05:16,985 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-01-10 03:05:16,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:05:16,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-01-10 03:05:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:05:16,986 INFO L225 Difference]: With dead ends: 31 [2022-01-10 03:05:16,986 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 03:05:16,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 03:05:16,988 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:05:16,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 76 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:05:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 03:05:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 03:05:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:05:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-01-10 03:05:16,994 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 11 [2022-01-10 03:05:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:05:16,994 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-01-10 03:05:16,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-01-10 03:05:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 03:05:16,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:05:16,999 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:05:17,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 03:05:17,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:05:17,208 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:05:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:05:17,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1647533572, now seen corresponding path program 1 times [2022-01-10 03:05:17,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:05:17,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125484406] [2022-01-10 03:05:17,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:05:17,210 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:05:17,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:05:17,211 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:05:17,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 03:05:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:05:17,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:05:17,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:05:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:05:17,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:05:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:05:17,373 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:05:17,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125484406] [2022-01-10 03:05:17,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125484406] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:05:17,373 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:05:17,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-01-10 03:05:17,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933363740] [2022-01-10 03:05:17,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:05:17,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 03:05:17,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:05:17,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 03:05:17,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-10 03:05:17,375 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:05:17,584 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2022-01-10 03:05:17,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 03:05:17,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 03:05:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:05:17,587 INFO L225 Difference]: With dead ends: 62 [2022-01-10 03:05:17,587 INFO L226 Difference]: Without dead ends: 50 [2022-01-10 03:05:17,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:05:17,589 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:05:17,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 118 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:05:17,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-10 03:05:17,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2022-01-10 03:05:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 03:05:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-01-10 03:05:17,596 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 13 [2022-01-10 03:05:17,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:05:17,596 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-01-10 03:05:17,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-01-10 03:05:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 03:05:17,597 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:05:17,597 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:05:17,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 03:05:17,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:05:17,804 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:05:17,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:05:17,804 INFO L85 PathProgramCache]: Analyzing trace with hash -791761799, now seen corresponding path program 1 times [2022-01-10 03:05:17,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:05:17,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710588151] [2022-01-10 03:05:17,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:05:17,805 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:05:17,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:05:17,806 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:05:17,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 03:05:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:05:17,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:05:17,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:05:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:05:17,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:05:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:05:17,994 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:05:17,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710588151] [2022-01-10 03:05:17,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710588151] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:05:17,994 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:05:17,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-01-10 03:05:17,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462820234] [2022-01-10 03:05:17,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:05:17,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:05:17,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:05:17,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:05:17,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:05:17,998 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:05:18,330 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-01-10 03:05:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 03:05:18,334 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 03:05:18,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:05:18,335 INFO L225 Difference]: With dead ends: 72 [2022-01-10 03:05:18,335 INFO L226 Difference]: Without dead ends: 65 [2022-01-10 03:05:18,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-01-10 03:05:18,337 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 03:05:18,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 146 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 03:05:18,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-10 03:05:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2022-01-10 03:05:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 51 states have internal predecessors, (65), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 03:05:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2022-01-10 03:05:18,346 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 14 [2022-01-10 03:05:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:05:18,347 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-01-10 03:05:18,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2022-01-10 03:05:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 03:05:18,348 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:05:18,348 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:05:18,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 03:05:18,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:05:18,553 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:05:18,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:05:18,554 INFO L85 PathProgramCache]: Analyzing trace with hash -789974339, now seen corresponding path program 1 times [2022-01-10 03:05:18,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:05:18,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619246859] [2022-01-10 03:05:18,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:05:18,555 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:05:18,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:05:18,558 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:05:18,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 03:05:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:05:18,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 03:05:18,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:05:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:05:18,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:05:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:05:19,773 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:05:19,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619246859] [2022-01-10 03:05:19,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619246859] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:05:19,773 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:05:19,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-01-10 03:05:19,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044496681] [2022-01-10 03:05:19,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:05:19,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 03:05:19,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:05:19,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 03:05:19,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-10 03:05:19,775 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:22,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:05:24,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:05:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:05:24,647 INFO L93 Difference]: Finished difference Result 118 states and 152 transitions. [2022-01-10 03:05:24,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 03:05:24,650 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 03:05:24,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:05:24,652 INFO L225 Difference]: With dead ends: 118 [2022-01-10 03:05:24,652 INFO L226 Difference]: Without dead ends: 110 [2022-01-10 03:05:24,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-01-10 03:05:24,661 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-10 03:05:24,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 137 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 111 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-01-10 03:05:24,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-01-10 03:05:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 94. [2022-01-10 03:05:24,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 77 states have internal predecessors, (93), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-10 03:05:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2022-01-10 03:05:24,678 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 14 [2022-01-10 03:05:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:05:24,679 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2022-01-10 03:05:24,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2022-01-10 03:05:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 03:05:24,680 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:05:24,681 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:05:24,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 03:05:24,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:05:24,889 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:05:24,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:05:24,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2118336314, now seen corresponding path program 1 times [2022-01-10 03:05:24,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:05:24,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373538624] [2022-01-10 03:05:24,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:05:24,890 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:05:24,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:05:24,892 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:05:24,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 03:05:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:05:24,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 03:05:24,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:05:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:05:24,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:05:24,974 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:05:24,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373538624] [2022-01-10 03:05:24,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373538624] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:05:24,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:05:24,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:05:24,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193454318] [2022-01-10 03:05:24,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:05:24,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 03:05:24,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:05:24,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 03:05:24,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:05:24,976 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:05:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:05:24,993 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2022-01-10 03:05:24,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 03:05:24,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-10 03:05:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:05:24,994 INFO L225 Difference]: With dead ends: 114 [2022-01-10 03:05:24,994 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 03:05:24,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 03:05:24,996 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:05:24,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:05:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 03:05:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-01-10 03:05:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 52 states have internal predecessors, (63), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 03:05:25,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2022-01-10 03:05:25,004 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 20 [2022-01-10 03:05:25,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:05:25,004 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-01-10 03:05:25,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 03:05:25,005 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2022-01-10 03:05:25,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 03:05:25,005 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:05:25,006 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:05:25,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 03:05:25,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:05:25,215 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:05:25,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:05:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2021496606, now seen corresponding path program 2 times [2022-01-10 03:05:25,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:05:25,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413118788] [2022-01-10 03:05:25,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:05:25,216 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:05:25,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:05:25,217 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:05:25,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 03:05:25,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 03:05:25,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:05:25,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:05:25,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:05:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 03:05:25,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:05:25,402 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:05:25,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413118788] [2022-01-10 03:05:25,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413118788] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:05:25,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:05:25,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:05:25,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276379307] [2022-01-10 03:05:25,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:05:25,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:05:25,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:05:25,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:05:25,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:05:25,405 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:05:25,498 INFO L93 Difference]: Finished difference Result 85 states and 101 transitions. [2022-01-10 03:05:25,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:05:25,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 03:05:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:05:25,500 INFO L225 Difference]: With dead ends: 85 [2022-01-10 03:05:25,500 INFO L226 Difference]: Without dead ends: 82 [2022-01-10 03:05:25,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:05:25,501 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:05:25,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 54 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:05:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-10 03:05:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2022-01-10 03:05:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 03:05:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-01-10 03:05:25,509 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 22 [2022-01-10 03:05:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:05:25,510 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-01-10 03:05:25,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-01-10 03:05:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 03:05:25,511 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:05:25,511 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:05:25,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 03:05:25,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:05:25,722 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:05:25,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:05:25,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1096543610, now seen corresponding path program 1 times [2022-01-10 03:05:25,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:05:25,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816795737] [2022-01-10 03:05:25,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:05:25,723 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:05:25,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:05:25,724 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:05:25,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 03:05:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:05:25,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 03:05:25,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:05:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:05:26,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:05:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:05:28,394 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:05:28,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816795737] [2022-01-10 03:05:28,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816795737] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:05:28,395 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:05:28,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2022-01-10 03:05:28,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646520129] [2022-01-10 03:05:28,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:05:28,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 03:05:28,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:05:28,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 03:05:28,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-01-10 03:05:28,396 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 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) [2022-01-10 03:05:32,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:05:32,661 INFO L93 Difference]: Finished difference Result 162 states and 204 transitions. [2022-01-10 03:05:32,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 03:05:32,663 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 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 26 [2022-01-10 03:05:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:05:32,664 INFO L225 Difference]: With dead ends: 162 [2022-01-10 03:05:32,664 INFO L226 Difference]: Without dead ends: 138 [2022-01-10 03:05:32,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2022-01-10 03:05:32,665 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 98 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-10 03:05:32,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 273 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-01-10 03:05:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-01-10 03:05:32,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 96. [2022-01-10 03:05:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.240506329113924) internal successors, (98), 80 states have internal predecessors, (98), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-10 03:05:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2022-01-10 03:05:32,677 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 26 [2022-01-10 03:05:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:05:32,677 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2022-01-10 03:05:32,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 15 states have internal predecessors, (41), 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) [2022-01-10 03:05:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2022-01-10 03:05:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 03:05:32,679 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:05:32,679 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:05:32,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-01-10 03:05:32,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:05:32,888 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:05:32,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:05:32,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1814741975, now seen corresponding path program 1 times [2022-01-10 03:05:32,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:05:32,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448906408] [2022-01-10 03:05:32,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:05:32,889 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:05:32,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:05:32,890 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:05:32,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 03:05:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:05:32,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 03:05:32,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:05:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:05:33,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:05:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 03:05:33,190 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:05:33,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448906408] [2022-01-10 03:05:33,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448906408] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:05:33,190 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:05:33,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-01-10 03:05:33,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229371378] [2022-01-10 03:05:33,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:05:33,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 03:05:33,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:05:33,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 03:05:33,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-01-10 03:05:33,192 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:05:33,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:05:33,407 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2022-01-10 03:05:33,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 03:05:33,408 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-01-10 03:05:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:05:33,409 INFO L225 Difference]: With dead ends: 119 [2022-01-10 03:05:33,409 INFO L226 Difference]: Without dead ends: 98 [2022-01-10 03:05:33,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-01-10 03:05:33,410 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 25 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 03:05:33,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 276 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 03:05:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-01-10 03:05:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-01-10 03:05:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-10 03:05:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-01-10 03:05:33,420 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 31 [2022-01-10 03:05:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:05:33,420 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-01-10 03:05:33,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:05:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-01-10 03:05:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 03:05:33,422 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:05:33,422 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-01-10 03:05:33,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 03:05:33,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:05:33,631 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:05:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:05:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash -815549923, now seen corresponding path program 2 times [2022-01-10 03:05:33,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:05:33,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010537867] [2022-01-10 03:05:33,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:05:33,632 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:05:33,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:05:33,633 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:05:33,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 03:05:33,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:05:33,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:05:33,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:05:33,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:05:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:05:33,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:05:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:05:33,898 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:05:33,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010537867] [2022-01-10 03:05:33,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010537867] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:05:33,898 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:05:33,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2022-01-10 03:05:33,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997883165] [2022-01-10 03:05:33,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:05:33,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 03:05:33,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:05:33,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 03:05:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 03:05:33,900 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 03:05:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:05:33,978 INFO L93 Difference]: Finished difference Result 131 states and 157 transitions. [2022-01-10 03:05:33,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:05:33,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2022-01-10 03:05:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:05:33,979 INFO L225 Difference]: With dead ends: 131 [2022-01-10 03:05:33,979 INFO L226 Difference]: Without dead ends: 72 [2022-01-10 03:05:33,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 03:05:33,980 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:05:33,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:05:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-10 03:05:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-01-10 03:05:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 60 states have internal predecessors, (73), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:05:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2022-01-10 03:05:33,992 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 32 [2022-01-10 03:05:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:05:33,993 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2022-01-10 03:05:33,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 03:05:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-01-10 03:05:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 03:05:33,994 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:05:33,994 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:05:34,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 03:05:34,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:05:34,209 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:05:34,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:05:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash 81521713, now seen corresponding path program 2 times [2022-01-10 03:05:34,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:05:34,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297878613] [2022-01-10 03:05:34,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:05:34,210 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:05:34,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:05:34,211 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:05:34,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 03:05:34,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:05:34,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:05:34,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 03:05:34,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:05:34,392 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 03:05:34,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:05:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:05:34,759 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:05:34,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297878613] [2022-01-10 03:05:34,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297878613] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:05:34,760 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:05:34,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-01-10 03:05:34,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490578804] [2022-01-10 03:05:34,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:05:34,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 03:05:34,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:05:34,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 03:05:34,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-01-10 03:05:34,761 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:05:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:05:35,165 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-01-10 03:05:35,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 03:05:35,168 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-01-10 03:05:35,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:05:35,169 INFO L225 Difference]: With dead ends: 92 [2022-01-10 03:05:35,169 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 03:05:35,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2022-01-10 03:05:35,170 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 89 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 03:05:35,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 237 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 03:05:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 03:05:35,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 03:05:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 03:05:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 03:05:35,171 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2022-01-10 03:05:35,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:05:35,171 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 03:05:35,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:05:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 03:05:35,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 03:05:35,174 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 03:05:35,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 03:05:35,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:05:35,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 03:05:37,012 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 03:05:37,012 INFO L858 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-01-10 03:05:37,012 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 47) no Hoare annotation was computed. [2022-01-10 03:05:37,012 INFO L854 garLoopResultBuilder]: At program point L38-2(lines 38 47) the Hoare annotation is: (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~A~0#1|) [2022-01-10 03:05:37,012 INFO L858 garLoopResultBuilder]: For program point L34-1(lines 34 37) no Hoare annotation was computed. [2022-01-10 03:05:37,012 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 03:05:37,012 INFO L854 garLoopResultBuilder]: At program point L34-3(lines 34 37) the Hoare annotation is: (let ((.cse1 (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse2 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse0 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))) (or (and (= (_ bv3 32) ~counter~0) .cse0 .cse1) (and (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) .cse2 .cse0 (= ~counter~0 (_ bv0 32)) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~B~0#1|)) (and (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= ~counter~0 (_ bv1 32)) .cse2 .cse0 (= (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) |ULTIMATE.start_main_~b~0#1|)) (and .cse2 .cse0 (= (_ bv4 32) ~counter~0)) (and (= (_ bv2 32) ~counter~0) (= (_ bv4 32) |ULTIMATE.start_main_~b~0#1|) .cse0 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv2 32)) .cse1) (and (= ~counter~0 (_ bv5 32)) .cse2 .cse0))) [2022-01-10 03:05:37,013 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 03:05:37,013 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 03:05:37,013 INFO L861 garLoopResultBuilder]: At program point L49(lines 26 50) the Hoare annotation is: true [2022-01-10 03:05:37,013 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 46) no Hoare annotation was computed. [2022-01-10 03:05:37,013 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 26 50) no Hoare annotation was computed. [2022-01-10 03:05:37,014 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse3 (bvslt ~counter~0 (_ bv5 32))) (.cse5 (= (_ bv4 32) ~counter~0)) (.cse2 (= (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~b~0#1|)) |ULTIMATE.start_main_~A~0#1|)) (.cse0 (= ~counter~0 (_ bv5 32))) (.cse6 (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32))) (.cse10 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)) (.cse1 (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))) (.cse4 (not (bvuge |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~b~0#1|))) (.cse7 (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~B~0#1|))) (or (and .cse0 .cse1 .cse2) (and (= (_ bv4 32) |ULTIMATE.start_main_~b~0#1|) .cse3 .cse1 .cse4 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv2 32)) .cse5 .cse2) (and .cse6 .cse3 .cse7 .cse5 .cse2) (let ((.cse8 (bvneg |ULTIMATE.start_main_~b~0#1|))) (let ((.cse9 (bvadd |ULTIMATE.start_main_~r~0#1| (bvmul (_ bv4294967295 32) .cse8)))) (and .cse0 (= |ULTIMATE.start_main_~r~0#1| (bvadd (bvmul .cse8 (_ bv1 32)) |ULTIMATE.start_main_~A~0#1|)) (not (bvuge .cse9 (_ bv4 32))) (= |ULTIMATE.start_main_~b~0#1| (_ bv2 32)) (bvuge .cse9 (_ bv2 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv1 32))))) (and .cse6 (bvuge |ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= (_ bv3 32) ~counter~0) .cse10 .cse1 .cse4 (= (bvmul |ULTIMATE.start_main_~B~0#1| (_ bv2 32)) |ULTIMATE.start_main_~b~0#1|)) (and (= (_ bv2 32) ~counter~0) (= |ULTIMATE.start_main_~b~0#1| (_ bv1 32)) .cse10 .cse1 .cse4 .cse7))) [2022-01-10 03:05:37,014 INFO L858 garLoopResultBuilder]: For program point L39-1(lines 38 47) no Hoare annotation was computed. [2022-01-10 03:05:37,014 INFO L858 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-01-10 03:05:37,014 INFO L858 garLoopResultBuilder]: For program point L19-2(lines 18 24) no Hoare annotation was computed. [2022-01-10 03:05:37,014 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-01-10 03:05:37,014 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 24) no Hoare annotation was computed. [2022-01-10 03:05:37,014 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 21) no Hoare annotation was computed. [2022-01-10 03:05:37,015 INFO L858 garLoopResultBuilder]: For program point L19(lines 19 22) no Hoare annotation was computed. [2022-01-10 03:05:37,015 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2022-01-10 03:05:37,017 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:05:37,019 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 03:05:37,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:05:37 BoogieIcfgContainer [2022-01-10 03:05:37,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 03:05:37,031 INFO L158 Benchmark]: Toolchain (without parser) took 22392.49ms. Allocated memory was 188.7MB in the beginning and 241.2MB in the end (delta: 52.4MB). Free memory was 130.0MB in the beginning and 98.2MB in the end (delta: 31.9MB). Peak memory consumption was 85.3MB. Max. memory is 8.0GB. [2022-01-10 03:05:37,031 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 03:05:37,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.12ms. Allocated memory was 188.7MB in the beginning and 241.2MB in the end (delta: 52.4MB). Free memory was 129.8MB in the beginning and 213.5MB in the end (delta: -83.6MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-01-10 03:05:37,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.31ms. Allocated memory is still 241.2MB. Free memory was 213.5MB in the beginning and 211.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 03:05:37,031 INFO L158 Benchmark]: Boogie Preprocessor took 35.31ms. Allocated memory is still 241.2MB. Free memory was 211.9MB in the beginning and 210.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:05:37,032 INFO L158 Benchmark]: RCFGBuilder took 299.54ms. Allocated memory is still 241.2MB. Free memory was 210.9MB in the beginning and 199.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 03:05:37,032 INFO L158 Benchmark]: TraceAbstraction took 21712.77ms. Allocated memory is still 241.2MB. Free memory was 199.3MB in the beginning and 98.2MB in the end (delta: 101.2MB). Peak memory consumption was 101.7MB. Max. memory is 8.0GB. [2022-01-10 03:05:37,033 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.12ms. Allocated memory was 188.7MB in the beginning and 241.2MB in the end (delta: 52.4MB). Free memory was 129.8MB in the beginning and 213.5MB in the end (delta: -83.6MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.31ms. Allocated memory is still 241.2MB. Free memory was 213.5MB in the beginning and 211.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.31ms. Allocated memory is still 241.2MB. Free memory was 211.9MB in the beginning and 210.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 299.54ms. Allocated memory is still 241.2MB. Free memory was 210.9MB in the beginning and 199.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 21712.77ms. Allocated memory is still 241.2MB. Free memory was 199.3MB in the beginning and 98.2MB in the end (delta: 101.2MB). Peak memory consumption was 101.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 384 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 1621 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1314 mSDsCounter, 200 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 940 IncrementalHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 200 mSolverCounterUnsat, 307 mSDtfsCounter, 940 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 301 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=10, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 98 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 53 PreInvPairs, 78 NumberOfFragments, 243 HoareAnnotationTreeSize, 53 FomulaSimplifications, 170 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 772 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 246 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 1894 SizeOfPredicates, 20 NumberOfNonLiveVariables, 551 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 20 InterpolantComputations, 6 PerfectInterpolantSequences, 81/267 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((3bv32 == counter && q == 0bv32) && ~bvadd16(r, ~bvmul32(q, b)) == A) || ((((b == 1bv32 && r == A) && q == 0bv32) && counter == 0bv32) && b == B)) || (((((B == 1bv32 && ~bvuge32(r, 1bv32)) && counter == 1bv32) && r == A) && q == 0bv32) && ~bvmul32(B, 2bv32) == b)) || ((r == A && q == 0bv32) && 4bv32 == counter)) || ((((2bv32 == counter && 4bv32 == b) && q == 0bv32) && ~bvuge32(r, 2bv32)) && ~bvadd16(r, ~bvmul32(q, b)) == A)) || ((counter == 5bv32 && r == A) && q == 0bv32) RESULT: Ultimate proved your program to be correct! [2022-01-10 03:05:37,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...