/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:26:16,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:26:16,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:26:16,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:26:16,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:26:16,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:26:16,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:26:16,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:26:16,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:26:16,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:26:16,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:26:16,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:26:16,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:26:16,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:26:16,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:26:16,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:26:16,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:26:16,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:26:16,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:26:16,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:26:16,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:26:16,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:26:16,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:26:16,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:26:16,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:26:16,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:26:16,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:26:16,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:26:16,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:26:16,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:26:16,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:26:16,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:26:16,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:26:16,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:26:16,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:26:16,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:26:16,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:26:16,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:26:16,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:26:16,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:26:16,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:26:16,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:26:16,795 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:26:16,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:26:16,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:26:16,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:26:16,801 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:26:16,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:26:16,801 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:26:16,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:26:16,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:26:16,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:26:16,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:26:16,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:26:16,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:26:16,804 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:26:16,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:26:16,804 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:26:16,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:26:16,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:26:16,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:26:16,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:26:16,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:26:16,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:26:16,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:26:16,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:26:16,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:26:16,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:26:16,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:26:16,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:26:16,807 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:26:16,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2020-11-06 22:26:17,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:26:17,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:26:17,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:26:17,225 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:26:17,226 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:26:17,227 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2020-11-06 22:26:17,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d44f4a9c/e774d3b4123a464a8ab6aaac4e0e2ec4/FLAGad6d3df91 [2020-11-06 22:26:18,023 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:26:18,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2020-11-06 22:26:18,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d44f4a9c/e774d3b4123a464a8ab6aaac4e0e2ec4/FLAGad6d3df91 [2020-11-06 22:26:18,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d44f4a9c/e774d3b4123a464a8ab6aaac4e0e2ec4 [2020-11-06 22:26:18,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:26:18,355 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:26:18,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:26:18,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:26:18,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:26:18,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:18" (1/1) ... [2020-11-06 22:26:18,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@194dab58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:18, skipping insertion in model container [2020-11-06 22:26:18,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:18" (1/1) ... [2020-11-06 22:26:18,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:26:18,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:26:18,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:26:18,602 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:26:18,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:26:18,645 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:26:18,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:18 WrapperNode [2020-11-06 22:26:18,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:26:18,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:26:18,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:26:18,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:26:18,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:18" (1/1) ... [2020-11-06 22:26:18,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:18" (1/1) ... [2020-11-06 22:26:18,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:18" (1/1) ... [2020-11-06 22:26:18,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:18" (1/1) ... [2020-11-06 22:26:18,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:18" (1/1) ... [2020-11-06 22:26:18,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:18" (1/1) ... [2020-11-06 22:26:18,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:18" (1/1) ... [2020-11-06 22:26:18,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:26:18,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:26:18,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:26:18,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:26:18,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:26:18,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:26:18,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:26:18,785 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:26:18,785 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:26:18,786 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:26:18,786 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:26:18,786 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:26:18,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:26:18,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:26:18,786 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:26:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:26:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:26:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:26:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:26:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:26:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:26:19,209 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:26:19,210 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-06 22:26:19,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:19 BoogieIcfgContainer [2020-11-06 22:26:19,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:26:19,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:26:19,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:26:19,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:26:19,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:26:18" (1/3) ... [2020-11-06 22:26:19,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@825fee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:26:19, skipping insertion in model container [2020-11-06 22:26:19,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:18" (2/3) ... [2020-11-06 22:26:19,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@825fee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:26:19, skipping insertion in model container [2020-11-06 22:26:19,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:19" (3/3) ... [2020-11-06 22:26:19,222 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2020-11-06 22:26:19,248 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:26:19,258 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:26:19,278 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:26:19,308 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:26:19,308 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:26:19,308 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:26:19,308 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:26:19,308 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:26:19,309 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:26:19,309 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:26:19,309 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:26:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-11-06 22:26:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-06 22:26:19,336 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:19,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:19,338 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:19,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1724318403, now seen corresponding path program 1 times [2020-11-06 22:26:19,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:19,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724769207] [2020-11-06 22:26:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:19,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:19,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724769207] [2020-11-06 22:26:19,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:19,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:19,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287393551] [2020-11-06 22:26:19,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:19,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:19,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:19,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:19,834 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 4 states. [2020-11-06 22:26:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:20,106 INFO L93 Difference]: Finished difference Result 92 states and 157 transitions. [2020-11-06 22:26:20,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:20,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-11-06 22:26:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:20,121 INFO L225 Difference]: With dead ends: 92 [2020-11-06 22:26:20,122 INFO L226 Difference]: Without dead ends: 73 [2020-11-06 22:26:20,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-06 22:26:20,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 52. [2020-11-06 22:26:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-06 22:26:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 91 transitions. [2020-11-06 22:26:20,201 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 91 transitions. Word has length 22 [2020-11-06 22:26:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:20,203 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 91 transitions. [2020-11-06 22:26:20,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 91 transitions. [2020-11-06 22:26:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-06 22:26:20,206 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:20,207 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:20,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:26:20,208 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:20,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1559531643, now seen corresponding path program 1 times [2020-11-06 22:26:20,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:20,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881373459] [2020-11-06 22:26:20,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:20,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:20,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881373459] [2020-11-06 22:26:20,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:20,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:20,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935809922] [2020-11-06 22:26:20,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:20,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:20,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:20,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:20,379 INFO L87 Difference]: Start difference. First operand 52 states and 91 transitions. Second operand 4 states. [2020-11-06 22:26:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:20,606 INFO L93 Difference]: Finished difference Result 119 states and 215 transitions. [2020-11-06 22:26:20,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:20,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-11-06 22:26:20,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:20,609 INFO L225 Difference]: With dead ends: 119 [2020-11-06 22:26:20,609 INFO L226 Difference]: Without dead ends: 73 [2020-11-06 22:26:20,611 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-06 22:26:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2020-11-06 22:26:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-06 22:26:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 127 transitions. [2020-11-06 22:26:20,625 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 127 transitions. Word has length 22 [2020-11-06 22:26:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:20,625 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 127 transitions. [2020-11-06 22:26:20,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 127 transitions. [2020-11-06 22:26:20,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-06 22:26:20,626 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:20,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:20,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:26:20,627 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:20,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:20,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1907654547, now seen corresponding path program 1 times [2020-11-06 22:26:20,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:20,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419217684] [2020-11-06 22:26:20,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:20,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:20,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419217684] [2020-11-06 22:26:20,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:20,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:20,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698134211] [2020-11-06 22:26:20,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:20,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:20,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:20,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:20,734 INFO L87 Difference]: Start difference. First operand 72 states and 127 transitions. Second operand 4 states. [2020-11-06 22:26:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:20,908 INFO L93 Difference]: Finished difference Result 110 states and 192 transitions. [2020-11-06 22:26:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:20,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-11-06 22:26:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:20,910 INFO L225 Difference]: With dead ends: 110 [2020-11-06 22:26:20,911 INFO L226 Difference]: Without dead ends: 76 [2020-11-06 22:26:20,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-11-06 22:26:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2020-11-06 22:26:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-06 22:26:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 129 transitions. [2020-11-06 22:26:20,923 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 129 transitions. Word has length 23 [2020-11-06 22:26:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:20,924 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 129 transitions. [2020-11-06 22:26:20,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 129 transitions. [2020-11-06 22:26:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-06 22:26:20,925 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:20,925 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:20,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:26:20,926 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:20,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:20,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1107449071, now seen corresponding path program 1 times [2020-11-06 22:26:20,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:20,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357770702] [2020-11-06 22:26:20,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:20,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:20,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357770702] [2020-11-06 22:26:20,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:20,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:20,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306420040] [2020-11-06 22:26:20,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:20,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:20,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:20,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:21,000 INFO L87 Difference]: Start difference. First operand 75 states and 129 transitions. Second operand 4 states. [2020-11-06 22:26:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:21,162 INFO L93 Difference]: Finished difference Result 203 states and 362 transitions. [2020-11-06 22:26:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:21,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-11-06 22:26:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:21,164 INFO L225 Difference]: With dead ends: 203 [2020-11-06 22:26:21,164 INFO L226 Difference]: Without dead ends: 137 [2020-11-06 22:26:21,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-06 22:26:21,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2020-11-06 22:26:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-11-06 22:26:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 238 transitions. [2020-11-06 22:26:21,180 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 238 transitions. Word has length 23 [2020-11-06 22:26:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:21,181 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 238 transitions. [2020-11-06 22:26:21,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 238 transitions. [2020-11-06 22:26:21,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-06 22:26:21,182 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:21,182 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:21,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:26:21,183 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:21,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash 2118566321, now seen corresponding path program 1 times [2020-11-06 22:26:21,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:21,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69064440] [2020-11-06 22:26:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:21,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:21,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69064440] [2020-11-06 22:26:21,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:21,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:21,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563539526] [2020-11-06 22:26:21,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:21,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:21,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:21,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:21,311 INFO L87 Difference]: Start difference. First operand 136 states and 238 transitions. Second operand 4 states. [2020-11-06 22:26:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:21,474 INFO L93 Difference]: Finished difference Result 176 states and 309 transitions. [2020-11-06 22:26:21,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:21,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-11-06 22:26:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:21,476 INFO L225 Difference]: With dead ends: 176 [2020-11-06 22:26:21,477 INFO L226 Difference]: Without dead ends: 173 [2020-11-06 22:26:21,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-11-06 22:26:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 136. [2020-11-06 22:26:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-11-06 22:26:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 236 transitions. [2020-11-06 22:26:21,491 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 236 transitions. Word has length 23 [2020-11-06 22:26:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:21,491 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 236 transitions. [2020-11-06 22:26:21,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 236 transitions. [2020-11-06 22:26:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:26:21,493 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:21,494 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:21,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:26:21,494 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash -22198202, now seen corresponding path program 1 times [2020-11-06 22:26:21,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:21,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974951366] [2020-11-06 22:26:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:21,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:21,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974951366] [2020-11-06 22:26:21,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:21,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:21,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15632073] [2020-11-06 22:26:21,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:21,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:21,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:21,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:21,561 INFO L87 Difference]: Start difference. First operand 136 states and 236 transitions. Second operand 4 states. [2020-11-06 22:26:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:21,709 INFO L93 Difference]: Finished difference Result 252 states and 445 transitions. [2020-11-06 22:26:21,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:21,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-06 22:26:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:21,712 INFO L225 Difference]: With dead ends: 252 [2020-11-06 22:26:21,712 INFO L226 Difference]: Without dead ends: 249 [2020-11-06 22:26:21,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-11-06 22:26:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 184. [2020-11-06 22:26:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-11-06 22:26:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 318 transitions. [2020-11-06 22:26:21,730 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 318 transitions. Word has length 24 [2020-11-06 22:26:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:21,730 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 318 transitions. [2020-11-06 22:26:21,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 318 transitions. [2020-11-06 22:26:21,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:26:21,736 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:21,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:21,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:26:21,736 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:21,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:21,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1033315452, now seen corresponding path program 1 times [2020-11-06 22:26:21,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:21,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844884510] [2020-11-06 22:26:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:21,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:21,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:21,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844884510] [2020-11-06 22:26:21,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:21,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:21,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344841759] [2020-11-06 22:26:21,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:21,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:21,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:21,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:21,796 INFO L87 Difference]: Start difference. First operand 184 states and 318 transitions. Second operand 4 states. [2020-11-06 22:26:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:21,951 INFO L93 Difference]: Finished difference Result 432 states and 757 transitions. [2020-11-06 22:26:21,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:21,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-06 22:26:21,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:21,954 INFO L225 Difference]: With dead ends: 432 [2020-11-06 22:26:21,954 INFO L226 Difference]: Without dead ends: 257 [2020-11-06 22:26:21,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:21,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-11-06 22:26:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2020-11-06 22:26:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-11-06 22:26:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 440 transitions. [2020-11-06 22:26:21,970 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 440 transitions. Word has length 24 [2020-11-06 22:26:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:21,970 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 440 transitions. [2020-11-06 22:26:21,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 440 transitions. [2020-11-06 22:26:21,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-06 22:26:21,972 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:21,973 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:21,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-06 22:26:21,973 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:21,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:21,974 INFO L82 PathProgramCache]: Analyzing trace with hash -681514726, now seen corresponding path program 1 times [2020-11-06 22:26:21,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:21,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698727071] [2020-11-06 22:26:21,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:22,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:22,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698727071] [2020-11-06 22:26:22,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:22,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:22,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640079712] [2020-11-06 22:26:22,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:22,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:22,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:22,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:22,043 INFO L87 Difference]: Start difference. First operand 256 states and 440 transitions. Second operand 4 states. [2020-11-06 22:26:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:22,187 INFO L93 Difference]: Finished difference Result 386 states and 663 transitions. [2020-11-06 22:26:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:22,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-11-06 22:26:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:22,190 INFO L225 Difference]: With dead ends: 386 [2020-11-06 22:26:22,190 INFO L226 Difference]: Without dead ends: 263 [2020-11-06 22:26:22,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-11-06 22:26:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2020-11-06 22:26:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-11-06 22:26:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 444 transitions. [2020-11-06 22:26:22,212 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 444 transitions. Word has length 25 [2020-11-06 22:26:22,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:22,213 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 444 transitions. [2020-11-06 22:26:22,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 444 transitions. [2020-11-06 22:26:22,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-06 22:26:22,214 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:22,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:22,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-06 22:26:22,215 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:22,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:22,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1961378404, now seen corresponding path program 1 times [2020-11-06 22:26:22,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:22,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847989468] [2020-11-06 22:26:22,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:22,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:22,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847989468] [2020-11-06 22:26:22,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:22,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:22,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155593244] [2020-11-06 22:26:22,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:22,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:22,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:22,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:22,279 INFO L87 Difference]: Start difference. First operand 262 states and 444 transitions. Second operand 4 states. [2020-11-06 22:26:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:22,419 INFO L93 Difference]: Finished difference Result 478 states and 823 transitions. [2020-11-06 22:26:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:22,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-11-06 22:26:22,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:22,423 INFO L225 Difference]: With dead ends: 478 [2020-11-06 22:26:22,423 INFO L226 Difference]: Without dead ends: 475 [2020-11-06 22:26:22,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2020-11-06 22:26:22,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 362. [2020-11-06 22:26:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-11-06 22:26:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 604 transitions. [2020-11-06 22:26:22,438 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 604 transitions. Word has length 25 [2020-11-06 22:26:22,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:22,439 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 604 transitions. [2020-11-06 22:26:22,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:22,439 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 604 transitions. [2020-11-06 22:26:22,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-06 22:26:22,440 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:22,440 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:22,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-06 22:26:22,441 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:22,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1322471642, now seen corresponding path program 1 times [2020-11-06 22:26:22,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:22,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665387940] [2020-11-06 22:26:22,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:22,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:22,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665387940] [2020-11-06 22:26:22,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:22,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:22,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212771726] [2020-11-06 22:26:22,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:22,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:22,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:22,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:22,504 INFO L87 Difference]: Start difference. First operand 362 states and 604 transitions. Second operand 4 states. [2020-11-06 22:26:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:22,679 INFO L93 Difference]: Finished difference Result 846 states and 1423 transitions. [2020-11-06 22:26:22,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:22,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-11-06 22:26:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:22,683 INFO L225 Difference]: With dead ends: 846 [2020-11-06 22:26:22,683 INFO L226 Difference]: Without dead ends: 499 [2020-11-06 22:26:22,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:22,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2020-11-06 22:26:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 498. [2020-11-06 22:26:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2020-11-06 22:26:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 824 transitions. [2020-11-06 22:26:22,705 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 824 transitions. Word has length 25 [2020-11-06 22:26:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:22,705 INFO L481 AbstractCegarLoop]: Abstraction has 498 states and 824 transitions. [2020-11-06 22:26:22,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 824 transitions. [2020-11-06 22:26:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-06 22:26:22,707 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:22,707 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:22,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:26:22,707 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:22,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:22,708 INFO L82 PathProgramCache]: Analyzing trace with hash -666548273, now seen corresponding path program 1 times [2020-11-06 22:26:22,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:22,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618916046] [2020-11-06 22:26:22,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:22,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:22,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618916046] [2020-11-06 22:26:22,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:22,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:22,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295282255] [2020-11-06 22:26:22,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:22,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:22,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:22,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:22,759 INFO L87 Difference]: Start difference. First operand 498 states and 824 transitions. Second operand 4 states. [2020-11-06 22:26:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:22,932 INFO L93 Difference]: Finished difference Result 746 states and 1231 transitions. [2020-11-06 22:26:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:22,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-11-06 22:26:22,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:22,935 INFO L225 Difference]: With dead ends: 746 [2020-11-06 22:26:22,936 INFO L226 Difference]: Without dead ends: 507 [2020-11-06 22:26:22,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:22,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2020-11-06 22:26:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 506. [2020-11-06 22:26:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-11-06 22:26:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 824 transitions. [2020-11-06 22:26:22,957 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 824 transitions. Word has length 26 [2020-11-06 22:26:22,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:22,958 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 824 transitions. [2020-11-06 22:26:22,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:22,958 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 824 transitions. [2020-11-06 22:26:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-06 22:26:22,959 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:22,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:22,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-06 22:26:22,960 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1946411951, now seen corresponding path program 1 times [2020-11-06 22:26:22,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:22,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087696349] [2020-11-06 22:26:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:22,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:23,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087696349] [2020-11-06 22:26:23,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:23,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:23,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980018949] [2020-11-06 22:26:23,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:23,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:23,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:23,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:23,007 INFO L87 Difference]: Start difference. First operand 506 states and 824 transitions. Second operand 4 states. [2020-11-06 22:26:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:23,162 INFO L93 Difference]: Finished difference Result 910 states and 1507 transitions. [2020-11-06 22:26:23,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:23,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-11-06 22:26:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:23,168 INFO L225 Difference]: With dead ends: 910 [2020-11-06 22:26:23,168 INFO L226 Difference]: Without dead ends: 907 [2020-11-06 22:26:23,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:23,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2020-11-06 22:26:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 714. [2020-11-06 22:26:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2020-11-06 22:26:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1136 transitions. [2020-11-06 22:26:23,196 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1136 transitions. Word has length 26 [2020-11-06 22:26:23,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:23,196 INFO L481 AbstractCegarLoop]: Abstraction has 714 states and 1136 transitions. [2020-11-06 22:26:23,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1136 transitions. [2020-11-06 22:26:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-06 22:26:23,198 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:23,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:23,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-06 22:26:23,199 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:23,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1337438095, now seen corresponding path program 1 times [2020-11-06 22:26:23,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:23,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926459706] [2020-11-06 22:26:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:23,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:23,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926459706] [2020-11-06 22:26:23,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:23,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:23,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079610964] [2020-11-06 22:26:23,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:23,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:23,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:23,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:23,262 INFO L87 Difference]: Start difference. First operand 714 states and 1136 transitions. Second operand 4 states. [2020-11-06 22:26:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:23,438 INFO L93 Difference]: Finished difference Result 1662 states and 2659 transitions. [2020-11-06 22:26:23,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:23,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-11-06 22:26:23,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:23,444 INFO L225 Difference]: With dead ends: 1662 [2020-11-06 22:26:23,444 INFO L226 Difference]: Without dead ends: 971 [2020-11-06 22:26:23,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2020-11-06 22:26:23,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 970. [2020-11-06 22:26:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2020-11-06 22:26:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1528 transitions. [2020-11-06 22:26:23,484 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1528 transitions. Word has length 26 [2020-11-06 22:26:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:23,485 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 1528 transitions. [2020-11-06 22:26:23,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1528 transitions. [2020-11-06 22:26:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:26:23,486 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:23,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:23,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-06 22:26:23,487 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:23,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:23,488 INFO L82 PathProgramCache]: Analyzing trace with hash -202577659, now seen corresponding path program 1 times [2020-11-06 22:26:23,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:23,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079757463] [2020-11-06 22:26:23,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:23,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:23,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079757463] [2020-11-06 22:26:23,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:23,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:23,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140899234] [2020-11-06 22:26:23,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:23,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:23,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:23,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:23,545 INFO L87 Difference]: Start difference. First operand 970 states and 1528 transitions. Second operand 4 states. [2020-11-06 22:26:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:23,704 INFO L93 Difference]: Finished difference Result 1454 states and 2283 transitions. [2020-11-06 22:26:23,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:23,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-11-06 22:26:23,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:23,710 INFO L225 Difference]: With dead ends: 1454 [2020-11-06 22:26:23,710 INFO L226 Difference]: Without dead ends: 987 [2020-11-06 22:26:23,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2020-11-06 22:26:23,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 986. [2020-11-06 22:26:23,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2020-11-06 22:26:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1528 transitions. [2020-11-06 22:26:23,749 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1528 transitions. Word has length 27 [2020-11-06 22:26:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:23,749 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 1528 transitions. [2020-11-06 22:26:23,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1528 transitions. [2020-11-06 22:26:23,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:26:23,751 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:23,751 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:23,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-06 22:26:23,752 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:23,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:23,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1482441337, now seen corresponding path program 1 times [2020-11-06 22:26:23,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:23,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908417629] [2020-11-06 22:26:23,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:23,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:23,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908417629] [2020-11-06 22:26:23,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:23,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:23,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231484681] [2020-11-06 22:26:23,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:23,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:23,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:23,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:23,823 INFO L87 Difference]: Start difference. First operand 986 states and 1528 transitions. Second operand 4 states. [2020-11-06 22:26:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:24,004 INFO L93 Difference]: Finished difference Result 1742 states and 2747 transitions. [2020-11-06 22:26:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:24,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-11-06 22:26:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:24,014 INFO L225 Difference]: With dead ends: 1742 [2020-11-06 22:26:24,014 INFO L226 Difference]: Without dead ends: 1739 [2020-11-06 22:26:24,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2020-11-06 22:26:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1418. [2020-11-06 22:26:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2020-11-06 22:26:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2136 transitions. [2020-11-06 22:26:24,068 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2136 transitions. Word has length 27 [2020-11-06 22:26:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:24,068 INFO L481 AbstractCegarLoop]: Abstraction has 1418 states and 2136 transitions. [2020-11-06 22:26:24,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2136 transitions. [2020-11-06 22:26:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:26:24,071 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:24,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:24,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-06 22:26:24,071 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:24,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:24,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1801408709, now seen corresponding path program 1 times [2020-11-06 22:26:24,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:24,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633412193] [2020-11-06 22:26:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:24,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:24,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633412193] [2020-11-06 22:26:24,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:24,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:24,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153223798] [2020-11-06 22:26:24,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:24,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:24,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:24,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:24,120 INFO L87 Difference]: Start difference. First operand 1418 states and 2136 transitions. Second operand 4 states. [2020-11-06 22:26:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:24,296 INFO L93 Difference]: Finished difference Result 3278 states and 4955 transitions. [2020-11-06 22:26:24,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:24,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-11-06 22:26:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:24,307 INFO L225 Difference]: With dead ends: 3278 [2020-11-06 22:26:24,307 INFO L226 Difference]: Without dead ends: 1899 [2020-11-06 22:26:24,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2020-11-06 22:26:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1898. [2020-11-06 22:26:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-11-06 22:26:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2824 transitions. [2020-11-06 22:26:24,387 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2824 transitions. Word has length 27 [2020-11-06 22:26:24,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:24,387 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 2824 transitions. [2020-11-06 22:26:24,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2824 transitions. [2020-11-06 22:26:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:26:24,390 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:24,391 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:24,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-06 22:26:24,391 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:24,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:24,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1295620058, now seen corresponding path program 1 times [2020-11-06 22:26:24,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:24,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513029821] [2020-11-06 22:26:24,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:24,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:24,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513029821] [2020-11-06 22:26:24,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:24,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:24,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371989934] [2020-11-06 22:26:24,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:24,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:24,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:24,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:24,519 INFO L87 Difference]: Start difference. First operand 1898 states and 2824 transitions. Second operand 4 states. [2020-11-06 22:26:24,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:24,692 INFO L93 Difference]: Finished difference Result 2846 states and 4219 transitions. [2020-11-06 22:26:24,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:24,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-11-06 22:26:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:24,704 INFO L225 Difference]: With dead ends: 2846 [2020-11-06 22:26:24,704 INFO L226 Difference]: Without dead ends: 1931 [2020-11-06 22:26:24,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:24,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2020-11-06 22:26:24,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1930. [2020-11-06 22:26:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states. [2020-11-06 22:26:24,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2824 transitions. [2020-11-06 22:26:24,795 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2824 transitions. Word has length 28 [2020-11-06 22:26:24,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:24,795 INFO L481 AbstractCegarLoop]: Abstraction has 1930 states and 2824 transitions. [2020-11-06 22:26:24,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2824 transitions. [2020-11-06 22:26:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:26:24,798 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:24,798 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:24,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-06 22:26:24,798 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:24,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash 15756380, now seen corresponding path program 1 times [2020-11-06 22:26:24,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:24,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589089905] [2020-11-06 22:26:24,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:24,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:24,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589089905] [2020-11-06 22:26:24,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:24,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:24,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173233660] [2020-11-06 22:26:24,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:24,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:24,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:24,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:24,885 INFO L87 Difference]: Start difference. First operand 1930 states and 2824 transitions. Second operand 4 states. [2020-11-06 22:26:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:25,077 INFO L93 Difference]: Finished difference Result 3342 states and 4971 transitions. [2020-11-06 22:26:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:25,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-11-06 22:26:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:25,094 INFO L225 Difference]: With dead ends: 3342 [2020-11-06 22:26:25,094 INFO L226 Difference]: Without dead ends: 3339 [2020-11-06 22:26:25,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:25,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2020-11-06 22:26:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2826. [2020-11-06 22:26:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2826 states. [2020-11-06 22:26:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 4008 transitions. [2020-11-06 22:26:25,222 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 4008 transitions. Word has length 28 [2020-11-06 22:26:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:25,222 INFO L481 AbstractCegarLoop]: Abstraction has 2826 states and 4008 transitions. [2020-11-06 22:26:25,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 4008 transitions. [2020-11-06 22:26:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:26:25,227 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:25,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:25,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-06 22:26:25,227 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:25,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:25,228 INFO L82 PathProgramCache]: Analyzing trace with hash -995360870, now seen corresponding path program 1 times [2020-11-06 22:26:25,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:25,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572305752] [2020-11-06 22:26:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:25,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:25,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572305752] [2020-11-06 22:26:25,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:25,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:25,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128322591] [2020-11-06 22:26:25,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:25,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:25,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:25,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:25,273 INFO L87 Difference]: Start difference. First operand 2826 states and 4008 transitions. Second operand 4 states. [2020-11-06 22:26:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:25,485 INFO L93 Difference]: Finished difference Result 6478 states and 9195 transitions. [2020-11-06 22:26:25,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:25,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-11-06 22:26:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:25,502 INFO L225 Difference]: With dead ends: 6478 [2020-11-06 22:26:25,503 INFO L226 Difference]: Without dead ends: 3723 [2020-11-06 22:26:25,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2020-11-06 22:26:25,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3722. [2020-11-06 22:26:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3722 states. [2020-11-06 22:26:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 5192 transitions. [2020-11-06 22:26:25,684 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 5192 transitions. Word has length 28 [2020-11-06 22:26:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:25,685 INFO L481 AbstractCegarLoop]: Abstraction has 3722 states and 5192 transitions. [2020-11-06 22:26:25,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5192 transitions. [2020-11-06 22:26:25,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:26:25,690 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:25,690 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:25,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-06 22:26:25,690 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:25,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:25,691 INFO L82 PathProgramCache]: Analyzing trace with hash 495119600, now seen corresponding path program 1 times [2020-11-06 22:26:25,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:25,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155263595] [2020-11-06 22:26:25,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:25,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:25,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155263595] [2020-11-06 22:26:25,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:25,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:25,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545639077] [2020-11-06 22:26:25,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:25,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:25,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:25,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:25,749 INFO L87 Difference]: Start difference. First operand 3722 states and 5192 transitions. Second operand 4 states. [2020-11-06 22:26:25,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:25,939 INFO L93 Difference]: Finished difference Result 5582 states and 7755 transitions. [2020-11-06 22:26:25,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:25,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-11-06 22:26:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:25,958 INFO L225 Difference]: With dead ends: 5582 [2020-11-06 22:26:25,958 INFO L226 Difference]: Without dead ends: 3787 [2020-11-06 22:26:25,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2020-11-06 22:26:26,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3786. [2020-11-06 22:26:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3786 states. [2020-11-06 22:26:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3786 states and 5192 transitions. [2020-11-06 22:26:26,142 INFO L78 Accepts]: Start accepts. Automaton has 3786 states and 5192 transitions. Word has length 29 [2020-11-06 22:26:26,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:26,143 INFO L481 AbstractCegarLoop]: Abstraction has 3786 states and 5192 transitions. [2020-11-06 22:26:26,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5192 transitions. [2020-11-06 22:26:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:26:26,151 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:26,151 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:26,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-06 22:26:26,152 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:26,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:26,152 INFO L82 PathProgramCache]: Analyzing trace with hash -784744078, now seen corresponding path program 1 times [2020-11-06 22:26:26,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:26,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658277641] [2020-11-06 22:26:26,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:26,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:26,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658277641] [2020-11-06 22:26:26,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:26,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:26,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115672864] [2020-11-06 22:26:26,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:26,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:26,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:26,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:26,207 INFO L87 Difference]: Start difference. First operand 3786 states and 5192 transitions. Second operand 4 states. [2020-11-06 22:26:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:26,465 INFO L93 Difference]: Finished difference Result 6414 states and 8907 transitions. [2020-11-06 22:26:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:26,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-11-06 22:26:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:26,495 INFO L225 Difference]: With dead ends: 6414 [2020-11-06 22:26:26,495 INFO L226 Difference]: Without dead ends: 6411 [2020-11-06 22:26:26,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2020-11-06 22:26:26,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5642. [2020-11-06 22:26:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2020-11-06 22:26:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 7496 transitions. [2020-11-06 22:26:26,661 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 7496 transitions. Word has length 29 [2020-11-06 22:26:26,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:26,661 INFO L481 AbstractCegarLoop]: Abstraction has 5642 states and 7496 transitions. [2020-11-06 22:26:26,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:26,661 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 7496 transitions. [2020-11-06 22:26:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:26:26,670 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:26,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:26,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-06 22:26:26,670 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:26,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:26,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1795861328, now seen corresponding path program 1 times [2020-11-06 22:26:26,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:26,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122135034] [2020-11-06 22:26:26,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:26,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:26,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122135034] [2020-11-06 22:26:26,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:26,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:26,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706238134] [2020-11-06 22:26:26,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:26,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:26,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:26,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:26,770 INFO L87 Difference]: Start difference. First operand 5642 states and 7496 transitions. Second operand 4 states. [2020-11-06 22:26:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:27,045 INFO L93 Difference]: Finished difference Result 12814 states and 16971 transitions. [2020-11-06 22:26:27,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:27,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-11-06 22:26:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:27,062 INFO L225 Difference]: With dead ends: 12814 [2020-11-06 22:26:27,062 INFO L226 Difference]: Without dead ends: 7307 [2020-11-06 22:26:27,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2020-11-06 22:26:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7306. [2020-11-06 22:26:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7306 states. [2020-11-06 22:26:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7306 states to 7306 states and 9480 transitions. [2020-11-06 22:26:27,374 INFO L78 Accepts]: Start accepts. Automaton has 7306 states and 9480 transitions. Word has length 29 [2020-11-06 22:26:27,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:27,374 INFO L481 AbstractCegarLoop]: Abstraction has 7306 states and 9480 transitions. [2020-11-06 22:26:27,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 7306 states and 9480 transitions. [2020-11-06 22:26:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-06 22:26:27,384 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:27,384 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:27,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-06 22:26:27,385 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:27,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:27,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1449419749, now seen corresponding path program 1 times [2020-11-06 22:26:27,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:27,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475714171] [2020-11-06 22:26:27,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:27,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:27,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475714171] [2020-11-06 22:26:27,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:27,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:27,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772615246] [2020-11-06 22:26:27,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:27,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:27,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:27,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:27,438 INFO L87 Difference]: Start difference. First operand 7306 states and 9480 transitions. Second operand 4 states. [2020-11-06 22:26:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:27,683 INFO L93 Difference]: Finished difference Result 10958 states and 14155 transitions. [2020-11-06 22:26:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:27,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-11-06 22:26:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:27,701 INFO L225 Difference]: With dead ends: 10958 [2020-11-06 22:26:27,701 INFO L226 Difference]: Without dead ends: 7435 [2020-11-06 22:26:27,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2020-11-06 22:26:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7434. [2020-11-06 22:26:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7434 states. [2020-11-06 22:26:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7434 states to 7434 states and 9480 transitions. [2020-11-06 22:26:27,953 INFO L78 Accepts]: Start accepts. Automaton has 7434 states and 9480 transitions. Word has length 30 [2020-11-06 22:26:27,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:27,953 INFO L481 AbstractCegarLoop]: Abstraction has 7434 states and 9480 transitions. [2020-11-06 22:26:27,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 7434 states and 9480 transitions. [2020-11-06 22:26:27,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-06 22:26:27,962 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:27,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:27,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-06 22:26:27,963 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:27,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:27,963 INFO L82 PathProgramCache]: Analyzing trace with hash 169556071, now seen corresponding path program 1 times [2020-11-06 22:26:27,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:27,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156880831] [2020-11-06 22:26:27,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:28,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:28,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156880831] [2020-11-06 22:26:28,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:28,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:28,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773123637] [2020-11-06 22:26:28,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:28,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:28,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:28,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:28,011 INFO L87 Difference]: Start difference. First operand 7434 states and 9480 transitions. Second operand 4 states. [2020-11-06 22:26:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:28,401 INFO L93 Difference]: Finished difference Result 12302 states and 15755 transitions. [2020-11-06 22:26:28,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:28,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-11-06 22:26:28,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:28,430 INFO L225 Difference]: With dead ends: 12302 [2020-11-06 22:26:28,430 INFO L226 Difference]: Without dead ends: 12299 [2020-11-06 22:26:28,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2020-11-06 22:26:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 11274. [2020-11-06 22:26:28,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11274 states. [2020-11-06 22:26:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11274 states to 11274 states and 13960 transitions. [2020-11-06 22:26:28,777 INFO L78 Accepts]: Start accepts. Automaton has 11274 states and 13960 transitions. Word has length 30 [2020-11-06 22:26:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:28,778 INFO L481 AbstractCegarLoop]: Abstraction has 11274 states and 13960 transitions. [2020-11-06 22:26:28,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 11274 states and 13960 transitions. [2020-11-06 22:26:28,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-06 22:26:28,796 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:28,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:28,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-06 22:26:28,797 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:28,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:28,798 INFO L82 PathProgramCache]: Analyzing trace with hash -841561179, now seen corresponding path program 1 times [2020-11-06 22:26:28,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:28,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549595215] [2020-11-06 22:26:28,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:28,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:28,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549595215] [2020-11-06 22:26:28,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:28,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:28,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118086908] [2020-11-06 22:26:28,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:28,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:28,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:28,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:28,845 INFO L87 Difference]: Start difference. First operand 11274 states and 13960 transitions. Second operand 4 states. [2020-11-06 22:26:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:29,232 INFO L93 Difference]: Finished difference Result 25358 states and 31115 transitions. [2020-11-06 22:26:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:29,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-11-06 22:26:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:29,261 INFO L225 Difference]: With dead ends: 25358 [2020-11-06 22:26:29,262 INFO L226 Difference]: Without dead ends: 14347 [2020-11-06 22:26:29,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2020-11-06 22:26:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 14346. [2020-11-06 22:26:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14346 states. [2020-11-06 22:26:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14346 states to 14346 states and 17160 transitions. [2020-11-06 22:26:29,783 INFO L78 Accepts]: Start accepts. Automaton has 14346 states and 17160 transitions. Word has length 30 [2020-11-06 22:26:29,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:29,784 INFO L481 AbstractCegarLoop]: Abstraction has 14346 states and 17160 transitions. [2020-11-06 22:26:29,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 14346 states and 17160 transitions. [2020-11-06 22:26:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-06 22:26:29,802 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:29,802 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:29,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-06 22:26:29,802 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:29,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:29,803 INFO L82 PathProgramCache]: Analyzing trace with hash 967963867, now seen corresponding path program 1 times [2020-11-06 22:26:29,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:29,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750280474] [2020-11-06 22:26:29,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:29,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:29,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750280474] [2020-11-06 22:26:29,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:29,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:29,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749382483] [2020-11-06 22:26:29,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:29,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:29,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:29,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:29,849 INFO L87 Difference]: Start difference. First operand 14346 states and 17160 transitions. Second operand 4 states. [2020-11-06 22:26:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:30,161 INFO L93 Difference]: Finished difference Result 21518 states and 25611 transitions. [2020-11-06 22:26:30,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:30,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-11-06 22:26:30,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:30,185 INFO L225 Difference]: With dead ends: 21518 [2020-11-06 22:26:30,186 INFO L226 Difference]: Without dead ends: 14603 [2020-11-06 22:26:30,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2020-11-06 22:26:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 14602. [2020-11-06 22:26:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14602 states. [2020-11-06 22:26:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14602 states to 14602 states and 17160 transitions. [2020-11-06 22:26:30,718 INFO L78 Accepts]: Start accepts. Automaton has 14602 states and 17160 transitions. Word has length 31 [2020-11-06 22:26:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:30,718 INFO L481 AbstractCegarLoop]: Abstraction has 14602 states and 17160 transitions. [2020-11-06 22:26:30,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 14602 states and 17160 transitions. [2020-11-06 22:26:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-06 22:26:30,745 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:30,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:30,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-06 22:26:30,746 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:30,749 INFO L82 PathProgramCache]: Analyzing trace with hash -311899811, now seen corresponding path program 1 times [2020-11-06 22:26:30,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:30,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780389964] [2020-11-06 22:26:30,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:30,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:30,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780389964] [2020-11-06 22:26:30,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:30,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:30,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894639156] [2020-11-06 22:26:30,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:30,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:30,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:30,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:30,798 INFO L87 Difference]: Start difference. First operand 14602 states and 17160 transitions. Second operand 4 states. [2020-11-06 22:26:31,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:31,430 INFO L93 Difference]: Finished difference Result 42253 states and 48394 transitions. [2020-11-06 22:26:31,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:31,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-11-06 22:26:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:31,457 INFO L225 Difference]: With dead ends: 42253 [2020-11-06 22:26:31,457 INFO L226 Difference]: Without dead ends: 14602 [2020-11-06 22:26:31,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2020-11-06 22:26:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14602. [2020-11-06 22:26:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14602 states. [2020-11-06 22:26:32,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14602 states to 14602 states and 16136 transitions. [2020-11-06 22:26:32,082 INFO L78 Accepts]: Start accepts. Automaton has 14602 states and 16136 transitions. Word has length 31 [2020-11-06 22:26:32,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:32,082 INFO L481 AbstractCegarLoop]: Abstraction has 14602 states and 16136 transitions. [2020-11-06 22:26:32,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 14602 states and 16136 transitions. [2020-11-06 22:26:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-06 22:26:32,100 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:32,100 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:26:32,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-06 22:26:32,100 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:32,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:32,101 INFO L82 PathProgramCache]: Analyzing trace with hash 699217439, now seen corresponding path program 1 times [2020-11-06 22:26:32,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:32,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833622336] [2020-11-06 22:26:32,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:32,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:32,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833622336] [2020-11-06 22:26:32,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:32,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:32,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088008157] [2020-11-06 22:26:32,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:32,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:32,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:32,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:32,151 INFO L87 Difference]: Start difference. First operand 14602 states and 16136 transitions. Second operand 4 states. [2020-11-06 22:26:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:32,526 INFO L93 Difference]: Finished difference Result 14602 states and 16136 transitions. [2020-11-06 22:26:32,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:32,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-11-06 22:26:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:32,527 INFO L225 Difference]: With dead ends: 14602 [2020-11-06 22:26:32,527 INFO L226 Difference]: Without dead ends: 0 [2020-11-06 22:26:32,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:32,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-06 22:26:32,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-06 22:26:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-06 22:26:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-06 22:26:32,542 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-11-06 22:26:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:32,542 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-06 22:26:32,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-06 22:26:32,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-06 22:26:32,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-06 22:26:32,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-06 22:26:51,731 WARN L194 SmtUtils]: Spent 19.14 s on a formula simplification. DAG size of input: 2637 DAG size of output: 32 [2020-11-06 22:26:51,783 INFO L266 CegarLoopResult]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2020-11-06 22:26:51,783 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-06 22:26:51,783 INFO L266 CegarLoopResult]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2020-11-06 22:26:51,784 INFO L266 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-06 22:26:51,784 INFO L266 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:26:51,784 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-06 22:26:51,784 INFO L266 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:26:51,784 INFO L266 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:26:51,784 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-06 22:26:51,784 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-06 22:26:51,784 INFO L266 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:26:51,785 INFO L266 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2020-11-06 22:26:51,785 INFO L266 CegarLoopResult]: For program point mainEXIT(lines 6 165) no Hoare annotation was computed. [2020-11-06 22:26:51,785 INFO L266 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2020-11-06 22:26:51,785 INFO L266 CegarLoopResult]: For program point L110-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,785 INFO L266 CegarLoopResult]: For program point L135-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,785 INFO L266 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2020-11-06 22:26:51,785 INFO L266 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2020-11-06 22:26:51,785 INFO L269 CegarLoopResult]: At program point L161(lines 7 165) the Hoare annotation is: true [2020-11-06 22:26:51,786 INFO L266 CegarLoopResult]: For program point L120-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,786 INFO L266 CegarLoopResult]: For program point L145-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,786 INFO L266 CegarLoopResult]: For program point mainFINAL(lines 6 165) no Hoare annotation was computed. [2020-11-06 22:26:51,786 INFO L266 CegarLoopResult]: For program point L104-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,786 INFO L266 CegarLoopResult]: For program point L96-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,786 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 6 165) the Hoare annotation is: true [2020-11-06 22:26:51,786 INFO L266 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2020-11-06 22:26:51,786 INFO L266 CegarLoopResult]: For program point L88-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,786 INFO L266 CegarLoopResult]: For program point L146(line 146) no Hoare annotation was computed. [2020-11-06 22:26:51,786 INFO L266 CegarLoopResult]: For program point L80-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,787 INFO L266 CegarLoopResult]: For program point L72-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,787 INFO L266 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2020-11-06 22:26:51,787 INFO L266 CegarLoopResult]: For program point L130-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,787 INFO L269 CegarLoopResult]: At program point L155-1(lines 41 160) the Hoare annotation is: true [2020-11-06 22:26:51,787 INFO L266 CegarLoopResult]: For program point L131(line 131) no Hoare annotation was computed. [2020-11-06 22:26:51,787 INFO L266 CegarLoopResult]: For program point L156(line 156) no Hoare annotation was computed. [2020-11-06 22:26:51,787 INFO L262 CegarLoopResult]: At program point L156-1(lines 7 165) the Hoare annotation is: false [2020-11-06 22:26:51,787 INFO L266 CegarLoopResult]: For program point L115-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,787 INFO L266 CegarLoopResult]: For program point L140-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,787 INFO L266 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-11-06 22:26:51,788 INFO L266 CegarLoopResult]: For program point L141(line 141) no Hoare annotation was computed. [2020-11-06 22:26:51,788 INFO L266 CegarLoopResult]: For program point L100-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,788 INFO L266 CegarLoopResult]: For program point L125-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,788 INFO L266 CegarLoopResult]: For program point L92-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,788 INFO L266 CegarLoopResult]: For program point L150-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,788 INFO L266 CegarLoopResult]: For program point L84-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,788 INFO L266 CegarLoopResult]: For program point L43(lines 43 45) no Hoare annotation was computed. [2020-11-06 22:26:51,788 INFO L266 CegarLoopResult]: For program point L76-1(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,788 INFO L266 CegarLoopResult]: For program point L68(lines 68 70) no Hoare annotation was computed. [2020-11-06 22:26:51,788 INFO L266 CegarLoopResult]: For program point L68-2(lines 41 160) no Hoare annotation was computed. [2020-11-06 22:26:51,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:26:51 BoogieIcfgContainer [2020-11-06 22:26:51,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:26:51,801 INFO L168 Benchmark]: Toolchain (without parser) took 33451.90 ms. Allocated memory was 153.1 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 128.9 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 8.0 GB. [2020-11-06 22:26:51,802 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 153.1 MB. Free memory is still 126.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:26:51,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.87 ms. Allocated memory is still 153.1 MB. Free memory was 128.2 MB in the beginning and 118.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-06 22:26:51,803 INFO L168 Benchmark]: Boogie Preprocessor took 43.81 ms. Allocated memory is still 153.1 MB. Free memory was 118.1 MB in the beginning and 116.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:26:51,803 INFO L168 Benchmark]: RCFGBuilder took 520.77 ms. Allocated memory is still 153.1 MB. Free memory was 116.2 MB in the beginning and 129.3 MB in the end (delta: -13.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:26:51,804 INFO L168 Benchmark]: TraceAbstraction took 32585.59 ms. Allocated memory was 153.1 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 128.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 8.0 GB. [2020-11-06 22:26:51,806 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 153.1 MB. Free memory is still 126.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 289.87 ms. Allocated memory is still 153.1 MB. Free memory was 128.2 MB in the beginning and 118.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.81 ms. Allocated memory is still 153.1 MB. Free memory was 118.1 MB in the beginning and 116.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 520.77 ms. Allocated memory is still 153.1 MB. Free memory was 116.2 MB in the beginning and 129.3 MB in the end (delta: -13.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 32585.59 ms. Allocated memory was 153.1 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 128.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.2s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2385 SDtfs, 3517 SDslu, 217 SDs, 0 SdLazy, 1707 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14602occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 3074 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 35 PreInvPairs, 1062 NumberOfFragments, 38 HoareAnnotationTreeSize, 35 FomulaSimplifications, 27454566 FormulaSimplificationTreeSizeReduction, 19.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 90 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 721 ConstructedInterpolants, 0 QuantifiedInterpolants, 57455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...