/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_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:19:31,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:19:31,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:19:31,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:19:31,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:19:31,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:19:31,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:19:31,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:19:31,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:19:31,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:19:31,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:19:31,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:19:31,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:19:31,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:19:31,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:19:31,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:19:31,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:19:31,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:19:31,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:19:31,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:19:31,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:19:31,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:19:31,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:19:31,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:19:31,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:19:31,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:19:31,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:19:31,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:19:31,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:19:31,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:19:31,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:19:31,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:19:31,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:19:31,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:19:31,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:19:31,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:19:31,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:19:31,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:19:31,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:19:31,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:19:31,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:19:31,911 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:19:31,930 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:19:31,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:19:31,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:19:31,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:19:31,935 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:19:31,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:19:31,936 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:19:31,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:19:31,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:19:31,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:19:31,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:19:31,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:19:31,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:19:31,939 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:19:31,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:19:31,940 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:19:31,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:19:31,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:19:31,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:19:31,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:19:31,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:19:31,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:19:31,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:19:31,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:19:31,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:19:31,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:19:31,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:19:31,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:19:31,944 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:19:32,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:19:32,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:19:32,244 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:19:32,245 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:19:32,246 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:19:32,247 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2019-11-06 21:19:32,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92a7d2a3/1da025b55684413bb79227fc89b9ba9c/FLAGd7d2a6498 [2019-11-06 21:19:32,805 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:19:32,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2019-11-06 21:19:32,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92a7d2a3/1da025b55684413bb79227fc89b9ba9c/FLAGd7d2a6498 [2019-11-06 21:19:33,165 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92a7d2a3/1da025b55684413bb79227fc89b9ba9c [2019-11-06 21:19:33,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:19:33,178 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:19:33,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:19:33,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:19:33,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:19:33,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:19:33" (1/1) ... [2019-11-06 21:19:33,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c4359a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:33, skipping insertion in model container [2019-11-06 21:19:33,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:19:33" (1/1) ... [2019-11-06 21:19:33,199 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:19:33,230 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:19:33,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:19:33,491 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:19:33,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:19:33,673 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:19:33,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:33 WrapperNode [2019-11-06 21:19:33,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:19:33,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:19:33,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:19:33,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:19:33,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:33" (1/1) ... [2019-11-06 21:19:33,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:33" (1/1) ... [2019-11-06 21:19:33,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:33" (1/1) ... [2019-11-06 21:19:33,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:33" (1/1) ... [2019-11-06 21:19:33,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:33" (1/1) ... [2019-11-06 21:19:33,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:33" (1/1) ... [2019-11-06 21:19:33,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:33" (1/1) ... [2019-11-06 21:19:33,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:19:33,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:19:33,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:19:33,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:19:33,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:33" (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:19:33,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:19:33,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:19:33,796 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:19:33,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:19:33,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:19:33,796 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:19:33,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:19:33,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:19:34,139 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:19:34,139 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 21:19:34,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:19:34 BoogieIcfgContainer [2019-11-06 21:19:34,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:19:34,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:19:34,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:19:34,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:19:34,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:19:33" (1/3) ... [2019-11-06 21:19:34,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82da804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:19:34, skipping insertion in model container [2019-11-06 21:19:34,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:33" (2/3) ... [2019-11-06 21:19:34,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82da804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:19:34, skipping insertion in model container [2019-11-06 21:19:34,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:19:34" (3/3) ... [2019-11-06 21:19:34,164 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-11-06 21:19:34,179 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:19:34,185 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:19:34,194 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:19:34,220 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:19:34,221 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:19:34,221 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:19:34,221 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:19:34,221 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:19:34,222 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:19:34,222 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:19:34,222 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:19:34,245 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-06 21:19:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:19:34,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:34,254 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:19:34,256 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:34,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:34,262 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2019-11-06 21:19:34,272 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:34,272 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108763526] [2019-11-06 21:19:34,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:34,453 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:19:34,454 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108763526] [2019-11-06 21:19:34,455 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:34,455 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:34,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648758536] [2019-11-06 21:19:34,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:34,463 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:34,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:34,480 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-11-06 21:19:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:34,546 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2019-11-06 21:19:34,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:34,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-06 21:19:34,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:34,561 INFO L225 Difference]: With dead ends: 93 [2019-11-06 21:19:34,562 INFO L226 Difference]: Without dead ends: 78 [2019-11-06 21:19:34,565 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:19:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-06 21:19:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2019-11-06 21:19:34,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-06 21:19:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-11-06 21:19:34,606 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2019-11-06 21:19:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:34,607 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-11-06 21:19:34,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-11-06 21:19:34,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:19:34,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:34,609 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:19:34,609 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:34,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:34,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2019-11-06 21:19:34,610 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:34,610 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752215095] [2019-11-06 21:19:34,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:34,684 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:19:34,684 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752215095] [2019-11-06 21:19:34,685 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:34,685 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:34,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509007665] [2019-11-06 21:19:34,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:34,688 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:34,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:34,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:34,692 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-11-06 21:19:34,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:34,752 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2019-11-06 21:19:34,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:34,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-06 21:19:34,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:34,757 INFO L225 Difference]: With dead ends: 127 [2019-11-06 21:19:34,757 INFO L226 Difference]: Without dead ends: 78 [2019-11-06 21:19:34,758 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:19:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-06 21:19:34,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-06 21:19:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-06 21:19:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2019-11-06 21:19:34,785 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2019-11-06 21:19:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:34,785 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2019-11-06 21:19:34,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2019-11-06 21:19:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:19:34,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:34,786 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:19:34,787 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:34,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:34,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2019-11-06 21:19:34,787 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:34,788 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922503754] [2019-11-06 21:19:34,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:34,847 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:19:34,849 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922503754] [2019-11-06 21:19:34,849 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:34,849 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:34,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557814243] [2019-11-06 21:19:34,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:34,850 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:34,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:34,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:34,851 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2019-11-06 21:19:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:34,874 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2019-11-06 21:19:34,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:34,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-06 21:19:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:34,876 INFO L225 Difference]: With dead ends: 117 [2019-11-06 21:19:34,876 INFO L226 Difference]: Without dead ends: 81 [2019-11-06 21:19:34,877 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:19:34,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-06 21:19:34,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-11-06 21:19:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-06 21:19:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2019-11-06 21:19:34,890 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2019-11-06 21:19:34,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:34,890 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2019-11-06 21:19:34,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2019-11-06 21:19:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:19:34,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:34,892 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:19:34,894 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:34,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:34,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2019-11-06 21:19:34,894 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:34,895 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613811790] [2019-11-06 21:19:34,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:34,942 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:19:34,942 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613811790] [2019-11-06 21:19:34,943 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:34,943 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:34,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472567163] [2019-11-06 21:19:34,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:34,944 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:34,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:34,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:34,945 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2019-11-06 21:19:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:34,974 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2019-11-06 21:19:34,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:34,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-06 21:19:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:34,977 INFO L225 Difference]: With dead ends: 148 [2019-11-06 21:19:34,977 INFO L226 Difference]: Without dead ends: 146 [2019-11-06 21:19:34,977 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:19:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-06 21:19:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2019-11-06 21:19:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-06 21:19:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2019-11-06 21:19:34,992 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2019-11-06 21:19:34,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:34,992 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2019-11-06 21:19:34,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2019-11-06 21:19:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:19:34,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:34,995 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:19:34,995 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:34,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:34,995 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2019-11-06 21:19:34,996 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:34,996 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128146964] [2019-11-06 21:19:34,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,036 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:19:35,037 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128146964] [2019-11-06 21:19:35,037 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:35,037 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:35,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901143439] [2019-11-06 21:19:35,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:35,038 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:35,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:35,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:35,039 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2019-11-06 21:19:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:35,062 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2019-11-06 21:19:35,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:35,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-06 21:19:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:35,064 INFO L225 Difference]: With dead ends: 244 [2019-11-06 21:19:35,065 INFO L226 Difference]: Without dead ends: 148 [2019-11-06 21:19:35,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:19:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-06 21:19:35,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2019-11-06 21:19:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-06 21:19:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2019-11-06 21:19:35,079 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2019-11-06 21:19:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:35,080 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2019-11-06 21:19:35,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2019-11-06 21:19:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:19:35,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:35,082 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:19:35,082 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:35,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:35,083 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2019-11-06 21:19:35,083 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:35,083 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111788085] [2019-11-06 21:19:35,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,138 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:19:35,139 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111788085] [2019-11-06 21:19:35,139 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:35,139 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:35,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159067776] [2019-11-06 21:19:35,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:35,140 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:35,142 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2019-11-06 21:19:35,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:35,167 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2019-11-06 21:19:35,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:35,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-06 21:19:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:35,169 INFO L225 Difference]: With dead ends: 219 [2019-11-06 21:19:35,169 INFO L226 Difference]: Without dead ends: 150 [2019-11-06 21:19:35,170 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:19:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-06 21:19:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-11-06 21:19:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-06 21:19:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2019-11-06 21:19:35,185 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2019-11-06 21:19:35,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:35,185 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2019-11-06 21:19:35,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2019-11-06 21:19:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:19:35,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:35,188 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:19:35,188 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2019-11-06 21:19:35,192 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:35,192 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838514832] [2019-11-06 21:19:35,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,268 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:19:35,268 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838514832] [2019-11-06 21:19:35,269 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:35,269 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:35,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279988340] [2019-11-06 21:19:35,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:35,270 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:35,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:35,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:35,271 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2019-11-06 21:19:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:35,308 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2019-11-06 21:19:35,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:35,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-06 21:19:35,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:35,313 INFO L225 Difference]: With dead ends: 276 [2019-11-06 21:19:35,313 INFO L226 Difference]: Without dead ends: 274 [2019-11-06 21:19:35,314 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:19:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-06 21:19:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2019-11-06 21:19:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-06 21:19:35,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2019-11-06 21:19:35,343 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2019-11-06 21:19:35,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:35,344 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2019-11-06 21:19:35,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2019-11-06 21:19:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:19:35,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:35,349 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:19:35,350 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:35,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:35,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2019-11-06 21:19:35,350 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:35,350 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787386591] [2019-11-06 21:19:35,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,409 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:19:35,409 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787386591] [2019-11-06 21:19:35,410 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:35,410 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:35,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549927022] [2019-11-06 21:19:35,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:35,411 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:35,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:35,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:35,411 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2019-11-06 21:19:35,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:35,432 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2019-11-06 21:19:35,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:35,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-06 21:19:35,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:35,435 INFO L225 Difference]: With dead ends: 472 [2019-11-06 21:19:35,435 INFO L226 Difference]: Without dead ends: 282 [2019-11-06 21:19:35,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:19:35,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-06 21:19:35,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2019-11-06 21:19:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-06 21:19:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2019-11-06 21:19:35,449 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2019-11-06 21:19:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:35,449 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2019-11-06 21:19:35,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2019-11-06 21:19:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:19:35,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:35,451 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, 1] [2019-11-06 21:19:35,452 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:35,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:35,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2019-11-06 21:19:35,452 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:35,453 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156407457] [2019-11-06 21:19:35,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,495 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:19:35,495 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156407457] [2019-11-06 21:19:35,495 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:35,496 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:35,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840445376] [2019-11-06 21:19:35,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:35,496 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:35,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:35,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:35,497 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2019-11-06 21:19:35,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:35,522 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2019-11-06 21:19:35,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:35,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-06 21:19:35,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:35,524 INFO L225 Difference]: With dead ends: 420 [2019-11-06 21:19:35,524 INFO L226 Difference]: Without dead ends: 286 [2019-11-06 21:19:35,525 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:19:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-06 21:19:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-11-06 21:19:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-06 21:19:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2019-11-06 21:19:35,540 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2019-11-06 21:19:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:35,540 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2019-11-06 21:19:35,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2019-11-06 21:19:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:19:35,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:35,547 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, 1] [2019-11-06 21:19:35,547 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:35,548 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2019-11-06 21:19:35,548 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:35,548 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708931516] [2019-11-06 21:19:35,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,597 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:19:35,597 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708931516] [2019-11-06 21:19:35,598 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:35,598 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:35,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703527836] [2019-11-06 21:19:35,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:35,599 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:35,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:35,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:35,599 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2019-11-06 21:19:35,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:35,636 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2019-11-06 21:19:35,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:35,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-06 21:19:35,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:35,645 INFO L225 Difference]: With dead ends: 524 [2019-11-06 21:19:35,645 INFO L226 Difference]: Without dead ends: 522 [2019-11-06 21:19:35,646 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:19:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-11-06 21:19:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2019-11-06 21:19:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-11-06 21:19:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2019-11-06 21:19:35,669 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2019-11-06 21:19:35,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:35,671 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2019-11-06 21:19:35,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2019-11-06 21:19:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:19:35,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:35,672 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, 1] [2019-11-06 21:19:35,673 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:35,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:35,673 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2019-11-06 21:19:35,673 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:35,673 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249449739] [2019-11-06 21:19:35,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,699 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:19:35,700 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249449739] [2019-11-06 21:19:35,700 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:35,700 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:35,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60739554] [2019-11-06 21:19:35,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:35,701 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:35,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:35,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:35,701 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2019-11-06 21:19:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:35,739 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2019-11-06 21:19:35,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:35,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-06 21:19:35,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:35,745 INFO L225 Difference]: With dead ends: 924 [2019-11-06 21:19:35,745 INFO L226 Difference]: Without dead ends: 546 [2019-11-06 21:19:35,747 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:19:35,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-11-06 21:19:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-11-06 21:19:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-11-06 21:19:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2019-11-06 21:19:35,770 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2019-11-06 21:19:35,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:35,771 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2019-11-06 21:19:35,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:35,771 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2019-11-06 21:19:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:19:35,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:35,774 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, 1, 1] [2019-11-06 21:19:35,775 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:35,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:35,775 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2019-11-06 21:19:35,775 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:35,775 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473021251] [2019-11-06 21:19:35,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,811 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:19:35,812 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473021251] [2019-11-06 21:19:35,812 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:35,812 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:35,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784026434] [2019-11-06 21:19:35,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:35,814 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:35,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:35,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:35,814 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2019-11-06 21:19:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:35,840 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2019-11-06 21:19:35,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:35,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-06 21:19:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:35,844 INFO L225 Difference]: With dead ends: 816 [2019-11-06 21:19:35,844 INFO L226 Difference]: Without dead ends: 554 [2019-11-06 21:19:35,845 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:19:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-11-06 21:19:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2019-11-06 21:19:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-11-06 21:19:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2019-11-06 21:19:35,864 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2019-11-06 21:19:35,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:35,865 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2019-11-06 21:19:35,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2019-11-06 21:19:35,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:19:35,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:35,866 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, 1, 1] [2019-11-06 21:19:35,867 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:35,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:35,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2019-11-06 21:19:35,867 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:35,868 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953775141] [2019-11-06 21:19:35,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:35,899 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:19:35,899 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953775141] [2019-11-06 21:19:35,899 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:35,900 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:35,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866974533] [2019-11-06 21:19:35,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:35,901 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:35,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:35,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:35,901 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2019-11-06 21:19:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:35,933 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2019-11-06 21:19:35,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:35,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-06 21:19:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:35,942 INFO L225 Difference]: With dead ends: 1004 [2019-11-06 21:19:35,942 INFO L226 Difference]: Without dead ends: 1002 [2019-11-06 21:19:35,944 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:19:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-11-06 21:19:35,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2019-11-06 21:19:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-06 21:19:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2019-11-06 21:19:35,976 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2019-11-06 21:19:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:35,977 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2019-11-06 21:19:35,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:35,978 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2019-11-06 21:19:35,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:19:35,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:35,983 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, 1, 1] [2019-11-06 21:19:35,983 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:35,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:35,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2019-11-06 21:19:35,984 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:35,984 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889668436] [2019-11-06 21:19:35,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:36,015 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:19:36,015 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889668436] [2019-11-06 21:19:36,016 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:36,016 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:36,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348278301] [2019-11-06 21:19:36,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:36,017 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:36,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:36,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:36,017 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2019-11-06 21:19:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:36,056 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2019-11-06 21:19:36,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:36,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-06 21:19:36,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:36,065 INFO L225 Difference]: With dead ends: 1820 [2019-11-06 21:19:36,065 INFO L226 Difference]: Without dead ends: 1066 [2019-11-06 21:19:36,068 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:19:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-11-06 21:19:36,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2019-11-06 21:19:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-11-06 21:19:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2019-11-06 21:19:36,112 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2019-11-06 21:19:36,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:36,113 INFO L462 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2019-11-06 21:19:36,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2019-11-06 21:19:36,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 21:19:36,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:36,116 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, 1, 1, 1] [2019-11-06 21:19:36,116 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:36,117 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2019-11-06 21:19:36,117 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:36,117 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965689343] [2019-11-06 21:19:36,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:36,144 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:19:36,146 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965689343] [2019-11-06 21:19:36,146 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:36,147 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:36,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604176697] [2019-11-06 21:19:36,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:36,148 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:36,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:36,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:36,149 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2019-11-06 21:19:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:36,185 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2019-11-06 21:19:36,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:36,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-06 21:19:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:36,192 INFO L225 Difference]: With dead ends: 1596 [2019-11-06 21:19:36,193 INFO L226 Difference]: Without dead ends: 1082 [2019-11-06 21:19:36,196 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:19:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-11-06 21:19:36,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2019-11-06 21:19:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-11-06 21:19:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2019-11-06 21:19:36,250 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2019-11-06 21:19:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:36,251 INFO L462 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2019-11-06 21:19:36,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2019-11-06 21:19:36,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 21:19:36,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:36,253 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, 1, 1, 1] [2019-11-06 21:19:36,253 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:36,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:36,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2019-11-06 21:19:36,254 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:36,254 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50402973] [2019-11-06 21:19:36,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:36,279 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:19:36,280 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50402973] [2019-11-06 21:19:36,280 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:36,280 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:36,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112288052] [2019-11-06 21:19:36,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:36,283 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:36,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:36,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:36,283 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2019-11-06 21:19:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:36,319 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2019-11-06 21:19:36,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:36,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-06 21:19:36,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:36,329 INFO L225 Difference]: With dead ends: 1932 [2019-11-06 21:19:36,329 INFO L226 Difference]: Without dead ends: 1930 [2019-11-06 21:19:36,330 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:19:36,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-11-06 21:19:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2019-11-06 21:19:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-11-06 21:19:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2019-11-06 21:19:36,380 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2019-11-06 21:19:36,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:36,380 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2019-11-06 21:19:36,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2019-11-06 21:19:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 21:19:36,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:36,384 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, 1, 1, 1] [2019-11-06 21:19:36,384 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:36,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:36,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2019-11-06 21:19:36,385 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:36,385 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726347716] [2019-11-06 21:19:36,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:36,405 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:19:36,407 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726347716] [2019-11-06 21:19:36,407 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:36,407 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:36,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856482546] [2019-11-06 21:19:36,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:36,408 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:36,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:36,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:36,408 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2019-11-06 21:19:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:36,459 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2019-11-06 21:19:36,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:36,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-06 21:19:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:36,470 INFO L225 Difference]: With dead ends: 3596 [2019-11-06 21:19:36,470 INFO L226 Difference]: Without dead ends: 2090 [2019-11-06 21:19:36,474 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:19:36,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2019-11-06 21:19:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2019-11-06 21:19:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-11-06 21:19:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2019-11-06 21:19:36,535 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2019-11-06 21:19:36,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:36,536 INFO L462 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2019-11-06 21:19:36,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2019-11-06 21:19:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 21:19:36,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:36,539 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, 1, 1, 1, 1] [2019-11-06 21:19:36,539 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:36,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:36,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2019-11-06 21:19:36,541 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:36,541 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711946912] [2019-11-06 21:19:36,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:36,564 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:19:36,564 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711946912] [2019-11-06 21:19:36,565 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:36,565 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:36,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636883197] [2019-11-06 21:19:36,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:36,566 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:36,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:36,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:36,566 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2019-11-06 21:19:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:36,610 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2019-11-06 21:19:36,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:36,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-06 21:19:36,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:36,620 INFO L225 Difference]: With dead ends: 3132 [2019-11-06 21:19:36,621 INFO L226 Difference]: Without dead ends: 2122 [2019-11-06 21:19:36,624 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:19:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-11-06 21:19:36,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2019-11-06 21:19:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2019-11-06 21:19:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2019-11-06 21:19:36,689 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2019-11-06 21:19:36,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:36,690 INFO L462 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2019-11-06 21:19:36,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2019-11-06 21:19:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 21:19:36,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:36,693 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, 1, 1, 1, 1] [2019-11-06 21:19:36,693 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2019-11-06 21:19:36,694 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:36,694 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180824881] [2019-11-06 21:19:36,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:36,727 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:19:36,728 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180824881] [2019-11-06 21:19:36,728 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:36,729 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:36,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760021975] [2019-11-06 21:19:36,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:36,731 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:36,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:36,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:36,732 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2019-11-06 21:19:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:36,826 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2019-11-06 21:19:36,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:36,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-06 21:19:36,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:36,851 INFO L225 Difference]: With dead ends: 3724 [2019-11-06 21:19:36,852 INFO L226 Difference]: Without dead ends: 3722 [2019-11-06 21:19:36,854 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:19:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-11-06 21:19:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2019-11-06 21:19:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-11-06 21:19:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2019-11-06 21:19:36,989 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2019-11-06 21:19:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:36,990 INFO L462 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2019-11-06 21:19:36,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2019-11-06 21:19:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 21:19:36,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:36,995 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, 1, 1, 1, 1] [2019-11-06 21:19:36,996 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2019-11-06 21:19:36,996 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:36,997 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212087499] [2019-11-06 21:19:36,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:37,040 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:19:37,040 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212087499] [2019-11-06 21:19:37,040 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:37,041 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:37,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896218873] [2019-11-06 21:19:37,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:37,041 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:37,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:37,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:37,042 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2019-11-06 21:19:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:37,132 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2019-11-06 21:19:37,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:37,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-06 21:19:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:37,151 INFO L225 Difference]: With dead ends: 7116 [2019-11-06 21:19:37,152 INFO L226 Difference]: Without dead ends: 4106 [2019-11-06 21:19:37,157 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:19:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-11-06 21:19:37,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2019-11-06 21:19:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-11-06 21:19:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2019-11-06 21:19:37,277 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2019-11-06 21:19:37,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:37,278 INFO L462 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2019-11-06 21:19:37,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:37,278 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2019-11-06 21:19:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:19:37,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:37,283 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, 1, 1, 1, 1, 1] [2019-11-06 21:19:37,284 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:37,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2019-11-06 21:19:37,284 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:37,284 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659338899] [2019-11-06 21:19:37,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:37,307 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:19:37,308 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659338899] [2019-11-06 21:19:37,308 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:37,308 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:37,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496139030] [2019-11-06 21:19:37,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:37,309 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:37,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:37,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:37,310 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2019-11-06 21:19:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:37,384 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2019-11-06 21:19:37,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:37,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-06 21:19:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:37,418 INFO L225 Difference]: With dead ends: 6156 [2019-11-06 21:19:37,418 INFO L226 Difference]: Without dead ends: 4170 [2019-11-06 21:19:37,423 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:19:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2019-11-06 21:19:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2019-11-06 21:19:37,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2019-11-06 21:19:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2019-11-06 21:19:37,577 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2019-11-06 21:19:37,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:37,577 INFO L462 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2019-11-06 21:19:37,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2019-11-06 21:19:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:19:37,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:37,583 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, 1, 1, 1, 1, 1] [2019-11-06 21:19:37,583 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:37,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:37,584 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2019-11-06 21:19:37,584 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:37,584 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409759153] [2019-11-06 21:19:37,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:37,602 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:19:37,602 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409759153] [2019-11-06 21:19:37,602 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:37,603 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:37,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125200043] [2019-11-06 21:19:37,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:37,603 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:37,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:37,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:37,604 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2019-11-06 21:19:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:37,721 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2019-11-06 21:19:37,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:37,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-06 21:19:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:37,742 INFO L225 Difference]: With dead ends: 12108 [2019-11-06 21:19:37,742 INFO L226 Difference]: Without dead ends: 8074 [2019-11-06 21:19:37,751 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:19:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-11-06 21:19:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2019-11-06 21:19:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-11-06 21:19:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2019-11-06 21:19:37,963 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2019-11-06 21:19:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:37,964 INFO L462 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2019-11-06 21:19:37,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2019-11-06 21:19:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:19:37,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:37,974 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, 1, 1, 1, 1, 1] [2019-11-06 21:19:37,974 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:37,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:37,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2019-11-06 21:19:37,975 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:37,975 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417530143] [2019-11-06 21:19:37,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:37,998 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:19:37,999 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417530143] [2019-11-06 21:19:37,999 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:37,999 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:38,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818282413] [2019-11-06 21:19:38,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:38,000 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:38,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:38,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:38,001 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2019-11-06 21:19:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:38,188 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2019-11-06 21:19:38,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:38,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-06 21:19:38,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:38,207 INFO L225 Difference]: With dead ends: 9100 [2019-11-06 21:19:38,207 INFO L226 Difference]: Without dead ends: 9098 [2019-11-06 21:19:38,210 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:19:38,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2019-11-06 21:19:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2019-11-06 21:19:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-11-06 21:19:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2019-11-06 21:19:38,426 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2019-11-06 21:19:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:38,426 INFO L462 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2019-11-06 21:19:38,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2019-11-06 21:19:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 21:19:38,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:38,439 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, 1, 1, 1, 1, 1, 1] [2019-11-06 21:19:38,439 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:38,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:38,440 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2019-11-06 21:19:38,440 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:38,440 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398569775] [2019-11-06 21:19:38,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:38,460 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:19:38,461 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398569775] [2019-11-06 21:19:38,461 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:38,461 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:38,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374712091] [2019-11-06 21:19:38,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:38,462 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:38,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:38,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:38,463 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2019-11-06 21:19:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:38,705 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2019-11-06 21:19:38,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:38,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-06 21:19:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:38,732 INFO L225 Difference]: With dead ends: 13708 [2019-11-06 21:19:38,732 INFO L226 Difference]: Without dead ends: 13706 [2019-11-06 21:19:38,736 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:19:38,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2019-11-06 21:19:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2019-11-06 21:19:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2019-11-06 21:19:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2019-11-06 21:19:39,073 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2019-11-06 21:19:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:39,073 INFO L462 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2019-11-06 21:19:39,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2019-11-06 21:19:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 21:19:39,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:39,091 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, 1, 1, 1, 1, 1, 1] [2019-11-06 21:19:39,091 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:39,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2019-11-06 21:19:39,092 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:39,092 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71691972] [2019-11-06 21:19:39,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:39,109 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:19:39,110 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71691972] [2019-11-06 21:19:39,110 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:39,110 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:39,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677427192] [2019-11-06 21:19:39,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:39,111 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:39,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:39,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:39,112 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2019-11-06 21:19:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:39,332 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2019-11-06 21:19:39,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:39,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-06 21:19:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:39,376 INFO L225 Difference]: With dead ends: 27788 [2019-11-06 21:19:39,376 INFO L226 Difference]: Without dead ends: 15754 [2019-11-06 21:19:39,409 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:19:39,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2019-11-06 21:19:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2019-11-06 21:19:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2019-11-06 21:19:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2019-11-06 21:19:39,899 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2019-11-06 21:19:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:39,899 INFO L462 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2019-11-06 21:19:39,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2019-11-06 21:19:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:19:39,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:39,918 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:19:39,918 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:39,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:39,918 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2019-11-06 21:19:39,918 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:39,919 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171873506] [2019-11-06 21:19:39,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:39,942 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:19:39,943 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171873506] [2019-11-06 21:19:39,943 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:39,943 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:39,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738675362] [2019-11-06 21:19:39,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:39,944 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:39,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:39,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:39,944 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2019-11-06 21:19:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:40,506 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2019-11-06 21:19:40,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:40,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-06 21:19:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:40,536 INFO L225 Difference]: With dead ends: 23820 [2019-11-06 21:19:40,536 INFO L226 Difference]: Without dead ends: 16138 [2019-11-06 21:19:40,552 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:19:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2019-11-06 21:19:40,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2019-11-06 21:19:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2019-11-06 21:19:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2019-11-06 21:19:40,987 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2019-11-06 21:19:40,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:40,988 INFO L462 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2019-11-06 21:19:40,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2019-11-06 21:19:41,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:19:41,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:41,006 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:19:41,007 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:41,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:41,008 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2019-11-06 21:19:41,009 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:41,012 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545267268] [2019-11-06 21:19:41,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:41,034 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:19:41,035 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545267268] [2019-11-06 21:19:41,035 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:41,035 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:41,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729867222] [2019-11-06 21:19:41,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:41,036 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:41,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:41,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:41,036 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2019-11-06 21:19:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:41,447 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2019-11-06 21:19:41,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:41,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-06 21:19:41,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:41,491 INFO L225 Difference]: With dead ends: 26636 [2019-11-06 21:19:41,491 INFO L226 Difference]: Without dead ends: 26634 [2019-11-06 21:19:41,497 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:19:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2019-11-06 21:19:41,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2019-11-06 21:19:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2019-11-06 21:19:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2019-11-06 21:19:41,914 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2019-11-06 21:19:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:41,915 INFO L462 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2019-11-06 21:19:41,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2019-11-06 21:19:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:19:41,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:41,948 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:19:41,948 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:41,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:41,948 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2019-11-06 21:19:41,949 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:41,949 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012916437] [2019-11-06 21:19:41,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:41,969 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:19:41,969 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012916437] [2019-11-06 21:19:41,969 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:41,969 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:41,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986107548] [2019-11-06 21:19:41,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:41,970 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:41,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:41,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:41,970 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2019-11-06 21:19:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:42,416 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2019-11-06 21:19:42,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:42,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-06 21:19:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:42,480 INFO L225 Difference]: With dead ends: 55308 [2019-11-06 21:19:42,480 INFO L226 Difference]: Without dead ends: 31242 [2019-11-06 21:19:42,523 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:19:42,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2019-11-06 21:19:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2019-11-06 21:19:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2019-11-06 21:19:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2019-11-06 21:19:43,261 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2019-11-06 21:19:43,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:43,261 INFO L462 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2019-11-06 21:19:43,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:43,262 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2019-11-06 21:19:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:19:43,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:43,293 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:19:43,293 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:43,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:43,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2019-11-06 21:19:43,293 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:43,294 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022844863] [2019-11-06 21:19:43,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:43,319 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:19:43,320 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022844863] [2019-11-06 21:19:43,320 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:43,320 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:43,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958386178] [2019-11-06 21:19:43,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:43,321 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:43,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:43,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:43,322 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2019-11-06 21:19:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:43,758 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2019-11-06 21:19:43,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:43,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-06 21:19:43,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:43,822 INFO L225 Difference]: With dead ends: 46860 [2019-11-06 21:19:43,822 INFO L226 Difference]: Without dead ends: 31754 [2019-11-06 21:19:43,855 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:19:43,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2019-11-06 21:19:45,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2019-11-06 21:19:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2019-11-06 21:19:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2019-11-06 21:19:45,197 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2019-11-06 21:19:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:45,197 INFO L462 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2019-11-06 21:19:45,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2019-11-06 21:19:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:19:45,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:45,219 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:19:45,219 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:45,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2019-11-06 21:19:45,221 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:45,221 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293249006] [2019-11-06 21:19:45,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:45,241 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:19:45,241 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293249006] [2019-11-06 21:19:45,241 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:45,242 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:45,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950084045] [2019-11-06 21:19:45,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:45,242 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:45,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:45,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:45,243 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2019-11-06 21:19:45,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:45,825 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2019-11-06 21:19:45,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:45,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-06 21:19:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:45,895 INFO L225 Difference]: With dead ends: 51210 [2019-11-06 21:19:45,896 INFO L226 Difference]: Without dead ends: 51208 [2019-11-06 21:19:45,910 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:19:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2019-11-06 21:19:46,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2019-11-06 21:19:46,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2019-11-06 21:19:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2019-11-06 21:19:46,903 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2019-11-06 21:19:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:46,903 INFO L462 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2019-11-06 21:19:46,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2019-11-06 21:19:46,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:19:46,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:46,942 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:19:46,942 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:46,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:46,942 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2019-11-06 21:19:46,942 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:46,943 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837795146] [2019-11-06 21:19:46,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:46,962 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:19:46,962 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837795146] [2019-11-06 21:19:46,962 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:46,962 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:46,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266976975] [2019-11-06 21:19:46,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:46,963 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:46,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:46,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:46,964 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2019-11-06 21:19:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:47,591 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2019-11-06 21:19:47,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:47,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-06 21:19:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:47,592 INFO L225 Difference]: With dead ends: 109576 [2019-11-06 21:19:47,592 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:19:47,945 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:19:47,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:19:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:19:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:19:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:19:47,946 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-11-06 21:19:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:47,947 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:19:47,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:19:47,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:19:47,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:19:47,974 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-06 21:19:47,974 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:19:47,974 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:19:47,974 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 21:19:47,974 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:19:47,974 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:19:47,974 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2019-11-06 21:19:47,975 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-06 21:19:47,975 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-11-06 21:19:47,975 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-11-06 21:19:47,975 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-06 21:19:47,975 INFO L439 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-11-06 21:19:47,975 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,975 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,975 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,975 INFO L443 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,975 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-11-06 21:19:47,976 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,976 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-06 21:19:47,976 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,976 INFO L443 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,976 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2019-11-06 21:19:47,976 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,976 INFO L443 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-11-06 21:19:47,976 INFO L443 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,976 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,977 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2019-11-06 21:19:47,978 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-06 21:19:47,978 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-06 21:19:47,979 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-11-06 21:19:47,979 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,979 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,979 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-06 21:19:47,979 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-06 21:19:47,979 INFO L446 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-11-06 21:19:47,979 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,979 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,979 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,980 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,980 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,980 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,980 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,980 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-06 21:19:47,980 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-11-06 21:19:47,980 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,980 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-11-06 21:19:47,980 INFO L446 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-11-06 21:19:47,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:19:47 BoogieIcfgContainer [2019-11-06 21:19:47,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:19:47,999 INFO L168 Benchmark]: Toolchain (without parser) took 14813.64 ms. Allocated memory was 143.7 MB in the beginning and 1.1 GB in the end (delta: 965.2 MB). Free memory was 101.6 MB in the beginning and 804.5 MB in the end (delta: -702.9 MB). Peak memory consumption was 262.3 MB. Max. memory is 7.1 GB. [2019-11-06 21:19:48,000 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 143.7 MB. Free memory is still 119.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-06 21:19:48,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 492.86 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 101.6 MB in the beginning and 180.8 MB in the end (delta: -79.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-11-06 21:19:48,001 INFO L168 Benchmark]: Boogie Preprocessor took 65.29 ms. Allocated memory is still 201.9 MB. Free memory was 180.8 MB in the beginning and 178.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-11-06 21:19:48,002 INFO L168 Benchmark]: RCFGBuilder took 401.43 ms. Allocated memory is still 201.9 MB. Free memory was 178.4 MB in the beginning and 158.6 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-11-06 21:19:48,003 INFO L168 Benchmark]: TraceAbstraction took 13842.28 ms. Allocated memory was 201.9 MB in the beginning and 1.1 GB in the end (delta: 907.0 MB). Free memory was 158.6 MB in the beginning and 804.5 MB in the end (delta: -645.9 MB). Peak memory consumption was 261.1 MB. Max. memory is 7.1 GB. [2019-11-06 21:19:48,008 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.48 ms. Allocated memory is still 143.7 MB. Free memory is still 119.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 492.86 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 101.6 MB in the beginning and 180.8 MB in the end (delta: -79.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.29 ms. Allocated memory is still 201.9 MB. Free memory was 180.8 MB in the beginning and 178.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 401.43 ms. Allocated memory is still 201.9 MB. Free memory was 178.4 MB in the beginning and 158.6 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13842.28 ms. Allocated memory was 201.9 MB in the beginning and 1.1 GB in the end (delta: 907.0 MB). Free memory was 158.6 MB in the beginning and 804.5 MB in the end (delta: -645.9 MB). Peak memory consumption was 261.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: 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, 47 locations, 1 error locations. Result: SAFE, OverallTime: 13.7s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...