/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/cohencu-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:00:49,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:00:49,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:00:50,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:00:50,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:00:50,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:00:50,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:00:50,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:00:50,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:00:50,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:00:50,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:00:50,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:00:50,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:00:50,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:00:50,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:00:50,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:00:50,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:00:50,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:00:50,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:00:50,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:00:50,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:00:50,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:00:50,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:00:50,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:00:50,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:00:50,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:00:50,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:00:50,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:00:50,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:00:50,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:00:50,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:00:50,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:00:50,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:00:50,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:00:50,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:00:50,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:00:50,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:00:50,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:00:50,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:00:50,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:00:50,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:00:50,059 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:00:50,090 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:00:50,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:00:50,090 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:00:50,090 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:00:50,091 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:00:50,091 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:00:50,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:00:50,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:00:50,092 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:00:50,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:00:50,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:00:50,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:00:50,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:00:50,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:00:50,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:00:50,094 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:00:50,094 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:00:50,094 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:00:50,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:00:50,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:00:50,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:00:50,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:00:50,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:00:50,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:00:50,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:00:50,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:00:50,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:00:50,095 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:00:50,095 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:00:50,095 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:00:50,096 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:00:50,096 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:00:50,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:00:50,097 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:00:50,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:00:50,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:00:50,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:00:50,317 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:00:50,318 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:00:50,319 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2022-01-10 03:00:50,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f75a59b/34a849a78cbd4d3e8acb8f7a6c9c3b9c/FLAG1806af1b0 [2022-01-10 03:00:50,750 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:00:50,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2022-01-10 03:00:50,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f75a59b/34a849a78cbd4d3e8acb8f7a6c9c3b9c/FLAG1806af1b0 [2022-01-10 03:00:51,146 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01f75a59b/34a849a78cbd4d3e8acb8f7a6c9c3b9c [2022-01-10 03:00:51,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:00:51,149 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:00:51,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:00:51,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:00:51,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:00:51,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:00:51" (1/1) ... [2022-01-10 03:00:51,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa0954c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:51, skipping insertion in model container [2022-01-10 03:00:51,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:00:51" (1/1) ... [2022-01-10 03:00:51,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:00:51,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:00:51,305 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/cohencu-ll_unwindbound10.c[588,601] [2022-01-10 03:00:51,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:00:51,368 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:00:51,378 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/cohencu-ll_unwindbound10.c[588,601] [2022-01-10 03:00:51,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:00:51,402 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:00:51,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:51 WrapperNode [2022-01-10 03:00:51,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:00:51,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:00:51,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:00:51,404 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:00:51,410 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:00:51" (1/1) ... [2022-01-10 03:00:51,416 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:00:51" (1/1) ... [2022-01-10 03:00:51,432 INFO L137 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-01-10 03:00:51,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:00:51,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:00:51,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:00:51,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:00:51,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:51" (1/1) ... [2022-01-10 03:00:51,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:51" (1/1) ... [2022-01-10 03:00:51,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:51" (1/1) ... [2022-01-10 03:00:51,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:51" (1/1) ... [2022-01-10 03:00:51,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:51" (1/1) ... [2022-01-10 03:00:51,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:51" (1/1) ... [2022-01-10 03:00:51,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:51" (1/1) ... [2022-01-10 03:00:51,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:00:51,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:00:51,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:00:51,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:00:51,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:51" (1/1) ... [2022-01-10 03:00:51,475 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:00:51,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:00:51,498 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:00:51,516 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:00:51,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:00:51,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:00:51,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:00:51,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:00:51,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:00:51,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:00:51,577 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:00:51,578 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:00:51,701 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:00:51,706 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:00:51,706 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 03:00:51,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:00:51 BoogieIcfgContainer [2022-01-10 03:00:51,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:00:51,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:00:51,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:00:51,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:00:51,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:00:51" (1/3) ... [2022-01-10 03:00:51,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed88dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:00:51, skipping insertion in model container [2022-01-10 03:00:51,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:00:51" (2/3) ... [2022-01-10 03:00:51,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed88dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:00:51, skipping insertion in model container [2022-01-10 03:00:51,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:00:51" (3/3) ... [2022-01-10 03:00:51,715 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound10.c [2022-01-10 03:00:51,719 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:00:51,720 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:00:51,757 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:00:51,763 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:00:51,763 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:00:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-10 03:00:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-01-10 03:00:51,779 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:00:51,780 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:00:51,780 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:00:51,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:00:51,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1823967074, now seen corresponding path program 1 times [2022-01-10 03:00:51,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:00:51,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622909994] [2022-01-10 03:00:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:00:51,805 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:00:51,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:00:51,827 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:00:51,871 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:00:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:00:51,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:00:51,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:00:51,980 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:00:51,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:00:51,981 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:00:51,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622909994] [2022-01-10 03:00:51,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622909994] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:00:51,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:00:51,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:00:51,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098288751] [2022-01-10 03:00:51,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:00:51,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:00:51,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:00:52,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:00:52,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:00:52,027 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:00:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:00:52,056 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2022-01-10 03:00:52,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:00:52,059 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2022-01-10 03:00:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:00:52,078 INFO L225 Difference]: With dead ends: 50 [2022-01-10 03:00:52,078 INFO L226 Difference]: Without dead ends: 22 [2022-01-10 03:00:52,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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:00:52,090 INFO L933 BasicCegarLoop]: 37 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, 37 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:00:52,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:00:52,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-10 03:00:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-10 03:00:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:00:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2022-01-10 03:00:52,144 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2022-01-10 03:00:52,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:00:52,144 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2022-01-10 03:00:52,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:00:52,145 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2022-01-10 03:00:52,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 03:00:52,147 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:00:52,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:00:52,162 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:00:52,356 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:00:52,357 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:00:52,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:00:52,361 INFO L85 PathProgramCache]: Analyzing trace with hash 178926099, now seen corresponding path program 1 times [2022-01-10 03:00:52,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:00:52,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784435171] [2022-01-10 03:00:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:00:52,363 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:00:52,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:00:52,365 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:00:52,367 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:00:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:00:52,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:00:52,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:00:52,469 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:00:52,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:00:52,469 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:00:52,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784435171] [2022-01-10 03:00:52,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784435171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:00:52,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:00:52,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:00:52,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046877674] [2022-01-10 03:00:52,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:00:52,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:00:52,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:00:52,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:00:52,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:00:52,479 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:00:52,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:00:52,514 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-01-10 03:00:52,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:00:52,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:00:52,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:00:52,516 INFO L225 Difference]: With dead ends: 36 [2022-01-10 03:00:52,517 INFO L226 Difference]: Without dead ends: 24 [2022-01-10 03:00:52,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:00:52,519 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:00:52,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:00:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-10 03:00:52,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-10 03:00:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-10 03:00:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2022-01-10 03:00:52,537 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 8 [2022-01-10 03:00:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:00:52,540 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2022-01-10 03:00:52,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:00:52,543 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-01-10 03:00:52,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 03:00:52,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:00:52,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:00:52,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 03:00:52,753 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:00:52,754 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:00:52,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:00:52,754 INFO L85 PathProgramCache]: Analyzing trace with hash 180475231, now seen corresponding path program 1 times [2022-01-10 03:00:52,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:00:52,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119550641] [2022-01-10 03:00:52,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:00:52,755 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:00:52,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:00:52,757 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:00:52,759 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:00:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:00:52,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:00:52,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:00:52,895 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:00:52,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:00:52,895 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:00:52,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119550641] [2022-01-10 03:00:52,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119550641] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:00:52,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:00:52,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:00:52,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293882076] [2022-01-10 03:00:52,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:00:52,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:00:52,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:00:52,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:00:52,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:00:52,903 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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:00:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:00:53,711 INFO L93 Difference]: Finished difference Result 42 states and 63 transitions. [2022-01-10 03:00:53,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:00:53,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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:00:53,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:00:53,721 INFO L225 Difference]: With dead ends: 42 [2022-01-10 03:00:53,721 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 03:00:53,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:00:53,722 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 03:00:53,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 137 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 03:00:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 03:00:53,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-01-10 03:00:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-10 03:00:53,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2022-01-10 03:00:53,735 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 8 [2022-01-10 03:00:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:00:53,736 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2022-01-10 03:00:53,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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:00:53,736 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2022-01-10 03:00:53,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 03:00:53,737 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:00:53,737 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:00:53,745 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:00:53,945 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:00:53,945 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:00:53,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:00:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1275442234, now seen corresponding path program 1 times [2022-01-10 03:00:53,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:00:53,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651326839] [2022-01-10 03:00:53,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:00:53,947 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:00:53,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:00:53,948 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:00:53,949 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:00:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:00:54,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:00:54,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:00:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:00:54,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:00:54,119 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:00:54,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651326839] [2022-01-10 03:00:54,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651326839] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:00:54,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:00:54,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:00:54,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922613628] [2022-01-10 03:00:54,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:00:54,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:00:54,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:00:54,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:00:54,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:00:54,121 INFO L87 Difference]: Start difference. First operand 35 states and 52 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, (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:00:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:00:54,879 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-01-10 03:00:54,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:00:54,879 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, (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 13 [2022-01-10 03:00:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:00:54,880 INFO L225 Difference]: With dead ends: 46 [2022-01-10 03:00:54,880 INFO L226 Difference]: Without dead ends: 44 [2022-01-10 03:00:54,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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:00:54,881 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 03:00:54,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 137 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 03:00:54,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-10 03:00:54,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2022-01-10 03:00:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-10 03:00:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2022-01-10 03:00:54,889 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 13 [2022-01-10 03:00:54,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:00:54,890 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2022-01-10 03:00:54,890 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, (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:00:54,890 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2022-01-10 03:00:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 03:00:54,890 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:00:54,890 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:00:54,899 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:00:55,095 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:00:55,095 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:00:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:00:55,097 INFO L85 PathProgramCache]: Analyzing trace with hash 427545983, now seen corresponding path program 1 times [2022-01-10 03:00:55,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:00:55,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659111995] [2022-01-10 03:00:55,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:00:55,098 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:00:55,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:00:55,099 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:00:55,100 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:00:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:00:55,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:00:55,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:00:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:00:55,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:00:55,328 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:00:55,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659111995] [2022-01-10 03:00:55,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659111995] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:00:55,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:00:55,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:00:55,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935532074] [2022-01-10 03:00:55,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:00:55,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:00:55,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:00:55,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:00:55,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:00:55,330 INFO L87 Difference]: Start difference. First operand 39 states and 55 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:00:56,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:00:56,557 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-01-10 03:00:56,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:00:56,566 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-01-10 03:00:56,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:00:56,567 INFO L225 Difference]: With dead ends: 50 [2022-01-10 03:00:56,567 INFO L226 Difference]: Without dead ends: 48 [2022-01-10 03:00:56,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:00:56,568 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 03:00:56,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 03:00:56,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-10 03:00:56,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-01-10 03:00:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-01-10 03:00:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-01-10 03:00:56,577 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2022-01-10 03:00:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:00:56,577 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-01-10 03:00:56,577 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:00:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-01-10 03:00:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 03:00:56,578 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:00:56,578 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:00:56,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-01-10 03:00:56,792 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:00:56,793 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:00:56,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:00:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash 5607206, now seen corresponding path program 1 times [2022-01-10 03:00:56,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:00:56,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989602660] [2022-01-10 03:00:56,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:00:56,794 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:00:56,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:00:56,795 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:00:56,796 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:00:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:00:56,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 03:00:56,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:00:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 03:00:57,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:00:57,093 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:00:57,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989602660] [2022-01-10 03:00:57,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989602660] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:00:57,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:00:57,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:00:57,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542171174] [2022-01-10 03:00:57,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:00:57,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:00:57,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:00:57,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:00:57,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:00:57,095 INFO L87 Difference]: Start difference. First operand 44 states and 60 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:00:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:00:58,648 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-01-10 03:00:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:00:58,658 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-01-10 03:00:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:00:58,659 INFO L225 Difference]: With dead ends: 58 [2022-01-10 03:00:58,659 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 03:00:58,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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:00:58,660 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 03:00:58,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 03:00:58,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 03:00:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-10 03:00:58,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-10 03:00:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-01-10 03:00:58,666 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2022-01-10 03:00:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:00:58,667 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-01-10 03:00:58,667 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:00:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-01-10 03:00:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 03:00:58,668 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:00:58,668 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:00:58,678 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:00:58,868 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:00:58,869 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:00:58,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:00:58,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1618699309, now seen corresponding path program 1 times [2022-01-10 03:00:58,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:00:58,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691862249] [2022-01-10 03:00:58,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:00:58,870 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:00:58,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:00:58,871 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:00:58,873 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:00:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:00:59,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:00:59,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:00:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 03:00:59,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:00:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 03:00:59,363 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:00:59,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691862249] [2022-01-10 03:00:59,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691862249] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:00:59,364 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:00:59,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-01-10 03:00:59,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907240241] [2022-01-10 03:00:59,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:00:59,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 03:00:59,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:00:59,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 03:00:59,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-10 03:00:59,365 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 03:01:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:04,181 INFO L93 Difference]: Finished difference Result 100 states and 139 transitions. [2022-01-10 03:01:04,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 03:01:04,192 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 36 [2022-01-10 03:01:04,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:04,193 INFO L225 Difference]: With dead ends: 100 [2022-01-10 03:01:04,193 INFO L226 Difference]: Without dead ends: 88 [2022-01-10 03:01:04,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 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:01:04,194 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 43 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:04,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 226 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-01-10 03:01:04,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-10 03:01:04,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2022-01-10 03:01:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-01-10 03:01:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2022-01-10 03:01:04,208 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 36 [2022-01-10 03:01:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:04,208 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2022-01-10 03:01:04,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 03:01:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2022-01-10 03:01:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 03:01:04,209 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:04,209 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:04,225 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:01:04,424 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:01:04,425 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:04,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:04,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1620248441, now seen corresponding path program 1 times [2022-01-10 03:01:04,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:04,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594689558] [2022-01-10 03:01:04,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:01:04,426 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:04,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:04,427 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:01:04,442 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:01:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:01:04,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:01:04,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 03:01:04,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:01:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-01-10 03:01:05,098 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:05,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594689558] [2022-01-10 03:01:05,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594689558] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:01:05,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:01:05,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-01-10 03:01:05,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389505817] [2022-01-10 03:01:05,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:01:05,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:01:05,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:05,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:01:05,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:01:05,100 INFO L87 Difference]: Start difference. First operand 84 states and 118 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 03:01:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:06,044 INFO L93 Difference]: Finished difference Result 98 states and 131 transitions. [2022-01-10 03:01:06,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:01:06,056 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-01-10 03:01:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:06,057 INFO L225 Difference]: With dead ends: 98 [2022-01-10 03:01:06,057 INFO L226 Difference]: Without dead ends: 96 [2022-01-10 03:01:06,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:01:06,058 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:06,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 84 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 03:01:06,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-01-10 03:01:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-01-10 03:01:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-01-10 03:01:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2022-01-10 03:01:06,079 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 36 [2022-01-10 03:01:06,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:06,079 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2022-01-10 03:01:06,079 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 03:01:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2022-01-10 03:01:06,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 03:01:06,080 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:06,080 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:06,099 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:01:06,295 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:01:06,296 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:06,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:06,296 INFO L85 PathProgramCache]: Analyzing trace with hash -680109588, now seen corresponding path program 2 times [2022-01-10 03:01:06,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:06,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891940243] [2022-01-10 03:01:06,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:01:06,297 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:06,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:06,298 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:01:06,298 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:01:06,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:01:06,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:01:06,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:01:06,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-10 03:01:06,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:01:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-10 03:01:10,093 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:10,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891940243] [2022-01-10 03:01:10,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891940243] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:01:10,094 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:01:10,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 03:01:10,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181691182] [2022-01-10 03:01:10,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:01:10,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:01:10,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:10,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:01:10,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:01:10,095 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-01-10 03:01:14,516 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:17,427 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:19,801 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:21,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:26,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:01:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:28,530 INFO L93 Difference]: Finished difference Result 126 states and 166 transitions. [2022-01-10 03:01:28,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 03:01:28,541 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 41 [2022-01-10 03:01:28,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:28,542 INFO L225 Difference]: With dead ends: 126 [2022-01-10 03:01:28,542 INFO L226 Difference]: Without dead ends: 124 [2022-01-10 03:01:28,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-01-10 03:01:28,543 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 17 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 60 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:28,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 237 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 132 Invalid, 5 Unknown, 0 Unchecked, 17.1s Time] [2022-01-10 03:01:28,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-01-10 03:01:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2022-01-10 03:01:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 59 states have (on average 1.11864406779661) internal successors, (66), 63 states have internal predecessors, (66), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-01-10 03:01:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 143 transitions. [2022-01-10 03:01:28,578 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 143 transitions. Word has length 41 [2022-01-10 03:01:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:28,578 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 143 transitions. [2022-01-10 03:01:28,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-01-10 03:01:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 143 transitions. [2022-01-10 03:01:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 03:01:28,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:28,586 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:28,605 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:01:28,803 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:01:28,804 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:28,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash -399462631, now seen corresponding path program 3 times [2022-01-10 03:01:28,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:28,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174971351] [2022-01-10 03:01:28,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 03:01:28,805 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:28,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:28,809 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:01:28,810 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:01:28,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-10 03:01:28,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:01:28,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 03:01:28,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-10 03:01:29,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:01:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-01-10 03:01:38,479 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:38,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174971351] [2022-01-10 03:01:38,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174971351] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:01:38,480 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:01:38,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 03:01:38,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897424489] [2022-01-10 03:01:38,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:01:38,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:01:38,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:38,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:01:38,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:01:38,481 INFO L87 Difference]: Start difference. First operand 114 states and 143 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-01-10 03:01:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:01:41,746 INFO L93 Difference]: Finished difference Result 120 states and 148 transitions. [2022-01-10 03:01:41,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 03:01:41,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 46 [2022-01-10 03:01:41,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:01:41,759 INFO L225 Difference]: With dead ends: 120 [2022-01-10 03:01:41,759 INFO L226 Difference]: Without dead ends: 118 [2022-01-10 03:01:41,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:01:41,760 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 10 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:01:41,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 285 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-01-10 03:01:41,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-01-10 03:01:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-01-10 03:01:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 66 states have internal predecessors, (69), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-01-10 03:01:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2022-01-10 03:01:41,778 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 46 [2022-01-10 03:01:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:01:41,779 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2022-01-10 03:01:41,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-01-10 03:01:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2022-01-10 03:01:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 03:01:41,779 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:01:41,780 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:01:41,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 03:01:41,991 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:01:41,991 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:01:41,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:01:41,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1802852916, now seen corresponding path program 4 times [2022-01-10 03:01:41,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:01:41,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471247776] [2022-01-10 03:01:41,992 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 03:01:41,992 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:01:41,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:01:41,993 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:01:41,995 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:01:42,224 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 03:01:42,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:01:42,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 03:01:42,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:01:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 03:01:42,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:01:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 03:01:51,213 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:01:51,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471247776] [2022-01-10 03:01:51,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471247776] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:01:51,213 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:01:51,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-01-10 03:01:51,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643781835] [2022-01-10 03:01:51,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:01:51,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 03:01:51,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:01:51,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 03:01:51,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:01:51,214 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-01-10 03:02:00,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:02:02,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []