/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:20:01,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:20:01,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:20:01,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:20:01,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:20:01,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:20:01,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:20:01,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:20:01,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:20:01,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:20:01,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:20:01,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:20:01,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:20:01,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:20:01,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:20:01,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:20:01,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:20:01,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:20:01,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:20:01,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:20:01,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:20:01,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:20:01,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:20:01,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:20:01,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:20:01,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:20:01,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:20:01,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:20:01,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:20:01,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:20:01,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:20:01,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:20:01,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:20:01,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:20:01,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:20:01,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:20:01,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:20:01,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:20:01,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:20:01,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:20:01,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:20:01,599 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 [2019-11-06 21:20:01,618 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:20:01,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:20:01,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:20:01,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:20:01,621 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:20:01,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:20:01,621 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:20:01,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:20:01,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:20:01,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:20:01,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:20:01,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:20:01,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:20:01,624 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:20:01,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:20:01,624 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:20:01,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:20:01,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:20:01,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:20:01,626 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:20:01,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:20:01,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:20:01,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:20:01,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:20:01,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:20:01,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:20:01,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:20:01,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:20:01,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:20:01,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:20:01,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:20:01,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:20:01,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:20:01,919 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:20:01,920 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2019-11-06 21:20:01,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90e3ef617/86507c72e5944073bb344b306263d599/FLAG330e597cf [2019-11-06 21:20:02,414 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:20:02,414 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2019-11-06 21:20:02,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90e3ef617/86507c72e5944073bb344b306263d599/FLAG330e597cf [2019-11-06 21:20:02,849 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90e3ef617/86507c72e5944073bb344b306263d599 [2019-11-06 21:20:02,860 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:20:02,862 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:20:02,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:20:02,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:20:02,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:20:02,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:20:02" (1/1) ... [2019-11-06 21:20:02,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d184af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:02, skipping insertion in model container [2019-11-06 21:20:02,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:20:02" (1/1) ... [2019-11-06 21:20:02,880 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:20:02,908 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:20:03,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:20:03,117 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:20:03,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:20:03,156 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:20:03,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:03 WrapperNode [2019-11-06 21:20:03,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:20:03,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:20:03,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:20:03,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:20:03,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:03" (1/1) ... [2019-11-06 21:20:03,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:03" (1/1) ... [2019-11-06 21:20:03,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:03" (1/1) ... [2019-11-06 21:20:03,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:03" (1/1) ... [2019-11-06 21:20:03,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:03" (1/1) ... [2019-11-06 21:20:03,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:03" (1/1) ... [2019-11-06 21:20:03,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:03" (1/1) ... [2019-11-06 21:20:03,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:20:03,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:20:03,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:20:03,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:20:03,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:03" (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 [2019-11-06 21:20:03,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:20:03,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:20:03,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:20:03,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:20:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:20:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:20:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:20:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:20:03,672 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:20:03,673 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 21:20:03,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:20:03 BoogieIcfgContainer [2019-11-06 21:20:03,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:20:03,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:20:03,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:20:03,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:20:03,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:20:02" (1/3) ... [2019-11-06 21:20:03,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a15316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:20:03, skipping insertion in model container [2019-11-06 21:20:03,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:03" (2/3) ... [2019-11-06 21:20:03,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a15316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:20:03, skipping insertion in model container [2019-11-06 21:20:03,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:20:03" (3/3) ... [2019-11-06 21:20:03,681 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-11-06 21:20:03,691 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:20:03,699 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:20:03,710 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:20:03,737 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:20:03,737 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:20:03,737 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:20:03,737 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:20:03,738 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:20:03,738 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:20:03,739 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:20:03,739 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:20:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-11-06 21:20:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:20:03,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:03,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:03,769 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:03,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:03,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2019-11-06 21:20:03,785 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:03,785 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012972517] [2019-11-06 21:20:03,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:03,951 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012972517] [2019-11-06 21:20:03,951 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:03,952 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:03,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853422250] [2019-11-06 21:20:03,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:03,959 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:03,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:03,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:03,980 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-11-06 21:20:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:04,049 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2019-11-06 21:20:04,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:04,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-06 21:20:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:04,063 INFO L225 Difference]: With dead ends: 69 [2019-11-06 21:20:04,063 INFO L226 Difference]: Without dead ends: 54 [2019-11-06 21:20:04,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-06 21:20:04,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-11-06 21:20:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-06 21:20:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2019-11-06 21:20:04,111 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2019-11-06 21:20:04,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:04,111 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2019-11-06 21:20:04,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2019-11-06 21:20:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:20:04,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:04,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:04,114 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2019-11-06 21:20:04,115 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:04,115 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955719805] [2019-11-06 21:20:04,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:04,183 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955719805] [2019-11-06 21:20:04,184 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:04,184 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:04,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724459142] [2019-11-06 21:20:04,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:04,186 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:04,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:04,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,187 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2019-11-06 21:20:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:04,235 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2019-11-06 21:20:04,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:04,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-06 21:20:04,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:04,238 INFO L225 Difference]: With dead ends: 87 [2019-11-06 21:20:04,238 INFO L226 Difference]: Without dead ends: 54 [2019-11-06 21:20:04,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-06 21:20:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-11-06 21:20:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-06 21:20:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2019-11-06 21:20:04,249 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2019-11-06 21:20:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:04,250 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2019-11-06 21:20:04,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2019-11-06 21:20:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:20:04,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:04,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:04,252 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:04,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:04,252 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2019-11-06 21:20:04,252 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:04,253 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206138717] [2019-11-06 21:20:04,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:04,297 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206138717] [2019-11-06 21:20:04,298 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:04,298 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:04,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651753388] [2019-11-06 21:20:04,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:04,299 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:04,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:04,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,300 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2019-11-06 21:20:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:04,325 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2019-11-06 21:20:04,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:04,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-06 21:20:04,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:04,327 INFO L225 Difference]: With dead ends: 81 [2019-11-06 21:20:04,327 INFO L226 Difference]: Without dead ends: 57 [2019-11-06 21:20:04,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-06 21:20:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-11-06 21:20:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-06 21:20:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2019-11-06 21:20:04,336 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2019-11-06 21:20:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:04,337 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2019-11-06 21:20:04,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2019-11-06 21:20:04,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:20:04,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:04,338 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:04,339 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:04,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:04,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2019-11-06 21:20:04,339 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:04,340 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356225914] [2019-11-06 21:20:04,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:04,395 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356225914] [2019-11-06 21:20:04,396 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:04,396 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:04,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741436842] [2019-11-06 21:20:04,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:04,397 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:04,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:04,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,397 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2019-11-06 21:20:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:04,432 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2019-11-06 21:20:04,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:04,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-06 21:20:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:04,435 INFO L225 Difference]: With dead ends: 100 [2019-11-06 21:20:04,435 INFO L226 Difference]: Without dead ends: 98 [2019-11-06 21:20:04,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-06 21:20:04,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2019-11-06 21:20:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-06 21:20:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2019-11-06 21:20:04,446 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2019-11-06 21:20:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:04,446 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2019-11-06 21:20:04,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2019-11-06 21:20:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:20:04,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:04,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:04,448 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:04,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:04,449 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2019-11-06 21:20:04,449 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:04,449 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436730339] [2019-11-06 21:20:04,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:04,498 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436730339] [2019-11-06 21:20:04,498 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:04,498 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:04,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730327073] [2019-11-06 21:20:04,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:04,505 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:04,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:04,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,506 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2019-11-06 21:20:04,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:04,531 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2019-11-06 21:20:04,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:04,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-06 21:20:04,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:04,533 INFO L225 Difference]: With dead ends: 164 [2019-11-06 21:20:04,533 INFO L226 Difference]: Without dead ends: 100 [2019-11-06 21:20:04,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-06 21:20:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-11-06 21:20:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-06 21:20:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2019-11-06 21:20:04,544 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2019-11-06 21:20:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:04,544 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2019-11-06 21:20:04,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2019-11-06 21:20:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:20:04,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:04,545 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:04,546 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:04,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:04,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2019-11-06 21:20:04,546 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:04,547 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399305873] [2019-11-06 21:20:04,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:04,582 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399305873] [2019-11-06 21:20:04,582 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:04,582 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:04,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242069821] [2019-11-06 21:20:04,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:04,583 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:04,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:04,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,583 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2019-11-06 21:20:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:04,607 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2019-11-06 21:20:04,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:04,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-06 21:20:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:04,609 INFO L225 Difference]: With dead ends: 147 [2019-11-06 21:20:04,609 INFO L226 Difference]: Without dead ends: 102 [2019-11-06 21:20:04,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-06 21:20:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-11-06 21:20:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-06 21:20:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2019-11-06 21:20:04,626 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2019-11-06 21:20:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:04,627 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2019-11-06 21:20:04,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:04,627 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2019-11-06 21:20:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:20:04,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:04,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:04,632 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:04,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:04,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2019-11-06 21:20:04,633 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:04,633 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692916002] [2019-11-06 21:20:04,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:04,679 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692916002] [2019-11-06 21:20:04,682 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:04,682 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:04,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739627530] [2019-11-06 21:20:04,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:04,684 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:04,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:04,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,685 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2019-11-06 21:20:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:04,711 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2019-11-06 21:20:04,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:04,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-06 21:20:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:04,714 INFO L225 Difference]: With dead ends: 180 [2019-11-06 21:20:04,715 INFO L226 Difference]: Without dead ends: 178 [2019-11-06 21:20:04,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-06 21:20:04,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2019-11-06 21:20:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-06 21:20:04,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2019-11-06 21:20:04,729 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2019-11-06 21:20:04,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:04,730 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2019-11-06 21:20:04,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:04,730 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2019-11-06 21:20:04,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:20:04,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:04,732 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:04,732 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:04,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:04,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2019-11-06 21:20:04,733 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:04,733 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658833529] [2019-11-06 21:20:04,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:04,789 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658833529] [2019-11-06 21:20:04,789 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:04,789 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:04,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81006976] [2019-11-06 21:20:04,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:04,791 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:04,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:04,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,792 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2019-11-06 21:20:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:04,851 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2019-11-06 21:20:04,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:04,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-06 21:20:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:04,855 INFO L225 Difference]: With dead ends: 312 [2019-11-06 21:20:04,856 INFO L226 Difference]: Without dead ends: 186 [2019-11-06 21:20:04,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-06 21:20:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-11-06 21:20:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-06 21:20:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2019-11-06 21:20:04,883 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2019-11-06 21:20:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:04,884 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2019-11-06 21:20:04,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2019-11-06 21:20:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:20:04,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:04,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:04,889 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:04,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:04,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2019-11-06 21:20:04,893 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:04,893 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320592325] [2019-11-06 21:20:04,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:04,924 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320592325] [2019-11-06 21:20:04,924 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:04,925 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:04,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313446299] [2019-11-06 21:20:04,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:04,926 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:04,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:04,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,926 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2019-11-06 21:20:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:04,948 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2019-11-06 21:20:04,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:04,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-06 21:20:04,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:04,950 INFO L225 Difference]: With dead ends: 276 [2019-11-06 21:20:04,950 INFO L226 Difference]: Without dead ends: 190 [2019-11-06 21:20:04,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:04,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-06 21:20:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2019-11-06 21:20:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-06 21:20:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2019-11-06 21:20:04,976 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2019-11-06 21:20:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:04,976 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2019-11-06 21:20:04,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2019-11-06 21:20:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:20:04,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:04,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:04,981 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:04,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:04,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2019-11-06 21:20:04,981 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:04,982 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223741256] [2019-11-06 21:20:04,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,025 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223741256] [2019-11-06 21:20:05,025 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,025 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983842312] [2019-11-06 21:20:05,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,027 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,029 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2019-11-06 21:20:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,057 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2019-11-06 21:20:05,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-06 21:20:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,060 INFO L225 Difference]: With dead ends: 332 [2019-11-06 21:20:05,060 INFO L226 Difference]: Without dead ends: 330 [2019-11-06 21:20:05,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-06 21:20:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2019-11-06 21:20:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-06 21:20:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2019-11-06 21:20:05,072 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2019-11-06 21:20:05,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,072 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2019-11-06 21:20:05,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2019-11-06 21:20:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:20:05,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,074 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:05,075 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2019-11-06 21:20:05,075 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,076 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912831926] [2019-11-06 21:20:05,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,111 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912831926] [2019-11-06 21:20:05,111 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,111 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488659253] [2019-11-06 21:20:05,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,112 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,113 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2019-11-06 21:20:05,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,136 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2019-11-06 21:20:05,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-06 21:20:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,139 INFO L225 Difference]: With dead ends: 604 [2019-11-06 21:20:05,139 INFO L226 Difference]: Without dead ends: 354 [2019-11-06 21:20:05,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-06 21:20:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-11-06 21:20:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-11-06 21:20:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2019-11-06 21:20:05,154 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2019-11-06 21:20:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,154 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2019-11-06 21:20:05,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2019-11-06 21:20:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:20:05,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,156 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:05,156 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2019-11-06 21:20:05,156 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,157 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080671761] [2019-11-06 21:20:05,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,177 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080671761] [2019-11-06 21:20:05,177 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,177 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350322496] [2019-11-06 21:20:05,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,178 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,178 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2019-11-06 21:20:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,199 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2019-11-06 21:20:05,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-06 21:20:05,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,201 INFO L225 Difference]: With dead ends: 528 [2019-11-06 21:20:05,201 INFO L226 Difference]: Without dead ends: 362 [2019-11-06 21:20:05,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-06 21:20:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-11-06 21:20:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-06 21:20:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2019-11-06 21:20:05,214 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2019-11-06 21:20:05,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,215 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2019-11-06 21:20:05,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2019-11-06 21:20:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:20:05,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,216 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:05,216 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2019-11-06 21:20:05,217 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,217 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293752261] [2019-11-06 21:20:05,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,243 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293752261] [2019-11-06 21:20:05,243 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,243 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714669085] [2019-11-06 21:20:05,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,244 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,245 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2019-11-06 21:20:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,275 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2019-11-06 21:20:05,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-06 21:20:05,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,280 INFO L225 Difference]: With dead ends: 620 [2019-11-06 21:20:05,280 INFO L226 Difference]: Without dead ends: 618 [2019-11-06 21:20:05,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-06 21:20:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2019-11-06 21:20:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-11-06 21:20:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2019-11-06 21:20:05,301 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2019-11-06 21:20:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,303 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2019-11-06 21:20:05,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2019-11-06 21:20:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:20:05,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,307 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:05,307 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2019-11-06 21:20:05,308 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,308 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147380313] [2019-11-06 21:20:05,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,337 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147380313] [2019-11-06 21:20:05,338 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,338 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205767803] [2019-11-06 21:20:05,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,339 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,341 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2019-11-06 21:20:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,369 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2019-11-06 21:20:05,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-06 21:20:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,373 INFO L225 Difference]: With dead ends: 1180 [2019-11-06 21:20:05,373 INFO L226 Difference]: Without dead ends: 682 [2019-11-06 21:20:05,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-11-06 21:20:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-11-06 21:20:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-11-06 21:20:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2019-11-06 21:20:05,396 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2019-11-06 21:20:05,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,396 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2019-11-06 21:20:05,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2019-11-06 21:20:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:20:05,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,399 INFO L410 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] [2019-11-06 21:20:05,399 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,399 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2019-11-06 21:20:05,399 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,400 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181254947] [2019-11-06 21:20:05,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,424 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181254947] [2019-11-06 21:20:05,424 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,424 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13017475] [2019-11-06 21:20:05,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,425 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,426 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2019-11-06 21:20:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,451 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2019-11-06 21:20:05,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-06 21:20:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,456 INFO L225 Difference]: With dead ends: 1020 [2019-11-06 21:20:05,456 INFO L226 Difference]: Without dead ends: 698 [2019-11-06 21:20:05,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-11-06 21:20:05,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-11-06 21:20:05,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-11-06 21:20:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2019-11-06 21:20:05,482 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2019-11-06 21:20:05,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,482 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2019-11-06 21:20:05,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,483 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2019-11-06 21:20:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:20:05,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,484 INFO L410 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] [2019-11-06 21:20:05,485 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,485 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2019-11-06 21:20:05,485 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,485 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906659657] [2019-11-06 21:20:05,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,512 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906659657] [2019-11-06 21:20:05,512 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,512 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265029350] [2019-11-06 21:20:05,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,513 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,513 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2019-11-06 21:20:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,547 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2019-11-06 21:20:05,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-06 21:20:05,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,553 INFO L225 Difference]: With dead ends: 1164 [2019-11-06 21:20:05,554 INFO L226 Difference]: Without dead ends: 1162 [2019-11-06 21:20:05,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-11-06 21:20:05,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2019-11-06 21:20:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-11-06 21:20:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2019-11-06 21:20:05,591 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2019-11-06 21:20:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,591 INFO L462 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2019-11-06 21:20:05,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2019-11-06 21:20:05,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:20:05,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,594 INFO L410 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] [2019-11-06 21:20:05,595 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,595 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2019-11-06 21:20:05,595 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,596 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608957401] [2019-11-06 21:20:05,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,616 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608957401] [2019-11-06 21:20:05,616 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,616 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143452446] [2019-11-06 21:20:05,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,636 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,636 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2019-11-06 21:20:05,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,674 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2019-11-06 21:20:05,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-06 21:20:05,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,681 INFO L225 Difference]: With dead ends: 2316 [2019-11-06 21:20:05,681 INFO L226 Difference]: Without dead ends: 1322 [2019-11-06 21:20:05,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-11-06 21:20:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2019-11-06 21:20:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-11-06 21:20:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2019-11-06 21:20:05,727 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2019-11-06 21:20:05,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,727 INFO L462 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2019-11-06 21:20:05,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2019-11-06 21:20:05,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:20:05,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,730 INFO L410 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] [2019-11-06 21:20:05,731 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,731 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2019-11-06 21:20:05,731 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,731 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670868241] [2019-11-06 21:20:05,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,750 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670868241] [2019-11-06 21:20:05,750 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,750 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856475735] [2019-11-06 21:20:05,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,751 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,751 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2019-11-06 21:20:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,791 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2019-11-06 21:20:05,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-06 21:20:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,797 INFO L225 Difference]: With dead ends: 1980 [2019-11-06 21:20:05,797 INFO L226 Difference]: Without dead ends: 1354 [2019-11-06 21:20:05,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-11-06 21:20:05,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-11-06 21:20:05,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-11-06 21:20:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2019-11-06 21:20:05,842 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2019-11-06 21:20:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,842 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2019-11-06 21:20:05,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2019-11-06 21:20:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:20:05,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,845 INFO L410 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] [2019-11-06 21:20:05,845 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2019-11-06 21:20:05,846 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,846 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050398621] [2019-11-06 21:20:05,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,864 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050398621] [2019-11-06 21:20:05,864 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,864 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173431932] [2019-11-06 21:20:05,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,865 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,866 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2019-11-06 21:20:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,919 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2019-11-06 21:20:05,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-06 21:20:05,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,929 INFO L225 Difference]: With dead ends: 2186 [2019-11-06 21:20:05,929 INFO L226 Difference]: Without dead ends: 2184 [2019-11-06 21:20:05,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-11-06 21:20:05,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2019-11-06 21:20:05,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-11-06 21:20:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2019-11-06 21:20:06,002 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2019-11-06 21:20:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:06,002 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2019-11-06 21:20:06,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2019-11-06 21:20:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:20:06,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:06,009 INFO L410 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] [2019-11-06 21:20:06,009 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:06,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:06,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2019-11-06 21:20:06,010 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:06,010 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012637057] [2019-11-06 21:20:06,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:06,027 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012637057] [2019-11-06 21:20:06,027 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:06,027 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:06,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616851747] [2019-11-06 21:20:06,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:06,028 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:06,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:06,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,029 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2019-11-06 21:20:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:06,119 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2019-11-06 21:20:06,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:06,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-06 21:20:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:06,121 INFO L225 Difference]: With dead ends: 4552 [2019-11-06 21:20:06,121 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:20:06,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:20:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:20:06,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:20:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:20:06,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-06 21:20:06,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:06,130 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:20:06,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:20:06,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:20:06,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:20:06,156 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-06 21:20:06,157 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:20:06,157 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:20:06,157 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 21:20:06,157 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:20:06,157 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:20:06,158 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2019-11-06 21:20:06,158 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-06 21:20:06,158 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-11-06 21:20:06,158 INFO L446 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-11-06 21:20:06,158 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-06 21:20:06,159 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-06 21:20:06,159 INFO L439 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-11-06 21:20:06,159 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2019-11-06 21:20:06,159 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2019-11-06 21:20:06,159 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-11-06 21:20:06,160 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2019-11-06 21:20:06,160 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2019-11-06 21:20:06,160 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2019-11-06 21:20:06,160 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-06 21:20:06,160 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-11-06 21:20:06,161 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-11-06 21:20:06,161 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-11-06 21:20:06,161 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-11-06 21:20:06,161 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-06 21:20:06,162 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-06 21:20:06,162 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-11-06 21:20:06,162 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-11-06 21:20:06,162 INFO L443 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2019-11-06 21:20:06,162 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-06 21:20:06,162 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2019-11-06 21:20:06,190 INFO L446 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-11-06 21:20:06,190 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-11-06 21:20:06,191 INFO L443 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2019-11-06 21:20:06,191 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-11-06 21:20:06,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:20:06 BoogieIcfgContainer [2019-11-06 21:20:06,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:20:06,205 INFO L168 Benchmark]: Toolchain (without parser) took 3342.11 ms. Allocated memory was 140.0 MB in the beginning and 243.8 MB in the end (delta: 103.8 MB). Free memory was 105.0 MB in the beginning and 214.6 MB in the end (delta: -109.6 MB). Peak memory consumption was 111.8 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:06,206 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 21:20:06,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.09 ms. Allocated memory is still 140.0 MB. Free memory was 104.8 MB in the beginning and 94.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:06,209 INFO L168 Benchmark]: Boogie Preprocessor took 133.67 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 94.1 MB in the beginning and 181.7 MB in the end (delta: -87.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:06,213 INFO L168 Benchmark]: RCFGBuilder took 383.02 ms. Allocated memory is still 203.4 MB. Free memory was 181.7 MB in the beginning and 165.0 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:06,214 INFO L168 Benchmark]: TraceAbstraction took 2526.76 ms. Allocated memory was 203.4 MB in the beginning and 243.8 MB in the end (delta: 40.4 MB). Free memory was 165.0 MB in the beginning and 214.6 MB in the end (delta: -49.6 MB). Peak memory consumption was 108.4 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:06,217 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 294.09 ms. Allocated memory is still 140.0 MB. Free memory was 104.8 MB in the beginning and 94.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.67 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 94.1 MB in the beginning and 181.7 MB in the end (delta: -87.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 383.02 ms. Allocated memory is still 203.4 MB. Free memory was 181.7 MB in the beginning and 165.0 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2526.76 ms. Allocated memory was 203.4 MB in the beginning and 243.8 MB in the end (delta: 40.4 MB). Free memory was 165.0 MB in the beginning and 214.6 MB in the end (delta: -49.6 MB). Peak memory consumption was 108.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 1 error locations. Result: SAFE, OverallTime: 2.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...