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/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:23:43,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:23:43,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:23:43,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:23:43,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:23:43,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:23:43,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:23:43,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:23:43,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:23:43,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:23:43,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:23:43,215 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:23:43,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:23:43,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:23:43,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:23:43,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:23:43,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:23:43,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:23:43,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:23:43,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:23:43,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:23:43,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:23:43,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:23:43,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:23:43,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:23:43,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:23:43,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:23:43,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:23:43,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:23:43,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:23:43,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:23:43,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:23:43,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:23:43,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:23:43,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:23:43,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:23:43,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:23:43,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:23:43,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:23:43,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:23:43,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:23:43,242 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-09-08 12:23:43,273 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:23:43,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:23:43,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:23:43,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:23:43,275 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:23:43,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:23:43,275 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:23:43,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:23:43,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:23:43,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:23:43,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:23:43,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:23:43,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:23:43,277 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:23:43,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:23:43,277 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:23:43,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:23:43,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:23:43,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:23:43,278 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:23:43,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:23:43,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:23:43,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:23:43,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:23:43,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:23:43,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:23:43,279 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:23:43,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:23:43,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:23:43,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:23:43,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:23:43,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:23:43,328 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:23:43,328 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:23:43,329 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:23:43,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40773bf88/5bc148d78aac48f89044e7e819b3d24d/FLAG3ac7f8c95 [2019-09-08 12:23:44,191 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:23:44,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:23:44,228 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40773bf88/5bc148d78aac48f89044e7e819b3d24d/FLAG3ac7f8c95 [2019-09-08 12:23:44,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40773bf88/5bc148d78aac48f89044e7e819b3d24d [2019-09-08 12:23:44,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:23:44,259 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:23:44,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:23:44,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:23:44,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:23:44,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:23:44" (1/1) ... [2019-09-08 12:23:44,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c5f355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:44, skipping insertion in model container [2019-09-08 12:23:44,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:23:44" (1/1) ... [2019-09-08 12:23:44,273 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:23:44,513 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:23:46,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:23:46,513 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:23:47,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:23:47,490 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:23:47,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:47 WrapperNode [2019-09-08 12:23:47,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:23:47,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:23:47,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:23:47,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:23:47,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:47" (1/1) ... [2019-09-08 12:23:47,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:47" (1/1) ... [2019-09-08 12:23:47,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:47" (1/1) ... [2019-09-08 12:23:47,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:47" (1/1) ... [2019-09-08 12:23:47,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:47" (1/1) ... [2019-09-08 12:23:47,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:47" (1/1) ... [2019-09-08 12:23:47,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:47" (1/1) ... [2019-09-08 12:23:47,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:23:47,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:23:47,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:23:47,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:23:47,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:47" (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-09-08 12:23:47,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:23:47,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:23:47,879 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:23:47,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:23:47,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:23:47,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:23:47,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:23:47,881 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:23:47,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:23:47,883 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:23:47,883 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:23:47,883 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:23:47,884 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:23:47,884 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:23:47,885 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:23:47,885 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:23:47,887 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:23:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:23:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:23:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:23:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:23:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:23:54,740 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:23:54,741 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:23:54,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:23:54 BoogieIcfgContainer [2019-09-08 12:23:54,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:23:54,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:23:54,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:23:54,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:23:54,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:23:44" (1/3) ... [2019-09-08 12:23:54,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e8f428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:23:54, skipping insertion in model container [2019-09-08 12:23:54,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:23:47" (2/3) ... [2019-09-08 12:23:54,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e8f428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:23:54, skipping insertion in model container [2019-09-08 12:23:54,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:23:54" (3/3) ... [2019-09-08 12:23:54,758 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 12:23:54,770 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:23:54,805 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-08 12:23:54,828 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-08 12:23:54,891 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:23:54,892 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:23:54,892 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:23:54,892 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:23:54,893 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:23:54,893 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:23:54,893 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:23:54,893 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:23:54,894 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:23:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states. [2019-09-08 12:23:55,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:23:55,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:55,002 INFO L399 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, 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, 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-09-08 12:23:55,005 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:55,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:55,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1894963753, now seen corresponding path program 1 times [2019-09-08 12:23:55,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:55,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:55,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:55,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:55,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:55,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:55,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:23:55,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:23:55,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:23:55,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:23:55,731 INFO L87 Difference]: Start difference. First operand 2353 states. Second operand 5 states. [2019-09-08 12:23:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:23:58,284 INFO L93 Difference]: Finished difference Result 2940 states and 5210 transitions. [2019-09-08 12:23:58,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:23:58,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-08 12:23:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:23:58,312 INFO L225 Difference]: With dead ends: 2940 [2019-09-08 12:23:58,313 INFO L226 Difference]: Without dead ends: 1747 [2019-09-08 12:23:58,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:23:58,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2019-09-08 12:23:58,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1747. [2019-09-08 12:23:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2019-09-08 12:23:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2288 transitions. [2019-09-08 12:23:58,468 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2288 transitions. Word has length 90 [2019-09-08 12:23:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:23:58,469 INFO L475 AbstractCegarLoop]: Abstraction has 1747 states and 2288 transitions. [2019-09-08 12:23:58,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:23:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2288 transitions. [2019-09-08 12:23:58,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:23:58,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:23:58,476 INFO L399 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, 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, 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-09-08 12:23:58,477 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:23:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:23:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1518436791, now seen corresponding path program 1 times [2019-09-08 12:23:58,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:23:58,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:23:58,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:58,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:23:58,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:23:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:23:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:23:58,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:23:58,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:23:58,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:23:58,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:23:58,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:23:58,744 INFO L87 Difference]: Start difference. First operand 1747 states and 2288 transitions. Second operand 5 states. [2019-09-08 12:24:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:00,160 INFO L93 Difference]: Finished difference Result 2066 states and 2687 transitions. [2019-09-08 12:24:00,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:24:00,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-08 12:24:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:00,167 INFO L225 Difference]: With dead ends: 2066 [2019-09-08 12:24:00,167 INFO L226 Difference]: Without dead ends: 1199 [2019-09-08 12:24:00,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:24:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-09-08 12:24:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2019-09-08 12:24:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2019-09-08 12:24:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1579 transitions. [2019-09-08 12:24:00,222 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1579 transitions. Word has length 90 [2019-09-08 12:24:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:00,223 INFO L475 AbstractCegarLoop]: Abstraction has 1199 states and 1579 transitions. [2019-09-08 12:24:00,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:24:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1579 transitions. [2019-09-08 12:24:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 12:24:00,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:00,228 INFO L399 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, 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, 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-09-08 12:24:00,229 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:00,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:00,229 INFO L82 PathProgramCache]: Analyzing trace with hash 487198845, now seen corresponding path program 1 times [2019-09-08 12:24:00,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:00,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:00,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:00,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:00,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:00,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:00,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:24:00,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:24:00,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:24:00,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:24:00,427 INFO L87 Difference]: Start difference. First operand 1199 states and 1579 transitions. Second operand 5 states. [2019-09-08 12:24:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:02,153 INFO L93 Difference]: Finished difference Result 2228 states and 2974 transitions. [2019-09-08 12:24:02,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:24:02,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-08 12:24:02,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:02,163 INFO L225 Difference]: With dead ends: 2228 [2019-09-08 12:24:02,163 INFO L226 Difference]: Without dead ends: 1600 [2019-09-08 12:24:02,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:24:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2019-09-08 12:24:02,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1486. [2019-09-08 12:24:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2019-09-08 12:24:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2042 transitions. [2019-09-08 12:24:02,233 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2042 transitions. Word has length 90 [2019-09-08 12:24:02,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:02,233 INFO L475 AbstractCegarLoop]: Abstraction has 1486 states and 2042 transitions. [2019-09-08 12:24:02,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:24:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2042 transitions. [2019-09-08 12:24:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:24:02,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:02,237 INFO L399 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, 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, 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-09-08 12:24:02,238 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:02,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:02,239 INFO L82 PathProgramCache]: Analyzing trace with hash -611229365, now seen corresponding path program 1 times [2019-09-08 12:24:02,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:02,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:02,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:02,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:02,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:02,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:02,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:24:02,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:24:02,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:24:02,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:24:02,398 INFO L87 Difference]: Start difference. First operand 1486 states and 2042 transitions. Second operand 5 states. [2019-09-08 12:24:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:03,265 INFO L93 Difference]: Finished difference Result 1771 states and 2401 transitions. [2019-09-08 12:24:03,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:24:03,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 12:24:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:03,273 INFO L225 Difference]: With dead ends: 1771 [2019-09-08 12:24:03,273 INFO L226 Difference]: Without dead ends: 1026 [2019-09-08 12:24:03,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:24:03,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-09-08 12:24:03,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2019-09-08 12:24:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-09-08 12:24:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1411 transitions. [2019-09-08 12:24:03,337 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1411 transitions. Word has length 91 [2019-09-08 12:24:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:03,337 INFO L475 AbstractCegarLoop]: Abstraction has 1026 states and 1411 transitions. [2019-09-08 12:24:03,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:24:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1411 transitions. [2019-09-08 12:24:03,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:24:03,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:03,341 INFO L399 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, 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, 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-09-08 12:24:03,341 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:03,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1651376349, now seen corresponding path program 1 times [2019-09-08 12:24:03,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:03,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:03,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:03,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:03,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:03,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:03,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:24:03,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:24:03,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:24:03,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:24:03,538 INFO L87 Difference]: Start difference. First operand 1026 states and 1411 transitions. Second operand 5 states. [2019-09-08 12:24:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:04,205 INFO L93 Difference]: Finished difference Result 1484 states and 2046 transitions. [2019-09-08 12:24:04,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:24:04,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-08 12:24:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:04,213 INFO L225 Difference]: With dead ends: 1484 [2019-09-08 12:24:04,213 INFO L226 Difference]: Without dead ends: 917 [2019-09-08 12:24:04,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:24:04,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-08 12:24:04,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 917. [2019-09-08 12:24:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2019-09-08 12:24:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1268 transitions. [2019-09-08 12:24:04,258 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1268 transitions. Word has length 92 [2019-09-08 12:24:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:04,259 INFO L475 AbstractCegarLoop]: Abstraction has 917 states and 1268 transitions. [2019-09-08 12:24:04,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:24:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1268 transitions. [2019-09-08 12:24:04,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:24:04,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:04,262 INFO L399 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, 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, 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-09-08 12:24:04,264 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:04,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:04,264 INFO L82 PathProgramCache]: Analyzing trace with hash 620980430, now seen corresponding path program 1 times [2019-09-08 12:24:04,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:04,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:04,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:04,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:04,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:04,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:04,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:24:04,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:24:04,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:24:04,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:24:04,440 INFO L87 Difference]: Start difference. First operand 917 states and 1268 transitions. Second operand 5 states. [2019-09-08 12:24:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:05,238 INFO L93 Difference]: Finished difference Result 1335 states and 1846 transitions. [2019-09-08 12:24:05,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:24:05,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 12:24:05,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:05,245 INFO L225 Difference]: With dead ends: 1335 [2019-09-08 12:24:05,245 INFO L226 Difference]: Without dead ends: 909 [2019-09-08 12:24:05,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:24:05,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-08 12:24:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2019-09-08 12:24:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1257 transitions. [2019-09-08 12:24:05,299 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1257 transitions. Word has length 93 [2019-09-08 12:24:05,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:05,299 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1257 transitions. [2019-09-08 12:24:05,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:24:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1257 transitions. [2019-09-08 12:24:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:24:05,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:05,302 INFO L399 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, 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, 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, 1] [2019-09-08 12:24:05,303 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:05,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:05,304 INFO L82 PathProgramCache]: Analyzing trace with hash 574019279, now seen corresponding path program 1 times [2019-09-08 12:24:05,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:05,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:05,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:05,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:05,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:05,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-09-08 12:24:05,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:05,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:05,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:05,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:05,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:05,702 INFO L87 Difference]: Start difference. First operand 909 states and 1257 transitions. Second operand 9 states. [2019-09-08 12:24:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:08,261 INFO L93 Difference]: Finished difference Result 1926 states and 2726 transitions. [2019-09-08 12:24:08,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:08,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-08 12:24:08,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:08,270 INFO L225 Difference]: With dead ends: 1926 [2019-09-08 12:24:08,270 INFO L226 Difference]: Without dead ends: 1730 [2019-09-08 12:24:08,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:08,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2019-09-08 12:24:08,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 909. [2019-09-08 12:24:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1256 transitions. [2019-09-08 12:24:08,334 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1256 transitions. Word has length 94 [2019-09-08 12:24:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:08,335 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1256 transitions. [2019-09-08 12:24:08,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1256 transitions. [2019-09-08 12:24:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:24:08,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:08,338 INFO L399 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, 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, 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, 1] [2019-09-08 12:24:08,339 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:08,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:08,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2033100651, now seen corresponding path program 1 times [2019-09-08 12:24:08,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:08,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:08,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:08,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:08,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:08,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:08,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:08,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:08,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:08,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:08,618 INFO L87 Difference]: Start difference. First operand 909 states and 1256 transitions. Second operand 9 states. [2019-09-08 12:24:11,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:11,346 INFO L93 Difference]: Finished difference Result 1897 states and 2666 transitions. [2019-09-08 12:24:11,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:24:11,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-08 12:24:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:11,356 INFO L225 Difference]: With dead ends: 1897 [2019-09-08 12:24:11,357 INFO L226 Difference]: Without dead ends: 1633 [2019-09-08 12:24:11,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:24:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2019-09-08 12:24:11,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 909. [2019-09-08 12:24:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1255 transitions. [2019-09-08 12:24:11,419 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1255 transitions. Word has length 94 [2019-09-08 12:24:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:11,419 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1255 transitions. [2019-09-08 12:24:11,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1255 transitions. [2019-09-08 12:24:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:24:11,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:11,422 INFO L399 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, 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, 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, 1] [2019-09-08 12:24:11,423 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:11,424 INFO L82 PathProgramCache]: Analyzing trace with hash -518152584, now seen corresponding path program 1 times [2019-09-08 12:24:11,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:11,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:11,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:11,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:11,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:11,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:11,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:24:11,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:24:11,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:24:11,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:24:11,654 INFO L87 Difference]: Start difference. First operand 909 states and 1255 transitions. Second operand 8 states. [2019-09-08 12:24:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:13,292 INFO L93 Difference]: Finished difference Result 1648 states and 2220 transitions. [2019-09-08 12:24:13,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:24:13,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-09-08 12:24:13,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:13,299 INFO L225 Difference]: With dead ends: 1648 [2019-09-08 12:24:13,299 INFO L226 Difference]: Without dead ends: 1230 [2019-09-08 12:24:13,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:24:13,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-09-08 12:24:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 909. [2019-09-08 12:24:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1254 transitions. [2019-09-08 12:24:13,357 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1254 transitions. Word has length 94 [2019-09-08 12:24:13,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:13,358 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1254 transitions. [2019-09-08 12:24:13,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:24:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1254 transitions. [2019-09-08 12:24:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:24:13,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:13,361 INFO L399 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, 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, 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, 1, 1, 1] [2019-09-08 12:24:13,361 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:13,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:13,362 INFO L82 PathProgramCache]: Analyzing trace with hash 103072893, now seen corresponding path program 1 times [2019-09-08 12:24:13,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:13,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:13,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:13,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:13,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:13,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:13,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:13,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:13,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:13,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:13,578 INFO L87 Difference]: Start difference. First operand 909 states and 1254 transitions. Second operand 9 states. [2019-09-08 12:24:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:16,199 INFO L93 Difference]: Finished difference Result 1893 states and 2668 transitions. [2019-09-08 12:24:16,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:16,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:24:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:16,208 INFO L225 Difference]: With dead ends: 1893 [2019-09-08 12:24:16,208 INFO L226 Difference]: Without dead ends: 1703 [2019-09-08 12:24:16,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-08 12:24:16,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-08 12:24:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:16,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1252 transitions. [2019-09-08 12:24:16,273 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1252 transitions. Word has length 96 [2019-09-08 12:24:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:16,274 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1252 transitions. [2019-09-08 12:24:16,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1252 transitions. [2019-09-08 12:24:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:24:16,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:16,277 INFO L399 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, 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, 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, 1, 1, 1] [2019-09-08 12:24:16,277 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:16,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:16,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1545982347, now seen corresponding path program 1 times [2019-09-08 12:24:16,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:16,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:16,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:16,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:16,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:16,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:16,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:16,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:16,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:16,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:16,478 INFO L87 Difference]: Start difference. First operand 909 states and 1252 transitions. Second operand 9 states. [2019-09-08 12:24:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:18,754 INFO L93 Difference]: Finished difference Result 1974 states and 2784 transitions. [2019-09-08 12:24:18,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:18,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:24:18,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:18,765 INFO L225 Difference]: With dead ends: 1974 [2019-09-08 12:24:18,766 INFO L226 Difference]: Without dead ends: 1730 [2019-09-08 12:24:18,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:18,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2019-09-08 12:24:18,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 909. [2019-09-08 12:24:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1250 transitions. [2019-09-08 12:24:18,836 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1250 transitions. Word has length 96 [2019-09-08 12:24:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:18,836 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1250 transitions. [2019-09-08 12:24:18,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:18,837 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1250 transitions. [2019-09-08 12:24:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:24:18,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:18,839 INFO L399 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, 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, 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, 1, 1, 1] [2019-09-08 12:24:18,840 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:18,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1428928273, now seen corresponding path program 1 times [2019-09-08 12:24:18,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:18,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:18,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:18,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:19,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:19,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:19,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:19,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:19,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:19,075 INFO L87 Difference]: Start difference. First operand 909 states and 1250 transitions. Second operand 9 states. [2019-09-08 12:24:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:21,411 INFO L93 Difference]: Finished difference Result 1686 states and 2377 transitions. [2019-09-08 12:24:21,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:24:21,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:24:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:21,418 INFO L225 Difference]: With dead ends: 1686 [2019-09-08 12:24:21,418 INFO L226 Difference]: Without dead ends: 1286 [2019-09-08 12:24:21,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:24:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2019-09-08 12:24:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 909. [2019-09-08 12:24:21,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1248 transitions. [2019-09-08 12:24:21,483 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1248 transitions. Word has length 96 [2019-09-08 12:24:21,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:21,484 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1248 transitions. [2019-09-08 12:24:21,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:21,484 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1248 transitions. [2019-09-08 12:24:21,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:24:21,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:21,487 INFO L399 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, 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, 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, 1, 1, 1] [2019-09-08 12:24:21,487 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:21,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:21,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2085599014, now seen corresponding path program 1 times [2019-09-08 12:24:21,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:21,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:21,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:21,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:21,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:21,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:21,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:21,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:21,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:21,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:21,676 INFO L87 Difference]: Start difference. First operand 909 states and 1248 transitions. Second operand 9 states. [2019-09-08 12:24:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:24,393 INFO L93 Difference]: Finished difference Result 1874 states and 2635 transitions. [2019-09-08 12:24:24,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:24,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:24:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:24,401 INFO L225 Difference]: With dead ends: 1874 [2019-09-08 12:24:24,401 INFO L226 Difference]: Without dead ends: 1703 [2019-09-08 12:24:24,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-08 12:24:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-08 12:24:24,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1247 transitions. [2019-09-08 12:24:24,470 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1247 transitions. Word has length 96 [2019-09-08 12:24:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:24,470 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1247 transitions. [2019-09-08 12:24:24,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1247 transitions. [2019-09-08 12:24:24,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:24:24,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:24,473 INFO L399 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, 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, 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, 1, 1, 1] [2019-09-08 12:24:24,474 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:24,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:24,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1937383278, now seen corresponding path program 1 times [2019-09-08 12:24:24,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:24,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:24,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:24,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:24,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:24,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:24,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:24,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:24,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:24,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:24,662 INFO L87 Difference]: Start difference. First operand 909 states and 1247 transitions. Second operand 9 states. [2019-09-08 12:24:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:27,529 INFO L93 Difference]: Finished difference Result 1940 states and 2729 transitions. [2019-09-08 12:24:27,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:27,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:24:27,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:27,537 INFO L225 Difference]: With dead ends: 1940 [2019-09-08 12:24:27,537 INFO L226 Difference]: Without dead ends: 1730 [2019-09-08 12:24:27,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:27,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2019-09-08 12:24:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 909. [2019-09-08 12:24:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:27,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1246 transitions. [2019-09-08 12:24:27,608 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1246 transitions. Word has length 96 [2019-09-08 12:24:27,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:27,608 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1246 transitions. [2019-09-08 12:24:27,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1246 transitions. [2019-09-08 12:24:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:24:27,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:27,611 INFO L399 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, 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, 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, 1, 1, 1] [2019-09-08 12:24:27,612 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash -320032428, now seen corresponding path program 1 times [2019-09-08 12:24:27,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:27,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:27,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:27,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:27,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:27,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:27,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:27,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:27,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:27,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:27,855 INFO L87 Difference]: Start difference. First operand 909 states and 1246 transitions. Second operand 9 states. [2019-09-08 12:24:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:30,693 INFO L93 Difference]: Finished difference Result 1874 states and 2632 transitions. [2019-09-08 12:24:30,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:30,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:24:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:30,700 INFO L225 Difference]: With dead ends: 1874 [2019-09-08 12:24:30,701 INFO L226 Difference]: Without dead ends: 1703 [2019-09-08 12:24:30,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-08 12:24:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-08 12:24:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1245 transitions. [2019-09-08 12:24:30,767 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1245 transitions. Word has length 96 [2019-09-08 12:24:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:30,768 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1245 transitions. [2019-09-08 12:24:30,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1245 transitions. [2019-09-08 12:24:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:24:30,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:30,771 INFO L399 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, 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, 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, 1, 1, 1] [2019-09-08 12:24:30,772 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:30,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:30,773 INFO L82 PathProgramCache]: Analyzing trace with hash -891007590, now seen corresponding path program 1 times [2019-09-08 12:24:30,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:30,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:30,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:30,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:30,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:30,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:30,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:30,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:30,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:30,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:30,993 INFO L87 Difference]: Start difference. First operand 909 states and 1245 transitions. Second operand 9 states. [2019-09-08 12:24:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:33,797 INFO L93 Difference]: Finished difference Result 1869 states and 2626 transitions. [2019-09-08 12:24:33,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:33,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 12:24:33,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:33,804 INFO L225 Difference]: With dead ends: 1869 [2019-09-08 12:24:33,804 INFO L226 Difference]: Without dead ends: 1703 [2019-09-08 12:24:33,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-08 12:24:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-08 12:24:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1244 transitions. [2019-09-08 12:24:33,878 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1244 transitions. Word has length 96 [2019-09-08 12:24:33,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:33,878 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1244 transitions. [2019-09-08 12:24:33,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1244 transitions. [2019-09-08 12:24:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:24:33,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:33,881 INFO L399 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 12:24:33,882 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:33,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash -354416756, now seen corresponding path program 1 times [2019-09-08 12:24:33,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:33,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:33,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:33,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:33,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:34,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:34,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:34,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:34,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:34,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:34,105 INFO L87 Difference]: Start difference. First operand 909 states and 1244 transitions. Second operand 9 states. [2019-09-08 12:24:36,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:36,815 INFO L93 Difference]: Finished difference Result 1905 states and 2671 transitions. [2019-09-08 12:24:36,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:36,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:24:36,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:36,824 INFO L225 Difference]: With dead ends: 1905 [2019-09-08 12:24:36,824 INFO L226 Difference]: Without dead ends: 1703 [2019-09-08 12:24:36,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:36,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-08 12:24:36,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-08 12:24:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1242 transitions. [2019-09-08 12:24:36,886 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1242 transitions. Word has length 98 [2019-09-08 12:24:36,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:36,887 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1242 transitions. [2019-09-08 12:24:36,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1242 transitions. [2019-09-08 12:24:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:24:36,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:36,889 INFO L399 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 12:24:36,890 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:36,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:36,890 INFO L82 PathProgramCache]: Analyzing trace with hash 350263078, now seen corresponding path program 1 times [2019-09-08 12:24:36,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:36,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:36,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:36,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:36,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:37,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:37,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:37,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:37,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:37,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:37,088 INFO L87 Difference]: Start difference. First operand 909 states and 1242 transitions. Second operand 9 states. [2019-09-08 12:24:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:39,810 INFO L93 Difference]: Finished difference Result 1847 states and 2582 transitions. [2019-09-08 12:24:39,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:39,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:24:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:39,818 INFO L225 Difference]: With dead ends: 1847 [2019-09-08 12:24:39,819 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:24:39,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:39,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:24:39,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:24:39,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1240 transitions. [2019-09-08 12:24:39,898 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1240 transitions. Word has length 98 [2019-09-08 12:24:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:39,899 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1240 transitions. [2019-09-08 12:24:39,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1240 transitions. [2019-09-08 12:24:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:24:39,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:39,900 INFO L399 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 12:24:39,901 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:39,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:39,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1857278271, now seen corresponding path program 1 times [2019-09-08 12:24:39,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:39,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:39,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:39,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:39,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:40,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:40,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:40,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:40,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:40,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:40,085 INFO L87 Difference]: Start difference. First operand 909 states and 1240 transitions. Second operand 9 states. [2019-09-08 12:24:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:42,985 INFO L93 Difference]: Finished difference Result 2006 states and 2805 transitions. [2019-09-08 12:24:42,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:42,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:24:42,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:42,990 INFO L225 Difference]: With dead ends: 2006 [2019-09-08 12:24:42,991 INFO L226 Difference]: Without dead ends: 1730 [2019-09-08 12:24:42,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2019-09-08 12:24:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 909. [2019-09-08 12:24:43,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1238 transitions. [2019-09-08 12:24:43,054 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1238 transitions. Word has length 98 [2019-09-08 12:24:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:43,054 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1238 transitions. [2019-09-08 12:24:43,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1238 transitions. [2019-09-08 12:24:43,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:24:43,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:43,056 INFO L399 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 12:24:43,056 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:43,056 INFO L82 PathProgramCache]: Analyzing trace with hash 647290032, now seen corresponding path program 1 times [2019-09-08 12:24:43,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:43,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:43,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:43,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:43,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:43,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-09-08 12:24:43,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:43,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:43,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:43,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:43,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:43,243 INFO L87 Difference]: Start difference. First operand 909 states and 1238 transitions. Second operand 9 states. [2019-09-08 12:24:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:45,942 INFO L93 Difference]: Finished difference Result 1843 states and 2572 transitions. [2019-09-08 12:24:45,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:45,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:24:45,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:45,946 INFO L225 Difference]: With dead ends: 1843 [2019-09-08 12:24:45,946 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:24:45,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:24:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:24:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1236 transitions. [2019-09-08 12:24:46,037 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1236 transitions. Word has length 98 [2019-09-08 12:24:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:46,038 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1236 transitions. [2019-09-08 12:24:46,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1236 transitions. [2019-09-08 12:24:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:24:46,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:46,040 INFO L399 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 12:24:46,040 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:46,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:46,040 INFO L82 PathProgramCache]: Analyzing trace with hash -427429475, now seen corresponding path program 1 times [2019-09-08 12:24:46,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:46,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:46,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:46,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:46,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:46,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:46,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:46,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:46,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:46,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:46,226 INFO L87 Difference]: Start difference. First operand 909 states and 1236 transitions. Second operand 9 states. [2019-09-08 12:24:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:49,144 INFO L93 Difference]: Finished difference Result 1893 states and 2642 transitions. [2019-09-08 12:24:49,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:49,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:24:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:49,149 INFO L225 Difference]: With dead ends: 1893 [2019-09-08 12:24:49,149 INFO L226 Difference]: Without dead ends: 1703 [2019-09-08 12:24:49,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:49,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-08 12:24:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-08 12:24:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1234 transitions. [2019-09-08 12:24:49,231 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1234 transitions. Word has length 98 [2019-09-08 12:24:49,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:49,231 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1234 transitions. [2019-09-08 12:24:49,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1234 transitions. [2019-09-08 12:24:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:24:49,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:49,234 INFO L399 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 12:24:49,234 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:49,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:49,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1254444936, now seen corresponding path program 1 times [2019-09-08 12:24:49,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:49,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:49,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:49,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:49,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:49,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:49,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:49,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:49,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:49,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:49,435 INFO L87 Difference]: Start difference. First operand 909 states and 1234 transitions. Second operand 9 states. [2019-09-08 12:24:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:52,233 INFO L93 Difference]: Finished difference Result 1843 states and 2568 transitions. [2019-09-08 12:24:52,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:52,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:24:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:52,239 INFO L225 Difference]: With dead ends: 1843 [2019-09-08 12:24:52,240 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:24:52,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:52,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:24:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:24:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1232 transitions. [2019-09-08 12:24:52,306 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1232 transitions. Word has length 98 [2019-09-08 12:24:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:52,306 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1232 transitions. [2019-09-08 12:24:52,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1232 transitions. [2019-09-08 12:24:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:24:52,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:52,308 INFO L399 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 12:24:52,308 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:52,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:52,309 INFO L82 PathProgramCache]: Analyzing trace with hash 398268857, now seen corresponding path program 1 times [2019-09-08 12:24:52,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:52,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:52,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:52,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:52,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:52,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:52,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:52,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:52,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:52,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:52,479 INFO L87 Difference]: Start difference. First operand 909 states and 1232 transitions. Second operand 9 states. [2019-09-08 12:24:55,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:55,175 INFO L93 Difference]: Finished difference Result 1841 states and 2563 transitions. [2019-09-08 12:24:55,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:55,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:24:55,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:55,179 INFO L225 Difference]: With dead ends: 1841 [2019-09-08 12:24:55,180 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:24:55,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:55,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:24:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:24:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1230 transitions. [2019-09-08 12:24:55,297 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1230 transitions. Word has length 98 [2019-09-08 12:24:55,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:55,297 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1230 transitions. [2019-09-08 12:24:55,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1230 transitions. [2019-09-08 12:24:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:24:55,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:55,299 INFO L399 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 12:24:55,300 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:55,300 INFO L82 PathProgramCache]: Analyzing trace with hash -285032083, now seen corresponding path program 1 times [2019-09-08 12:24:55,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:55,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:55,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:55,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:55,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:55,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:55,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:55,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:55,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:55,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:55,501 INFO L87 Difference]: Start difference. First operand 909 states and 1230 transitions. Second operand 9 states. [2019-09-08 12:24:58,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:58,245 INFO L93 Difference]: Finished difference Result 1837 states and 2554 transitions. [2019-09-08 12:24:58,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:24:58,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:24:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:58,254 INFO L225 Difference]: With dead ends: 1837 [2019-09-08 12:24:58,254 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:24:58,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:24:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:24:58,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:24:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:24:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1229 transitions. [2019-09-08 12:24:58,371 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1229 transitions. Word has length 98 [2019-09-08 12:24:58,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:58,373 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1229 transitions. [2019-09-08 12:24:58,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:24:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1229 transitions. [2019-09-08 12:24:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:24:58,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:58,376 INFO L399 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 12:24:58,377 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:58,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:58,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1992031926, now seen corresponding path program 1 times [2019-09-08 12:24:58,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:58,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:58,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:58,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:58,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:58,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:58,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:24:58,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:24:58,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:24:58,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:24:58,603 INFO L87 Difference]: Start difference. First operand 909 states and 1229 transitions. Second operand 9 states. [2019-09-08 12:25:01,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:01,617 INFO L93 Difference]: Finished difference Result 1883 states and 2618 transitions. [2019-09-08 12:25:01,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:01,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:25:01,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:01,624 INFO L225 Difference]: With dead ends: 1883 [2019-09-08 12:25:01,625 INFO L226 Difference]: Without dead ends: 1703 [2019-09-08 12:25:01,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-08 12:25:01,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-08 12:25:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1228 transitions. [2019-09-08 12:25:01,753 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1228 transitions. Word has length 98 [2019-09-08 12:25:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:01,754 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1228 transitions. [2019-09-08 12:25:01,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1228 transitions. [2019-09-08 12:25:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:25:01,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:01,756 INFO L399 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 12:25:01,756 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:01,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:01,756 INFO L82 PathProgramCache]: Analyzing trace with hash 310929269, now seen corresponding path program 1 times [2019-09-08 12:25:01,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:01,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:01,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:01,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:01,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:01,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:01,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:01,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:01,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:01,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:01,964 INFO L87 Difference]: Start difference. First operand 909 states and 1228 transitions. Second operand 9 states. [2019-09-08 12:25:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:04,868 INFO L93 Difference]: Finished difference Result 1837 states and 2552 transitions. [2019-09-08 12:25:04,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:04,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:25:04,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:04,873 INFO L225 Difference]: With dead ends: 1837 [2019-09-08 12:25:04,873 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:25:04,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:25:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:25:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1227 transitions. [2019-09-08 12:25:04,985 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1227 transitions. Word has length 98 [2019-09-08 12:25:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:04,985 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1227 transitions. [2019-09-08 12:25:04,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1227 transitions. [2019-09-08 12:25:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:25:04,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:04,988 INFO L399 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 12:25:04,988 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:04,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:04,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1777266353, now seen corresponding path program 1 times [2019-09-08 12:25:04,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:04,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:04,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:04,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:04,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:05,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:05,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:05,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:05,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:05,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:05,179 INFO L87 Difference]: Start difference. First operand 909 states and 1227 transitions. Second operand 9 states. [2019-09-08 12:25:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:07,875 INFO L93 Difference]: Finished difference Result 1833 states and 2546 transitions. [2019-09-08 12:25:07,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:07,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:25:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:07,878 INFO L225 Difference]: With dead ends: 1833 [2019-09-08 12:25:07,878 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:25:07,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:25:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:25:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:08,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1226 transitions. [2019-09-08 12:25:08,006 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1226 transitions. Word has length 98 [2019-09-08 12:25:08,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:08,007 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1226 transitions. [2019-09-08 12:25:08,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1226 transitions. [2019-09-08 12:25:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:25:08,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:08,009 INFO L399 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 12:25:08,009 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:08,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:08,010 INFO L82 PathProgramCache]: Analyzing trace with hash 2141043087, now seen corresponding path program 1 times [2019-09-08 12:25:08,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:08,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:08,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:08,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:08,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:08,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:08,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:08,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:08,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:08,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:08,201 INFO L87 Difference]: Start difference. First operand 909 states and 1226 transitions. Second operand 9 states. [2019-09-08 12:25:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:10,689 INFO L93 Difference]: Finished difference Result 1837 states and 2548 transitions. [2019-09-08 12:25:10,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:10,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:25:10,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:10,692 INFO L225 Difference]: With dead ends: 1837 [2019-09-08 12:25:10,692 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:25:10,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:10,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:25:10,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:25:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:10,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1225 transitions. [2019-09-08 12:25:10,808 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1225 transitions. Word has length 98 [2019-09-08 12:25:10,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:10,808 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1225 transitions. [2019-09-08 12:25:10,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:10,808 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1225 transitions. [2019-09-08 12:25:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:25:10,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:10,810 INFO L399 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 12:25:10,810 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:10,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:10,811 INFO L82 PathProgramCache]: Analyzing trace with hash 600616519, now seen corresponding path program 1 times [2019-09-08 12:25:10,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:10,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:10,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:10,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:10,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:10,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:10,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:10,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:10,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:10,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:10,995 INFO L87 Difference]: Start difference. First operand 909 states and 1225 transitions. Second operand 9 states. [2019-09-08 12:25:13,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:13,928 INFO L93 Difference]: Finished difference Result 1833 states and 2543 transitions. [2019-09-08 12:25:13,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:13,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:25:13,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:13,930 INFO L225 Difference]: With dead ends: 1833 [2019-09-08 12:25:13,930 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:25:13,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:13,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:25:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:25:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1224 transitions. [2019-09-08 12:25:14,047 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1224 transitions. Word has length 98 [2019-09-08 12:25:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:14,047 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1224 transitions. [2019-09-08 12:25:14,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1224 transitions. [2019-09-08 12:25:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 12:25:14,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:14,048 INFO L399 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-08 12:25:14,049 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:14,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash 513414431, now seen corresponding path program 1 times [2019-09-08 12:25:14,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:14,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:14,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:14,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:14,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:14,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:14,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:14,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:14,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:14,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:14,219 INFO L87 Difference]: Start difference. First operand 909 states and 1224 transitions. Second operand 9 states. [2019-09-08 12:25:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:17,026 INFO L93 Difference]: Finished difference Result 1833 states and 2542 transitions. [2019-09-08 12:25:17,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:17,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-08 12:25:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:17,029 INFO L225 Difference]: With dead ends: 1833 [2019-09-08 12:25:17,029 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:25:17,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:17,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:25:17,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:25:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1223 transitions. [2019-09-08 12:25:17,126 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1223 transitions. Word has length 98 [2019-09-08 12:25:17,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:17,126 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1223 transitions. [2019-09-08 12:25:17,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:17,126 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1223 transitions. [2019-09-08 12:25:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:25:17,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:17,128 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:17,129 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:17,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:17,129 INFO L82 PathProgramCache]: Analyzing trace with hash 309455156, now seen corresponding path program 1 times [2019-09-08 12:25:17,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:17,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:17,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:17,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:17,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:17,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:17,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:17,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:17,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:17,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:17,317 INFO L87 Difference]: Start difference. First operand 909 states and 1223 transitions. Second operand 9 states. [2019-09-08 12:25:19,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:19,766 INFO L93 Difference]: Finished difference Result 1832 states and 2539 transitions. [2019-09-08 12:25:19,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:19,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:25:19,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:19,769 INFO L225 Difference]: With dead ends: 1832 [2019-09-08 12:25:19,769 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:25:19,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:19,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:25:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:25:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1222 transitions. [2019-09-08 12:25:19,850 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1222 transitions. Word has length 99 [2019-09-08 12:25:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:19,850 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1222 transitions. [2019-09-08 12:25:19,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1222 transitions. [2019-09-08 12:25:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:25:19,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:19,852 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:19,852 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:19,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:19,852 INFO L82 PathProgramCache]: Analyzing trace with hash 291193798, now seen corresponding path program 1 times [2019-09-08 12:25:19,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:19,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:19,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:19,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:19,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:20,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:20,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:20,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:20,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:20,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:20,046 INFO L87 Difference]: Start difference. First operand 909 states and 1222 transitions. Second operand 9 states. [2019-09-08 12:25:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:22,820 INFO L93 Difference]: Finished difference Result 1913 states and 2647 transitions. [2019-09-08 12:25:22,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:22,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:25:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:22,822 INFO L225 Difference]: With dead ends: 1913 [2019-09-08 12:25:22,822 INFO L226 Difference]: Without dead ends: 1703 [2019-09-08 12:25:22,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:22,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-09-08 12:25:22,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 909. [2019-09-08 12:25:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1220 transitions. [2019-09-08 12:25:22,906 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1220 transitions. Word has length 100 [2019-09-08 12:25:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:22,906 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1220 transitions. [2019-09-08 12:25:22,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1220 transitions. [2019-09-08 12:25:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:25:22,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:22,909 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:22,909 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:22,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:22,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1700395306, now seen corresponding path program 1 times [2019-09-08 12:25:22,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:22,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:22,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:22,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:23,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:23,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:23,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:23,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:23,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:23,094 INFO L87 Difference]: Start difference. First operand 909 states and 1220 transitions. Second operand 9 states. [2019-09-08 12:25:25,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:25,850 INFO L93 Difference]: Finished difference Result 1785 states and 2456 transitions. [2019-09-08 12:25:25,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:25,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:25:25,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:25,853 INFO L225 Difference]: With dead ends: 1785 [2019-09-08 12:25:25,853 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:25:25,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:25:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:25:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1218 transitions. [2019-09-08 12:25:25,937 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1218 transitions. Word has length 100 [2019-09-08 12:25:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:25,937 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1218 transitions. [2019-09-08 12:25:25,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1218 transitions. [2019-09-08 12:25:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:25:25,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:25,939 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:25,939 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:25,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:25,940 INFO L82 PathProgramCache]: Analyzing trace with hash -10584466, now seen corresponding path program 1 times [2019-09-08 12:25:25,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:25,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:25,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:25,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:25,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:26,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:26,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:26,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:26,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:26,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:26,124 INFO L87 Difference]: Start difference. First operand 909 states and 1218 transitions. Second operand 9 states. [2019-09-08 12:25:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:28,869 INFO L93 Difference]: Finished difference Result 1849 states and 2554 transitions. [2019-09-08 12:25:28,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:28,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:25:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:28,871 INFO L225 Difference]: With dead ends: 1849 [2019-09-08 12:25:28,871 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:25:28,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:25:28,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:25:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1216 transitions. [2019-09-08 12:25:28,955 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1216 transitions. Word has length 100 [2019-09-08 12:25:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:28,956 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1216 transitions. [2019-09-08 12:25:28,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1216 transitions. [2019-09-08 12:25:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:25:28,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:28,958 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:28,958 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:28,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:28,959 INFO L82 PathProgramCache]: Analyzing trace with hash -906258735, now seen corresponding path program 1 times [2019-09-08 12:25:28,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:28,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:28,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:29,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:29,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:29,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:29,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:29,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:29,113 INFO L87 Difference]: Start difference. First operand 909 states and 1216 transitions. Second operand 9 states. [2019-09-08 12:25:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:31,612 INFO L93 Difference]: Finished difference Result 1849 states and 2552 transitions. [2019-09-08 12:25:31,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:31,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:25:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:31,614 INFO L225 Difference]: With dead ends: 1849 [2019-09-08 12:25:31,614 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:25:31,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:25:31,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:25:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1214 transitions. [2019-09-08 12:25:31,702 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1214 transitions. Word has length 100 [2019-09-08 12:25:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:31,702 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1214 transitions. [2019-09-08 12:25:31,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:31,703 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1214 transitions. [2019-09-08 12:25:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:25:31,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:31,704 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:31,704 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:31,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:31,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1698897721, now seen corresponding path program 1 times [2019-09-08 12:25:31,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:31,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:31,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:31,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:31,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:31,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:31,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:31,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:31,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:31,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:31,885 INFO L87 Difference]: Start difference. First operand 909 states and 1214 transitions. Second operand 9 states. [2019-09-08 12:25:34,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:34,523 INFO L93 Difference]: Finished difference Result 1785 states and 2450 transitions. [2019-09-08 12:25:34,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:34,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:25:34,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:34,526 INFO L225 Difference]: With dead ends: 1785 [2019-09-08 12:25:34,526 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:25:34,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:25:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:25:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1212 transitions. [2019-09-08 12:25:34,617 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1212 transitions. Word has length 100 [2019-09-08 12:25:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:34,617 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1212 transitions. [2019-09-08 12:25:34,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1212 transitions. [2019-09-08 12:25:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:25:34,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:34,618 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:34,619 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:34,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:34,619 INFO L82 PathProgramCache]: Analyzing trace with hash -483952406, now seen corresponding path program 1 times [2019-09-08 12:25:34,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:34,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:34,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:34,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:34,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:34,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:34,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:34,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:34,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:34,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:34,781 INFO L87 Difference]: Start difference. First operand 909 states and 1212 transitions. Second operand 9 states. [2019-09-08 12:25:37,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:37,596 INFO L93 Difference]: Finished difference Result 1781 states and 2443 transitions. [2019-09-08 12:25:37,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:37,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:25:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:37,599 INFO L225 Difference]: With dead ends: 1781 [2019-09-08 12:25:37,599 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:25:37,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:25:37,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:25:37,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:37,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1210 transitions. [2019-09-08 12:25:37,702 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1210 transitions. Word has length 100 [2019-09-08 12:25:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:37,703 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1210 transitions. [2019-09-08 12:25:37,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1210 transitions. [2019-09-08 12:25:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:25:37,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:37,705 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:37,705 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash -18890581, now seen corresponding path program 1 times [2019-09-08 12:25:37,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:37,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:37,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:37,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:37,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:37,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:37,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:37,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:37,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:37,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:37,873 INFO L87 Difference]: Start difference. First operand 909 states and 1210 transitions. Second operand 9 states. [2019-09-08 12:25:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:40,664 INFO L93 Difference]: Finished difference Result 1785 states and 2446 transitions. [2019-09-08 12:25:40,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:40,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:25:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:40,667 INFO L225 Difference]: With dead ends: 1785 [2019-09-08 12:25:40,667 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:25:40,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:25:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:25:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1208 transitions. [2019-09-08 12:25:40,758 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1208 transitions. Word has length 100 [2019-09-08 12:25:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:40,758 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1208 transitions. [2019-09-08 12:25:40,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1208 transitions. [2019-09-08 12:25:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:25:40,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:40,760 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:40,760 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:40,760 INFO L82 PathProgramCache]: Analyzing trace with hash 827980610, now seen corresponding path program 1 times [2019-09-08 12:25:40,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:40,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:40,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:40,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:40,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:40,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:40,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:40,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:40,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:40,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:40,945 INFO L87 Difference]: Start difference. First operand 909 states and 1208 transitions. Second operand 9 states. [2019-09-08 12:25:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:43,654 INFO L93 Difference]: Finished difference Result 1636 states and 2217 transitions. [2019-09-08 12:25:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:43,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:25:43,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:43,658 INFO L225 Difference]: With dead ends: 1636 [2019-09-08 12:25:43,658 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:25:43,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:43,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:25:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:25:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1206 transitions. [2019-09-08 12:25:43,753 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1206 transitions. Word has length 100 [2019-09-08 12:25:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:43,753 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1206 transitions. [2019-09-08 12:25:43,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1206 transitions. [2019-09-08 12:25:43,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:25:43,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:43,755 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:43,755 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:43,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:43,756 INFO L82 PathProgramCache]: Analyzing trace with hash -142106022, now seen corresponding path program 1 times [2019-09-08 12:25:43,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:43,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:43,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:43,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:43,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:43,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:43,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:43,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:43,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:43,928 INFO L87 Difference]: Start difference. First operand 909 states and 1206 transitions. Second operand 9 states. [2019-09-08 12:25:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:46,813 INFO L93 Difference]: Finished difference Result 1696 states and 2304 transitions. [2019-09-08 12:25:46,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:46,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:25:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:46,815 INFO L225 Difference]: With dead ends: 1696 [2019-09-08 12:25:46,815 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:25:46,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:46,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:25:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:25:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1204 transitions. [2019-09-08 12:25:46,918 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1204 transitions. Word has length 100 [2019-09-08 12:25:46,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:46,918 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1204 transitions. [2019-09-08 12:25:46,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:46,918 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1204 transitions. [2019-09-08 12:25:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:25:46,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:46,920 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:46,920 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:46,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:46,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2085388437, now seen corresponding path program 1 times [2019-09-08 12:25:46,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:46,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:46,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:46,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:46,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:47,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:47,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:47,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:47,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:47,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:47,118 INFO L87 Difference]: Start difference. First operand 909 states and 1204 transitions. Second operand 9 states. [2019-09-08 12:25:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:50,574 INFO L93 Difference]: Finished difference Result 1636 states and 2213 transitions. [2019-09-08 12:25:50,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:50,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:25:50,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:50,577 INFO L225 Difference]: With dead ends: 1636 [2019-09-08 12:25:50,577 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:25:50,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:50,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:25:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:25:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1202 transitions. [2019-09-08 12:25:50,674 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1202 transitions. Word has length 100 [2019-09-08 12:25:50,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:50,674 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1202 transitions. [2019-09-08 12:25:50,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1202 transitions. [2019-09-08 12:25:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:25:50,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:50,676 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:50,676 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:50,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:50,676 INFO L82 PathProgramCache]: Analyzing trace with hash -209751473, now seen corresponding path program 1 times [2019-09-08 12:25:50,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:50,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:50,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:50,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:50,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:50,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:50,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:50,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:50,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:50,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:50,817 INFO L87 Difference]: Start difference. First operand 909 states and 1202 transitions. Second operand 9 states. [2019-09-08 12:25:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:53,233 INFO L93 Difference]: Finished difference Result 1781 states and 2429 transitions. [2019-09-08 12:25:53,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:53,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:25:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:53,236 INFO L225 Difference]: With dead ends: 1781 [2019-09-08 12:25:53,236 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:25:53,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:25:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:25:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1200 transitions. [2019-09-08 12:25:53,335 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1200 transitions. Word has length 100 [2019-09-08 12:25:53,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:53,335 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1200 transitions. [2019-09-08 12:25:53,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1200 transitions. [2019-09-08 12:25:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:25:53,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:53,337 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:53,337 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:53,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash -120851267, now seen corresponding path program 1 times [2019-09-08 12:25:53,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:53,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:53,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:53,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:53,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:53,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:53,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:53,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:53,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:53,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:53,493 INFO L87 Difference]: Start difference. First operand 909 states and 1200 transitions. Second operand 9 states. [2019-09-08 12:25:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:56,328 INFO L93 Difference]: Finished difference Result 1636 states and 2207 transitions. [2019-09-08 12:25:56,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:56,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:25:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:56,330 INFO L225 Difference]: With dead ends: 1636 [2019-09-08 12:25:56,330 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:25:56,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:25:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:25:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1198 transitions. [2019-09-08 12:25:56,431 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1198 transitions. Word has length 100 [2019-09-08 12:25:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:56,431 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1198 transitions. [2019-09-08 12:25:56,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1198 transitions. [2019-09-08 12:25:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:25:56,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:56,434 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:56,434 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:56,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1880101188, now seen corresponding path program 1 times [2019-09-08 12:25:56,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:56,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:56,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:56,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:56,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:56,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:56,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:56,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:56,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:56,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:56,595 INFO L87 Difference]: Start difference. First operand 909 states and 1198 transitions. Second operand 9 states. [2019-09-08 12:25:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:59,455 INFO L93 Difference]: Finished difference Result 1781 states and 2423 transitions. [2019-09-08 12:25:59,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:25:59,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:25:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:59,457 INFO L225 Difference]: With dead ends: 1781 [2019-09-08 12:25:59,457 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:25:59,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:25:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:25:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:25:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:25:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1196 transitions. [2019-09-08 12:25:59,560 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1196 transitions. Word has length 100 [2019-09-08 12:25:59,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:59,561 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1196 transitions. [2019-09-08 12:25:59,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:25:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1196 transitions. [2019-09-08 12:25:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:25:59,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:59,562 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:25:59,562 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:59,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1432903500, now seen corresponding path program 1 times [2019-09-08 12:25:59,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:59,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:59,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:59,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:59,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:25:59,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:59,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:25:59,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:25:59,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:25:59,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:25:59,717 INFO L87 Difference]: Start difference. First operand 909 states and 1196 transitions. Second operand 9 states. [2019-09-08 12:26:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:02,510 INFO L93 Difference]: Finished difference Result 1781 states and 2421 transitions. [2019-09-08 12:26:02,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:02,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:26:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:02,513 INFO L225 Difference]: With dead ends: 1781 [2019-09-08 12:26:02,513 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:26:02,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:02,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:26:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:26:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:26:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1194 transitions. [2019-09-08 12:26:02,648 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1194 transitions. Word has length 100 [2019-09-08 12:26:02,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:02,648 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1194 transitions. [2019-09-08 12:26:02,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1194 transitions. [2019-09-08 12:26:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:26:02,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:02,649 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:02,650 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:02,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:02,650 INFO L82 PathProgramCache]: Analyzing trace with hash 53028367, now seen corresponding path program 1 times [2019-09-08 12:26:02,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:02,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:02,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:02,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:02,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:02,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:02,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:02,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:02,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:02,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:02,809 INFO L87 Difference]: Start difference. First operand 909 states and 1194 transitions. Second operand 9 states. [2019-09-08 12:26:05,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:05,534 INFO L93 Difference]: Finished difference Result 1782 states and 2418 transitions. [2019-09-08 12:26:05,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:05,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:26:05,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:05,536 INFO L225 Difference]: With dead ends: 1782 [2019-09-08 12:26:05,536 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:26:05,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:26:05,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:26:05,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:26:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1193 transitions. [2019-09-08 12:26:05,645 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1193 transitions. Word has length 100 [2019-09-08 12:26:05,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:05,645 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1193 transitions. [2019-09-08 12:26:05,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1193 transitions. [2019-09-08 12:26:05,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:26:05,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:05,646 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:05,646 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:05,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:05,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1991382183, now seen corresponding path program 1 times [2019-09-08 12:26:05,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:05,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:05,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:05,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:05,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:05,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:05,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:05,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:05,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:05,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:05,806 INFO L87 Difference]: Start difference. First operand 909 states and 1193 transitions. Second operand 9 states. [2019-09-08 12:26:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:08,675 INFO L93 Difference]: Finished difference Result 1842 states and 2505 transitions. [2019-09-08 12:26:08,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:08,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:26:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:08,677 INFO L225 Difference]: With dead ends: 1842 [2019-09-08 12:26:08,678 INFO L226 Difference]: Without dead ends: 1679 [2019-09-08 12:26:08,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:08,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2019-09-08 12:26:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 909. [2019-09-08 12:26:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:26:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1192 transitions. [2019-09-08 12:26:08,786 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1192 transitions. Word has length 100 [2019-09-08 12:26:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:08,786 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1192 transitions. [2019-09-08 12:26:08,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1192 transitions. [2019-09-08 12:26:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:26:08,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:08,788 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:08,788 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:08,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:08,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1942716530, now seen corresponding path program 1 times [2019-09-08 12:26:08,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:08,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:08,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:08,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:08,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:08,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:08,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:08,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:08,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:08,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:08,939 INFO L87 Difference]: Start difference. First operand 909 states and 1192 transitions. Second operand 9 states. [2019-09-08 12:26:11,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:11,940 INFO L93 Difference]: Finished difference Result 1782 states and 2416 transitions. [2019-09-08 12:26:11,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:11,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:26:11,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:11,942 INFO L225 Difference]: With dead ends: 1782 [2019-09-08 12:26:11,942 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:26:11,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:26:12,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:26:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:26:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1191 transitions. [2019-09-08 12:26:12,056 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1191 transitions. Word has length 100 [2019-09-08 12:26:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:12,056 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1191 transitions. [2019-09-08 12:26:12,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1191 transitions. [2019-09-08 12:26:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:26:12,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:12,058 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:12,058 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash -899406943, now seen corresponding path program 1 times [2019-09-08 12:26:12,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:12,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:12,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:12,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:12,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:12,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:12,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:12,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:12,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:12,260 INFO L87 Difference]: Start difference. First operand 909 states and 1191 transitions. Second operand 9 states. [2019-09-08 12:26:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:15,062 INFO L93 Difference]: Finished difference Result 1779 states and 2411 transitions. [2019-09-08 12:26:15,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:15,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:26:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:15,064 INFO L225 Difference]: With dead ends: 1779 [2019-09-08 12:26:15,064 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:26:15,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:26:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:26:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:26:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1190 transitions. [2019-09-08 12:26:15,197 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1190 transitions. Word has length 100 [2019-09-08 12:26:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:15,197 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1190 transitions. [2019-09-08 12:26:15,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1190 transitions. [2019-09-08 12:26:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:26:15,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:15,199 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:15,199 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:15,199 INFO L82 PathProgramCache]: Analyzing trace with hash 410796862, now seen corresponding path program 1 times [2019-09-08 12:26:15,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:15,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:15,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:15,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:15,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:15,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:15,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:15,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:15,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:15,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:15,372 INFO L87 Difference]: Start difference. First operand 909 states and 1190 transitions. Second operand 9 states. [2019-09-08 12:26:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:17,843 INFO L93 Difference]: Finished difference Result 1779 states and 2410 transitions. [2019-09-08 12:26:17,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:17,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:26:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:17,845 INFO L225 Difference]: With dead ends: 1779 [2019-09-08 12:26:17,845 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:26:17,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:26:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:26:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:26:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1189 transitions. [2019-09-08 12:26:17,962 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1189 transitions. Word has length 100 [2019-09-08 12:26:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:17,963 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1189 transitions. [2019-09-08 12:26:17,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1189 transitions. [2019-09-08 12:26:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:26:17,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:17,965 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:17,965 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:17,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:17,965 INFO L82 PathProgramCache]: Analyzing trace with hash -279511526, now seen corresponding path program 1 times [2019-09-08 12:26:17,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:17,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:17,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:17,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:17,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:18,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:18,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:18,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:18,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:18,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:18,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:18,122 INFO L87 Difference]: Start difference. First operand 909 states and 1189 transitions. Second operand 9 states. [2019-09-08 12:26:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:21,018 INFO L93 Difference]: Finished difference Result 1782 states and 2412 transitions. [2019-09-08 12:26:21,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:21,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:26:21,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:21,021 INFO L225 Difference]: With dead ends: 1782 [2019-09-08 12:26:21,021 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:26:21,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:26:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:26:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:26:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1188 transitions. [2019-09-08 12:26:21,146 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1188 transitions. Word has length 100 [2019-09-08 12:26:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:21,146 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1188 transitions. [2019-09-08 12:26:21,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1188 transitions. [2019-09-08 12:26:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:26:21,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:21,148 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:21,148 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:21,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:21,148 INFO L82 PathProgramCache]: Analyzing trace with hash -188121012, now seen corresponding path program 1 times [2019-09-08 12:26:21,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:21,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:21,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:21,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:21,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:21,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:21,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:21,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:21,291 INFO L87 Difference]: Start difference. First operand 909 states and 1188 transitions. Second operand 9 states. [2019-09-08 12:26:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:23,777 INFO L93 Difference]: Finished difference Result 1779 states and 2407 transitions. [2019-09-08 12:26:23,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:23,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:26:23,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:23,780 INFO L225 Difference]: With dead ends: 1779 [2019-09-08 12:26:23,780 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:26:23,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:26:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:26:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:26:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1187 transitions. [2019-09-08 12:26:23,923 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1187 transitions. Word has length 100 [2019-09-08 12:26:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:23,924 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1187 transitions. [2019-09-08 12:26:23,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1187 transitions. [2019-09-08 12:26:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:26:23,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:23,925 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:23,926 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:23,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:23,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1783081460, now seen corresponding path program 1 times [2019-09-08 12:26:23,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:23,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:23,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:23,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:23,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:24,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:24,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:24,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:24,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:24,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:24,073 INFO L87 Difference]: Start difference. First operand 909 states and 1187 transitions. Second operand 9 states. [2019-09-08 12:26:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:26,896 INFO L93 Difference]: Finished difference Result 1636 states and 2187 transitions. [2019-09-08 12:26:26,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:26,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:26:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:26,898 INFO L225 Difference]: With dead ends: 1636 [2019-09-08 12:26:26,898 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:26:26,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:26:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:26:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:26:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1186 transitions. [2019-09-08 12:26:27,041 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1186 transitions. Word has length 100 [2019-09-08 12:26:27,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:27,041 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1186 transitions. [2019-09-08 12:26:27,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1186 transitions. [2019-09-08 12:26:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:26:27,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:27,043 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:27,043 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:27,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:27,043 INFO L82 PathProgramCache]: Analyzing trace with hash -902270955, now seen corresponding path program 1 times [2019-09-08 12:26:27,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:27,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:27,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:27,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:27,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:27,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:27,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:27,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:27,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:27,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:27,215 INFO L87 Difference]: Start difference. First operand 909 states and 1186 transitions. Second operand 9 states. [2019-09-08 12:26:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:29,739 INFO L93 Difference]: Finished difference Result 1779 states and 2403 transitions. [2019-09-08 12:26:29,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:29,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:26:29,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:29,742 INFO L225 Difference]: With dead ends: 1779 [2019-09-08 12:26:29,742 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:26:29,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:26:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:26:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:26:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1185 transitions. [2019-09-08 12:26:29,871 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1185 transitions. Word has length 100 [2019-09-08 12:26:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:29,872 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1185 transitions. [2019-09-08 12:26:29,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1185 transitions. [2019-09-08 12:26:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:26:29,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:29,873 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:29,874 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:29,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:29,874 INFO L82 PathProgramCache]: Analyzing trace with hash 535576962, now seen corresponding path program 1 times [2019-09-08 12:26:29,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:29,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:29,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:29,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:29,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:30,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:30,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:30,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:30,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:30,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:30,011 INFO L87 Difference]: Start difference. First operand 909 states and 1185 transitions. Second operand 9 states. [2019-09-08 12:26:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:32,933 INFO L93 Difference]: Finished difference Result 1779 states and 2402 transitions. [2019-09-08 12:26:32,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:32,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:26:32,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:32,936 INFO L225 Difference]: With dead ends: 1779 [2019-09-08 12:26:32,936 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:26:32,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:32,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:26:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:26:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:26:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1184 transitions. [2019-09-08 12:26:33,060 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1184 transitions. Word has length 100 [2019-09-08 12:26:33,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:33,060 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1184 transitions. [2019-09-08 12:26:33,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1184 transitions. [2019-09-08 12:26:33,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:26:33,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:33,061 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:33,062 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:33,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:33,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1553613818, now seen corresponding path program 1 times [2019-09-08 12:26:33,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:33,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:33,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:33,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:33,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:33,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:33,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:33,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:33,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:33,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:33,188 INFO L87 Difference]: Start difference. First operand 909 states and 1184 transitions. Second operand 9 states. [2019-09-08 12:26:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:35,712 INFO L93 Difference]: Finished difference Result 1779 states and 2400 transitions. [2019-09-08 12:26:35,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:35,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:26:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:35,714 INFO L225 Difference]: With dead ends: 1779 [2019-09-08 12:26:35,714 INFO L226 Difference]: Without dead ends: 1631 [2019-09-08 12:26:35,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-08 12:26:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 909. [2019-09-08 12:26:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-08 12:26:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1183 transitions. [2019-09-08 12:26:35,839 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1183 transitions. Word has length 100 [2019-09-08 12:26:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:35,840 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1183 transitions. [2019-09-08 12:26:35,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1183 transitions. [2019-09-08 12:26:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:26:35,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:35,842 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:35,842 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:35,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:35,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1511064327, now seen corresponding path program 1 times [2019-09-08 12:26:35,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:35,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:35,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:35,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:35,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:35,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:35,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:35,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:35,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:35,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:35,973 INFO L87 Difference]: Start difference. First operand 909 states and 1183 transitions. Second operand 9 states. [2019-09-08 12:26:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:38,677 INFO L93 Difference]: Finished difference Result 1777 states and 2396 transitions. [2019-09-08 12:26:38,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:38,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:26:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:38,679 INFO L225 Difference]: With dead ends: 1777 [2019-09-08 12:26:38,680 INFO L226 Difference]: Without dead ends: 1629 [2019-09-08 12:26:38,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-09-08 12:26:38,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 907. [2019-09-08 12:26:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-09-08 12:26:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1179 transitions. [2019-09-08 12:26:38,814 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1179 transitions. Word has length 101 [2019-09-08 12:26:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:38,814 INFO L475 AbstractCegarLoop]: Abstraction has 907 states and 1179 transitions. [2019-09-08 12:26:38,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1179 transitions. [2019-09-08 12:26:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:26:38,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:38,815 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:38,815 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:38,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2123623915, now seen corresponding path program 1 times [2019-09-08 12:26:38,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:38,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:38,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:38,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:38,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:38,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:38,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:38,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:38,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:38,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:38,958 INFO L87 Difference]: Start difference. First operand 907 states and 1179 transitions. Second operand 9 states. [2019-09-08 12:26:41,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:41,677 INFO L93 Difference]: Finished difference Result 1775 states and 2392 transitions. [2019-09-08 12:26:41,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:41,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:26:41,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:41,679 INFO L225 Difference]: With dead ends: 1775 [2019-09-08 12:26:41,679 INFO L226 Difference]: Without dead ends: 1629 [2019-09-08 12:26:41,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2019-09-08 12:26:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 907. [2019-09-08 12:26:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-09-08 12:26:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1178 transitions. [2019-09-08 12:26:41,808 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1178 transitions. Word has length 101 [2019-09-08 12:26:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:41,809 INFO L475 AbstractCegarLoop]: Abstraction has 907 states and 1178 transitions. [2019-09-08 12:26:41,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1178 transitions. [2019-09-08 12:26:41,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:26:41,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:41,810 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:41,810 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:41,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:41,811 INFO L82 PathProgramCache]: Analyzing trace with hash -686829505, now seen corresponding path program 1 times [2019-09-08 12:26:41,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:41,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:41,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:41,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:41,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:41,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:41,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:41,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:41,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:41,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:41,933 INFO L87 Difference]: Start difference. First operand 907 states and 1178 transitions. Second operand 9 states. [2019-09-08 12:26:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:44,776 INFO L93 Difference]: Finished difference Result 1775 states and 2391 transitions. [2019-09-08 12:26:44,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:44,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:26:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:44,779 INFO L225 Difference]: With dead ends: 1775 [2019-09-08 12:26:44,779 INFO L226 Difference]: Without dead ends: 1628 [2019-09-08 12:26:44,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2019-09-08 12:26:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 906. [2019-09-08 12:26:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-08 12:26:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1176 transitions. [2019-09-08 12:26:44,908 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1176 transitions. Word has length 101 [2019-09-08 12:26:44,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:44,908 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1176 transitions. [2019-09-08 12:26:44,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1176 transitions. [2019-09-08 12:26:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:26:44,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:44,909 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:44,909 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:44,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:44,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1381337777, now seen corresponding path program 1 times [2019-09-08 12:26:44,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:44,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:44,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:44,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:44,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:45,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:45,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:45,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:45,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:45,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:45,046 INFO L87 Difference]: Start difference. First operand 906 states and 1176 transitions. Second operand 9 states. [2019-09-08 12:26:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:47,789 INFO L93 Difference]: Finished difference Result 1773 states and 2388 transitions. [2019-09-08 12:26:47,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:47,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:26:47,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:47,792 INFO L225 Difference]: With dead ends: 1773 [2019-09-08 12:26:47,792 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:26:47,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:26:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:26:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:26:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1174 transitions. [2019-09-08 12:26:47,926 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1174 transitions. Word has length 101 [2019-09-08 12:26:47,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:47,926 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1174 transitions. [2019-09-08 12:26:47,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1174 transitions. [2019-09-08 12:26:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:26:47,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:47,927 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:47,928 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:47,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:47,928 INFO L82 PathProgramCache]: Analyzing trace with hash -312727000, now seen corresponding path program 1 times [2019-09-08 12:26:47,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:47,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:47,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:47,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:47,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:48,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:48,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:48,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:48,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:48,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:48,057 INFO L87 Difference]: Start difference. First operand 905 states and 1174 transitions. Second operand 9 states. [2019-09-08 12:26:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:50,764 INFO L93 Difference]: Finished difference Result 1773 states and 2386 transitions. [2019-09-08 12:26:50,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:50,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:26:50,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:50,766 INFO L225 Difference]: With dead ends: 1773 [2019-09-08 12:26:50,766 INFO L226 Difference]: Without dead ends: 1626 [2019-09-08 12:26:50,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2019-09-08 12:26:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 905. [2019-09-08 12:26:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-09-08 12:26:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1173 transitions. [2019-09-08 12:26:50,901 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1173 transitions. Word has length 101 [2019-09-08 12:26:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:50,902 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1173 transitions. [2019-09-08 12:26:50,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1173 transitions. [2019-09-08 12:26:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:26:50,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:50,903 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:50,903 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:50,904 INFO L82 PathProgramCache]: Analyzing trace with hash -69019033, now seen corresponding path program 1 times [2019-09-08 12:26:50,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:50,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:50,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:50,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:50,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:51,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:51,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:26:51,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:26:51,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:26:51,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:26:51,043 INFO L87 Difference]: Start difference. First operand 905 states and 1173 transitions. Second operand 9 states. [2019-09-08 12:26:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:53,600 INFO L93 Difference]: Finished difference Result 1772 states and 2384 transitions. [2019-09-08 12:26:53,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:26:53,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:26:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:53,603 INFO L225 Difference]: With dead ends: 1772 [2019-09-08 12:26:53,603 INFO L226 Difference]: Without dead ends: 1625 [2019-09-08 12:26:53,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:26:53,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2019-09-08 12:26:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 904. [2019-09-08 12:26:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-08 12:26:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1171 transitions. [2019-09-08 12:26:53,747 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1171 transitions. Word has length 101 [2019-09-08 12:26:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:53,747 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1171 transitions. [2019-09-08 12:26:53,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:26:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1171 transitions. [2019-09-08 12:26:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:26:53,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:53,749 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:26:53,749 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:53,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1147136159, now seen corresponding path program 1 times [2019-09-08 12:26:53,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:53,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:53,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:53,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:53,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:54,685 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-08 12:26:54,832 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-08 12:26:55,014 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-08 12:26:55,193 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:26:55,355 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 12:26:55,516 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-08 12:26:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:26:57,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:57,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:26:57,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:26:57,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:26:57,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:26:57,029 INFO L87 Difference]: Start difference. First operand 904 states and 1171 transitions. Second operand 31 states. [2019-09-08 12:26:57,254 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:26:58,496 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:26:58,724 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:26:59,216 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 12:26:59,564 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-08 12:26:59,953 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2019-09-08 12:27:00,418 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-09-08 12:27:00,969 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 102 [2019-09-08 12:27:01,295 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 12:27:01,602 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 12:27:01,997 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 12:27:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:13,321 INFO L93 Difference]: Finished difference Result 1377 states and 1814 transitions. [2019-09-08 12:27:13,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:27:13,322 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 102 [2019-09-08 12:27:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:13,324 INFO L225 Difference]: With dead ends: 1377 [2019-09-08 12:27:13,324 INFO L226 Difference]: Without dead ends: 1227 [2019-09-08 12:27:13,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=475, Invalid=1975, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 12:27:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-09-08 12:27:13,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 924. [2019-09-08 12:27:13,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2019-09-08 12:27:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1198 transitions. [2019-09-08 12:27:13,474 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1198 transitions. Word has length 102 [2019-09-08 12:27:13,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:13,474 INFO L475 AbstractCegarLoop]: Abstraction has 924 states and 1198 transitions. [2019-09-08 12:27:13,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:27:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1198 transitions. [2019-09-08 12:27:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:27:13,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:13,476 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:13,476 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:13,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:13,477 INFO L82 PathProgramCache]: Analyzing trace with hash -80543799, now seen corresponding path program 1 times [2019-09-08 12:27:13,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:13,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:13,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:13,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:13,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:14,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:14,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:27:14,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:27:14,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:27:14,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:27:14,471 INFO L87 Difference]: Start difference. First operand 924 states and 1198 transitions. Second operand 17 states. [2019-09-08 12:27:15,153 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:27:15,308 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:27:16,693 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-08 12:27:18,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:18,993 INFO L93 Difference]: Finished difference Result 2017 states and 2712 transitions. [2019-09-08 12:27:18,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:27:18,993 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-08 12:27:18,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:18,996 INFO L225 Difference]: With dead ends: 2017 [2019-09-08 12:27:18,996 INFO L226 Difference]: Without dead ends: 1825 [2019-09-08 12:27:18,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:27:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2019-09-08 12:27:19,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 904. [2019-09-08 12:27:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-08 12:27:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1169 transitions. [2019-09-08 12:27:19,166 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1169 transitions. Word has length 102 [2019-09-08 12:27:19,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:19,167 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1169 transitions. [2019-09-08 12:27:19,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:27:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1169 transitions. [2019-09-08 12:27:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:27:19,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:19,169 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:19,169 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:19,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:19,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1830092596, now seen corresponding path program 1 times [2019-09-08 12:27:19,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:19,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:19,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:19,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:19,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:20,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:20,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:27:20,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:27:20,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:27:20,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:27:20,675 INFO L87 Difference]: Start difference. First operand 904 states and 1169 transitions. Second operand 22 states. [2019-09-08 12:27:21,798 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-09-08 12:27:22,102 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-08 12:27:22,473 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-09-08 12:27:22,665 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:27:23,089 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-08 12:27:23,463 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-08 12:27:23,647 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-09-08 12:27:23,909 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-09-08 12:27:24,710 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2019-09-08 12:27:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:28,322 INFO L93 Difference]: Finished difference Result 1998 states and 2651 transitions. [2019-09-08 12:27:28,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:27:28,323 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2019-09-08 12:27:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:28,324 INFO L225 Difference]: With dead ends: 1998 [2019-09-08 12:27:28,325 INFO L226 Difference]: Without dead ends: 1806 [2019-09-08 12:27:28,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 12:27:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-09-08 12:27:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 916. [2019-09-08 12:27:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-09-08 12:27:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1181 transitions. [2019-09-08 12:27:28,508 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1181 transitions. Word has length 102 [2019-09-08 12:27:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:28,509 INFO L475 AbstractCegarLoop]: Abstraction has 916 states and 1181 transitions. [2019-09-08 12:27:28,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:27:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1181 transitions. [2019-09-08 12:27:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:27:28,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:28,510 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:28,511 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:28,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:28,511 INFO L82 PathProgramCache]: Analyzing trace with hash 562528111, now seen corresponding path program 1 times [2019-09-08 12:27:28,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:28,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:28,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:28,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:28,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:29,416 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 12:27:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:30,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:30,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:27:30,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:27:30,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:27:30,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:27:30,353 INFO L87 Difference]: Start difference. First operand 916 states and 1181 transitions. Second operand 26 states. [2019-09-08 12:27:30,521 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 12:27:31,336 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-08 12:27:31,701 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 12:27:32,006 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-09-08 12:27:32,425 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 101 [2019-09-08 12:27:32,995 WARN L188 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 122 [2019-09-08 12:27:33,241 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-08 12:27:33,481 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-08 12:27:33,893 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-08 12:27:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:45,492 INFO L93 Difference]: Finished difference Result 2135 states and 2860 transitions. [2019-09-08 12:27:45,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 12:27:45,493 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 102 [2019-09-08 12:27:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:45,495 INFO L225 Difference]: With dead ends: 2135 [2019-09-08 12:27:45,495 INFO L226 Difference]: Without dead ends: 1986 [2019-09-08 12:27:45,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=404, Invalid=1948, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 12:27:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2019-09-08 12:27:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 929. [2019-09-08 12:27:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-08 12:27:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1199 transitions. [2019-09-08 12:27:45,682 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1199 transitions. Word has length 102 [2019-09-08 12:27:45,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:45,682 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 1199 transitions. [2019-09-08 12:27:45,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:27:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1199 transitions. [2019-09-08 12:27:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:27:45,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:45,684 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:45,684 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:45,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1027137318, now seen corresponding path program 1 times [2019-09-08 12:27:45,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:45,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:45,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:45,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:45,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:46,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:46,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:27:46,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:27:46,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:27:46,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:27:46,489 INFO L87 Difference]: Start difference. First operand 929 states and 1199 transitions. Second operand 17 states. [2019-09-08 12:27:47,183 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 12:27:47,355 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:27:47,995 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-09-08 12:27:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:51,070 INFO L93 Difference]: Finished difference Result 1982 states and 2659 transitions. [2019-09-08 12:27:51,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:27:51,070 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-08 12:27:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:51,072 INFO L225 Difference]: With dead ends: 1982 [2019-09-08 12:27:51,072 INFO L226 Difference]: Without dead ends: 1794 [2019-09-08 12:27:51,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:27:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2019-09-08 12:27:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 902. [2019-09-08 12:27:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-09-08 12:27:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1159 transitions. [2019-09-08 12:27:51,260 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1159 transitions. Word has length 102 [2019-09-08 12:27:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:51,261 INFO L475 AbstractCegarLoop]: Abstraction has 902 states and 1159 transitions. [2019-09-08 12:27:51,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:27:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1159 transitions. [2019-09-08 12:27:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:27:51,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:51,262 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:51,262 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:51,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:51,263 INFO L82 PathProgramCache]: Analyzing trace with hash 372185749, now seen corresponding path program 1 times [2019-09-08 12:27:51,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:51,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:51,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:51,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:51,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:52,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:52,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:27:52,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:27:52,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:27:52,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:27:52,073 INFO L87 Difference]: Start difference. First operand 902 states and 1159 transitions. Second operand 16 states. [2019-09-08 12:27:52,823 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:27:52,975 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:27:53,135 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:27:53,276 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-08 12:27:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:57,181 INFO L93 Difference]: Finished difference Result 1394 states and 1762 transitions. [2019-09-08 12:27:57,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:27:57,181 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2019-09-08 12:27:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:57,183 INFO L225 Difference]: With dead ends: 1394 [2019-09-08 12:27:57,183 INFO L226 Difference]: Without dead ends: 1390 [2019-09-08 12:27:57,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:27:57,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-09-08 12:27:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 908. [2019-09-08 12:27:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2019-09-08 12:27:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1167 transitions. [2019-09-08 12:27:57,380 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1167 transitions. Word has length 102 [2019-09-08 12:27:57,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:27:57,380 INFO L475 AbstractCegarLoop]: Abstraction has 908 states and 1167 transitions. [2019-09-08 12:27:57,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:27:57,380 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1167 transitions. [2019-09-08 12:27:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:27:57,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:27:57,381 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:27:57,381 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:27:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:27:57,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1173487299, now seen corresponding path program 1 times [2019-09-08 12:27:57,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:27:57,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:27:57,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:57,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:27:57,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:27:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:27:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:27:58,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:27:58,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 12:27:58,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 12:27:58,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 12:27:58,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:27:58,819 INFO L87 Difference]: Start difference. First operand 908 states and 1167 transitions. Second operand 22 states. [2019-09-08 12:27:59,964 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-08 12:28:00,246 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-08 12:28:00,600 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-09-08 12:28:00,805 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-09-08 12:28:03,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:03,844 INFO L93 Difference]: Finished difference Result 1604 states and 2125 transitions. [2019-09-08 12:28:03,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:28:03,845 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2019-09-08 12:28:03,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:03,846 INFO L225 Difference]: With dead ends: 1604 [2019-09-08 12:28:03,846 INFO L226 Difference]: Without dead ends: 1364 [2019-09-08 12:28:03,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:28:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-09-08 12:28:04,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 920. [2019-09-08 12:28:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-09-08 12:28:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1179 transitions. [2019-09-08 12:28:04,056 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1179 transitions. Word has length 102 [2019-09-08 12:28:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:04,056 INFO L475 AbstractCegarLoop]: Abstraction has 920 states and 1179 transitions. [2019-09-08 12:28:04,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 12:28:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1179 transitions. [2019-09-08 12:28:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:04,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:04,058 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:04,058 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1827059128, now seen corresponding path program 1 times [2019-09-08 12:28:04,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:04,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:04,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:04,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:04,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:04,717 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-09-08 12:28:05,204 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-08 12:28:05,356 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 12:28:05,516 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 12:28:05,696 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2019-09-08 12:28:05,855 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-08 12:28:06,019 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:28:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:07,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:07,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:28:07,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:28:07,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:28:07,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:28:07,210 INFO L87 Difference]: Start difference. First operand 920 states and 1179 transitions. Second operand 31 states. [2019-09-08 12:28:07,455 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-08 12:28:08,394 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-09-08 12:28:08,560 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-09-08 12:28:08,746 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-09-08 12:28:08,945 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-08 12:28:09,282 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-08 12:28:09,866 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-08 12:28:10,339 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-08 12:28:10,889 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-09-08 12:28:11,564 WARN L188 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 123 [2019-09-08 12:28:11,987 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-09-08 12:28:12,309 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-09-08 12:28:12,696 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-09-08 12:28:13,086 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2019-09-08 12:28:13,402 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-08 12:28:13,832 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-09-08 12:28:16,028 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-08 12:28:16,765 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-08 12:28:17,257 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-09-08 12:28:19,072 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-09-08 12:28:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:35,895 INFO L93 Difference]: Finished difference Result 2088 states and 2695 transitions. [2019-09-08 12:28:35,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 12:28:35,895 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 102 [2019-09-08 12:28:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:35,897 INFO L225 Difference]: With dead ends: 2088 [2019-09-08 12:28:35,897 INFO L226 Difference]: Without dead ends: 1935 [2019-09-08 12:28:35,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=707, Invalid=2599, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 12:28:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-09-08 12:28:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 931. [2019-09-08 12:28:36,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-09-08 12:28:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1191 transitions. [2019-09-08 12:28:36,115 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1191 transitions. Word has length 102 [2019-09-08 12:28:36,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:36,115 INFO L475 AbstractCegarLoop]: Abstraction has 931 states and 1191 transitions. [2019-09-08 12:28:36,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:28:36,116 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1191 transitions. [2019-09-08 12:28:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:36,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:36,117 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:36,117 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:36,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:36,117 INFO L82 PathProgramCache]: Analyzing trace with hash -337214839, now seen corresponding path program 1 times [2019-09-08 12:28:36,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:36,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:36,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:36,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:36,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:36,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:36,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:28:36,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:28:36,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:28:36,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:28:36,936 INFO L87 Difference]: Start difference. First operand 931 states and 1191 transitions. Second operand 17 states. [2019-09-08 12:28:37,658 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:28:37,803 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-08 12:28:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:40,586 INFO L93 Difference]: Finished difference Result 2006 states and 2679 transitions. [2019-09-08 12:28:40,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:28:40,586 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-08 12:28:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:40,588 INFO L225 Difference]: With dead ends: 2006 [2019-09-08 12:28:40,588 INFO L226 Difference]: Without dead ends: 1772 [2019-09-08 12:28:40,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:28:40,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2019-09-08 12:28:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 884. [2019-09-08 12:28:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-09-08 12:28:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1127 transitions. [2019-09-08 12:28:40,804 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1127 transitions. Word has length 102 [2019-09-08 12:28:40,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:40,804 INFO L475 AbstractCegarLoop]: Abstraction has 884 states and 1127 transitions. [2019-09-08 12:28:40,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:28:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1127 transitions. [2019-09-08 12:28:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:40,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:40,805 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:40,805 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:40,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:40,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1275780606, now seen corresponding path program 1 times [2019-09-08 12:28:40,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:40,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:40,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:40,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:40,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:41,533 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-08 12:28:41,716 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-08 12:28:41,887 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:28:42,056 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-08 12:28:42,226 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-09-08 12:28:42,380 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-08 12:28:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:28:43,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:43,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-08 12:28:43,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 12:28:43,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 12:28:43,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:28:43,352 INFO L87 Difference]: Start difference. First operand 884 states and 1127 transitions. Second operand 30 states. [2019-09-08 12:28:43,583 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-08 12:28:44,538 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-09-08 12:28:44,709 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-08 12:28:44,908 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-08 12:28:45,224 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-08 12:28:45,729 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-08 12:28:46,100 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2019-09-08 12:28:46,546 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 86 [2019-09-08 12:28:47,069 WARN L188 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 94 [2019-09-08 12:28:47,417 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-08 12:28:47,729 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-08 12:28:48,034 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-08 12:28:48,323 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-08 12:28:48,598 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-08 12:28:49,046 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-08 12:29:00,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:00,893 INFO L93 Difference]: Finished difference Result 1634 states and 2154 transitions. [2019-09-08 12:29:00,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 12:29:00,893 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 102 [2019-09-08 12:29:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:00,895 INFO L225 Difference]: With dead ends: 1634 [2019-09-08 12:29:00,895 INFO L226 Difference]: Without dead ends: 1459 [2019-09-08 12:29:00,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=549, Invalid=2001, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:29:00,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2019-09-08 12:29:01,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 900. [2019-09-08 12:29:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-09-08 12:29:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1145 transitions. [2019-09-08 12:29:01,124 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1145 transitions. Word has length 102 [2019-09-08 12:29:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:01,124 INFO L475 AbstractCegarLoop]: Abstraction has 900 states and 1145 transitions. [2019-09-08 12:29:01,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 12:29:01,124 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1145 transitions. [2019-09-08 12:29:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:01,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:01,125 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:01,125 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:01,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:01,126 INFO L82 PathProgramCache]: Analyzing trace with hash 818309933, now seen corresponding path program 1 times [2019-09-08 12:29:01,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:01,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:01,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:01,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:01,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:02,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:02,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 12:29:02,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:29:02,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:29:02,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:29:02,260 INFO L87 Difference]: Start difference. First operand 900 states and 1145 transitions. Second operand 20 states. [2019-09-08 12:29:02,391 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-09-08 12:29:03,027 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-09-08 12:29:03,326 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-09-08 12:29:03,590 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-09-08 12:29:03,809 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-08 12:29:04,023 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-08 12:29:04,219 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:29:04,394 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 12:29:04,560 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 12:29:04,819 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-08 12:29:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:08,320 INFO L93 Difference]: Finished difference Result 1569 states and 2074 transitions. [2019-09-08 12:29:08,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:29:08,320 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 102 [2019-09-08 12:29:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:08,322 INFO L225 Difference]: With dead ends: 1569 [2019-09-08 12:29:08,322 INFO L226 Difference]: Without dead ends: 1304 [2019-09-08 12:29:08,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=297, Invalid=893, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:29:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2019-09-08 12:29:08,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 890. [2019-09-08 12:29:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-09-08 12:29:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1133 transitions. [2019-09-08 12:29:08,653 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1133 transitions. Word has length 102 [2019-09-08 12:29:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:08,653 INFO L475 AbstractCegarLoop]: Abstraction has 890 states and 1133 transitions. [2019-09-08 12:29:08,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:29:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1133 transitions. [2019-09-08 12:29:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:08,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:08,655 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:08,655 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:08,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2057276911, now seen corresponding path program 1 times [2019-09-08 12:29:08,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:08,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:08,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:08,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:08,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:09,738 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-08 12:29:09,882 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-08 12:29:10,042 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 12:29:10,222 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 12:29:10,401 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 12:29:10,582 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-08 12:29:10,752 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:29:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:12,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:12,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-09-08 12:29:12,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-08 12:29:12,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-08 12:29:12,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2019-09-08 12:29:12,053 INFO L87 Difference]: Start difference. First operand 890 states and 1133 transitions. Second operand 32 states. [2019-09-08 12:29:12,281 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2019-09-08 12:29:13,255 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-09-08 12:29:13,430 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2019-09-08 12:29:13,637 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-08 12:29:13,910 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-09-08 12:29:14,651 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 97 [2019-09-08 12:29:15,125 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 86 [2019-09-08 12:29:15,701 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 100 [2019-09-08 12:29:16,406 WARN L188 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 113 [2019-09-08 12:29:17,219 WARN L188 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 128 [2019-09-08 12:29:17,570 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2019-09-08 12:29:17,972 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2019-09-08 12:29:18,332 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2019-09-08 12:29:18,683 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2019-09-08 12:29:19,031 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2019-09-08 12:29:19,529 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-09-08 12:29:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:28,595 INFO L93 Difference]: Finished difference Result 1319 states and 1717 transitions. [2019-09-08 12:29:28,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 12:29:28,596 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 102 [2019-09-08 12:29:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:28,598 INFO L225 Difference]: With dead ends: 1319 [2019-09-08 12:29:28,598 INFO L226 Difference]: Without dead ends: 1166 [2019-09-08 12:29:28,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=572, Invalid=2184, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 12:29:28,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2019-09-08 12:29:28,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 906. [2019-09-08 12:29:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-08 12:29:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1151 transitions. [2019-09-08 12:29:28,857 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1151 transitions. Word has length 102 [2019-09-08 12:29:28,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:28,857 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1151 transitions. [2019-09-08 12:29:28,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-08 12:29:28,858 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1151 transitions. [2019-09-08 12:29:28,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:28,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:28,859 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:28,859 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:28,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:28,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1985149574, now seen corresponding path program 1 times [2019-09-08 12:29:28,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:28,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:28,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:28,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:28,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:29,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:29,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:29:29,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:29:29,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:29:29,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:29:29,668 INFO L87 Difference]: Start difference. First operand 906 states and 1151 transitions. Second operand 17 states. [2019-09-08 12:29:30,396 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 12:29:30,549 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 12:29:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:35,076 INFO L93 Difference]: Finished difference Result 1825 states and 2436 transitions. [2019-09-08 12:29:35,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:29:35,077 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-08 12:29:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:35,079 INFO L225 Difference]: With dead ends: 1825 [2019-09-08 12:29:35,079 INFO L226 Difference]: Without dead ends: 1676 [2019-09-08 12:29:35,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:29:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2019-09-08 12:29:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 906. [2019-09-08 12:29:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-08 12:29:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1149 transitions. [2019-09-08 12:29:35,346 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1149 transitions. Word has length 102 [2019-09-08 12:29:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:35,346 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1149 transitions. [2019-09-08 12:29:35,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:29:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1149 transitions. [2019-09-08 12:29:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:35,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:35,348 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:35,348 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:35,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:35,348 INFO L82 PathProgramCache]: Analyzing trace with hash 578828359, now seen corresponding path program 1 times [2019-09-08 12:29:35,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:35,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:35,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:35,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:35,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:36,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:36,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:29:36,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:29:36,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:29:36,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:29:36,153 INFO L87 Difference]: Start difference. First operand 906 states and 1149 transitions. Second operand 17 states. [2019-09-08 12:29:36,839 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:29:36,999 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:29:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:38,977 INFO L93 Difference]: Finished difference Result 1456 states and 1943 transitions. [2019-09-08 12:29:38,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:29:38,978 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-09-08 12:29:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:38,980 INFO L225 Difference]: With dead ends: 1456 [2019-09-08 12:29:38,980 INFO L226 Difference]: Without dead ends: 1209 [2019-09-08 12:29:38,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:29:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2019-09-08 12:29:39,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 850. [2019-09-08 12:29:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-09-08 12:29:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1075 transitions. [2019-09-08 12:29:39,214 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1075 transitions. Word has length 102 [2019-09-08 12:29:39,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:39,214 INFO L475 AbstractCegarLoop]: Abstraction has 850 states and 1075 transitions. [2019-09-08 12:29:39,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:29:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1075 transitions. [2019-09-08 12:29:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:39,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:39,215 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:39,215 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:39,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:39,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2017856453, now seen corresponding path program 1 times [2019-09-08 12:29:39,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:39,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:39,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:39,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:39,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:39,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:39,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:39,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:39,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:39,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:39,353 INFO L87 Difference]: Start difference. First operand 850 states and 1075 transitions. Second operand 9 states. [2019-09-08 12:29:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:41,955 INFO L93 Difference]: Finished difference Result 1703 states and 2277 transitions. [2019-09-08 12:29:41,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:41,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:41,957 INFO L225 Difference]: With dead ends: 1703 [2019-09-08 12:29:41,957 INFO L226 Difference]: Without dead ends: 1527 [2019-09-08 12:29:41,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:29:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2019-09-08 12:29:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 850. [2019-09-08 12:29:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-09-08 12:29:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1072 transitions. [2019-09-08 12:29:42,198 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1072 transitions. Word has length 103 [2019-09-08 12:29:42,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:42,199 INFO L475 AbstractCegarLoop]: Abstraction has 850 states and 1072 transitions. [2019-09-08 12:29:42,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1072 transitions. [2019-09-08 12:29:42,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:42,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:42,200 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:42,200 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:42,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1724675309, now seen corresponding path program 1 times [2019-09-08 12:29:42,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:42,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:42,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:42,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:42,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:42,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:42,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:42,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:42,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:42,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:42,338 INFO L87 Difference]: Start difference. First operand 850 states and 1072 transitions. Second operand 9 states. [2019-09-08 12:29:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:44,961 INFO L93 Difference]: Finished difference Result 1500 states and 1974 transitions. [2019-09-08 12:29:44,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:44,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:44,963 INFO L225 Difference]: With dead ends: 1500 [2019-09-08 12:29:44,963 INFO L226 Difference]: Without dead ends: 1493 [2019-09-08 12:29:44,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:29:44,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2019-09-08 12:29:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 850. [2019-09-08 12:29:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-09-08 12:29:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1069 transitions. [2019-09-08 12:29:45,214 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1069 transitions. Word has length 103 [2019-09-08 12:29:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:45,214 INFO L475 AbstractCegarLoop]: Abstraction has 850 states and 1069 transitions. [2019-09-08 12:29:45,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1069 transitions. [2019-09-08 12:29:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:45,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:45,215 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:45,215 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:45,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:45,215 INFO L82 PathProgramCache]: Analyzing trace with hash -193101075, now seen corresponding path program 1 times [2019-09-08 12:29:45,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:45,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:45,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:45,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:45,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:45,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:45,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:29:45,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:29:45,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:29:45,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:29:45,652 INFO L87 Difference]: Start difference. First operand 850 states and 1069 transitions. Second operand 12 states. [2019-09-08 12:29:46,143 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-08 12:29:46,275 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-08 12:29:46,567 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-09-08 12:29:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:48,166 INFO L93 Difference]: Finished difference Result 2053 states and 2783 transitions. [2019-09-08 12:29:48,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:29:48,166 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2019-09-08 12:29:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:48,168 INFO L225 Difference]: With dead ends: 2053 [2019-09-08 12:29:48,168 INFO L226 Difference]: Without dead ends: 1873 [2019-09-08 12:29:48,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:29:48,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2019-09-08 12:29:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 816. [2019-09-08 12:29:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-09-08 12:29:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1027 transitions. [2019-09-08 12:29:48,405 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1027 transitions. Word has length 103 [2019-09-08 12:29:48,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:48,405 INFO L475 AbstractCegarLoop]: Abstraction has 816 states and 1027 transitions. [2019-09-08 12:29:48,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:29:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1027 transitions. [2019-09-08 12:29:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:48,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:48,407 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:48,407 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:48,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:48,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1298823277, now seen corresponding path program 1 times [2019-09-08 12:29:48,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:48,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:48,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:48,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:48,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:48,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:48,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:29:48,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:29:48,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:29:48,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:29:48,822 INFO L87 Difference]: Start difference. First operand 816 states and 1027 transitions. Second operand 11 states. [2019-09-08 12:29:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:51,592 INFO L93 Difference]: Finished difference Result 2403 states and 3330 transitions. [2019-09-08 12:29:51,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:51,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-09-08 12:29:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:51,594 INFO L225 Difference]: With dead ends: 2403 [2019-09-08 12:29:51,594 INFO L226 Difference]: Without dead ends: 2231 [2019-09-08 12:29:51,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:29:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-09-08 12:29:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 774. [2019-09-08 12:29:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-09-08 12:29:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 974 transitions. [2019-09-08 12:29:51,832 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 974 transitions. Word has length 103 [2019-09-08 12:29:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:51,833 INFO L475 AbstractCegarLoop]: Abstraction has 774 states and 974 transitions. [2019-09-08 12:29:51,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:29:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 974 transitions. [2019-09-08 12:29:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:51,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:51,834 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:51,834 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:51,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:51,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1405459957, now seen corresponding path program 1 times [2019-09-08 12:29:51,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:51,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:51,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:51,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:51,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:52,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:52,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:29:52,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:29:52,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:29:52,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:29:52,634 INFO L87 Difference]: Start difference. First operand 774 states and 974 transitions. Second operand 17 states. [2019-09-08 12:29:53,318 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 12:29:53,491 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-08 12:29:53,802 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-09-08 12:29:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:56,007 INFO L93 Difference]: Finished difference Result 1641 states and 2199 transitions. [2019-09-08 12:29:56,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:29:56,007 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:29:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:56,009 INFO L225 Difference]: With dead ends: 1641 [2019-09-08 12:29:56,009 INFO L226 Difference]: Without dead ends: 1425 [2019-09-08 12:29:56,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:29:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2019-09-08 12:29:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 730. [2019-09-08 12:29:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-08 12:29:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 921 transitions. [2019-09-08 12:29:56,244 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 921 transitions. Word has length 103 [2019-09-08 12:29:56,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:56,244 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 921 transitions. [2019-09-08 12:29:56,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:29:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 921 transitions. [2019-09-08 12:29:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:56,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:56,245 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:56,245 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:56,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:56,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2048395954, now seen corresponding path program 1 times [2019-09-08 12:29:56,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:56,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:56,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:56,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:56,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:57,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:57,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:29:57,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:29:57,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:29:57,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:29:57,653 INFO L87 Difference]: Start difference. First operand 730 states and 921 transitions. Second operand 21 states. [2019-09-08 12:29:57,792 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2019-09-08 12:29:58,682 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-09-08 12:29:58,890 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 41 [2019-09-08 12:29:59,175 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2019-09-08 12:29:59,405 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-08 12:29:59,658 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-08 12:30:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:04,404 INFO L93 Difference]: Finished difference Result 1096 states and 1415 transitions. [2019-09-08 12:30:04,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 12:30:04,405 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2019-09-08 12:30:04,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:04,407 INFO L225 Difference]: With dead ends: 1096 [2019-09-08 12:30:04,407 INFO L226 Difference]: Without dead ends: 946 [2019-09-08 12:30:04,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:30:04,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2019-09-08 12:30:04,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 752. [2019-09-08 12:30:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-09-08 12:30:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 949 transitions. [2019-09-08 12:30:04,648 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 949 transitions. Word has length 103 [2019-09-08 12:30:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:04,649 INFO L475 AbstractCegarLoop]: Abstraction has 752 states and 949 transitions. [2019-09-08 12:30:04,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:30:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 949 transitions. [2019-09-08 12:30:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:30:04,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:04,650 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:04,650 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:04,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:04,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1914956223, now seen corresponding path program 1 times [2019-09-08 12:30:04,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:04,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:04,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:04,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:04,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:05,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:05,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:30:05,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:30:05,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:30:05,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:30:05,081 INFO L87 Difference]: Start difference. First operand 752 states and 949 transitions. Second operand 11 states. [2019-09-08 12:30:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:07,683 INFO L93 Difference]: Finished difference Result 2281 states and 3184 transitions. [2019-09-08 12:30:07,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:07,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-09-08 12:30:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:07,685 INFO L225 Difference]: With dead ends: 2281 [2019-09-08 12:30:07,685 INFO L226 Difference]: Without dead ends: 2115 [2019-09-08 12:30:07,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:30:07,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2019-09-08 12:30:07,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 732. [2019-09-08 12:30:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-09-08 12:30:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 921 transitions. [2019-09-08 12:30:07,931 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 921 transitions. Word has length 103 [2019-09-08 12:30:07,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:07,931 INFO L475 AbstractCegarLoop]: Abstraction has 732 states and 921 transitions. [2019-09-08 12:30:07,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:30:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 921 transitions. [2019-09-08 12:30:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:30:07,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:07,933 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:07,933 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:07,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:07,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1049847790, now seen corresponding path program 1 times [2019-09-08 12:30:07,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:07,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:07,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:07,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:07,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:08,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:08,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:30:08,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:30:08,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:30:08,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:30:08,734 INFO L87 Difference]: Start difference. First operand 732 states and 921 transitions. Second operand 17 states. [2019-09-08 12:30:09,380 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:30:09,537 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:30:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:10,904 INFO L93 Difference]: Finished difference Result 1218 states and 1615 transitions. [2019-09-08 12:30:10,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 12:30:10,904 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:30:10,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:10,906 INFO L225 Difference]: With dead ends: 1218 [2019-09-08 12:30:10,906 INFO L226 Difference]: Without dead ends: 954 [2019-09-08 12:30:10,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:30:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-09-08 12:30:11,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 666. [2019-09-08 12:30:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-08 12:30:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 840 transitions. [2019-09-08 12:30:11,160 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 840 transitions. Word has length 103 [2019-09-08 12:30:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:11,160 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 840 transitions. [2019-09-08 12:30:11,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:30:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 840 transitions. [2019-09-08 12:30:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:30:11,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:11,162 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:11,162 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:11,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:11,162 INFO L82 PathProgramCache]: Analyzing trace with hash 407007842, now seen corresponding path program 1 times [2019-09-08 12:30:11,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:11,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:11,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:11,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:11,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:12,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:12,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:30:12,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:30:12,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:30:12,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:30:12,370 INFO L87 Difference]: Start difference. First operand 666 states and 840 transitions. Second operand 21 states. [2019-09-08 12:30:13,492 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 12:30:13,808 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-08 12:30:14,005 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 12:30:14,184 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 12:30:14,362 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 12:30:15,097 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-08 12:30:15,772 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 12:30:16,065 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:30:16,375 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 12:30:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:19,298 INFO L93 Difference]: Finished difference Result 1484 states and 1920 transitions. [2019-09-08 12:30:19,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:30:19,299 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 103 [2019-09-08 12:30:19,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:19,300 INFO L225 Difference]: With dead ends: 1484 [2019-09-08 12:30:19,300 INFO L226 Difference]: Without dead ends: 1331 [2019-09-08 12:30:19,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:30:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-09-08 12:30:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 665. [2019-09-08 12:30:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-09-08 12:30:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 837 transitions. [2019-09-08 12:30:19,544 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 837 transitions. Word has length 103 [2019-09-08 12:30:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:19,544 INFO L475 AbstractCegarLoop]: Abstraction has 665 states and 837 transitions. [2019-09-08 12:30:19,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:30:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 837 transitions. [2019-09-08 12:30:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:30:19,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:19,545 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:19,546 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:19,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:19,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1890101845, now seen corresponding path program 1 times [2019-09-08 12:30:19,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:19,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:19,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:19,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:19,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:20,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:20,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:30:20,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:30:20,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:30:20,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:30:20,327 INFO L87 Difference]: Start difference. First operand 665 states and 837 transitions. Second operand 16 states. [2019-09-08 12:30:21,036 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-09-08 12:30:21,216 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-08 12:30:21,368 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-08 12:30:21,618 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-08 12:30:21,845 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-08 12:30:22,150 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-09-08 12:30:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:24,384 INFO L93 Difference]: Finished difference Result 1747 states and 2399 transitions. [2019-09-08 12:30:24,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:30:24,385 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-08 12:30:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:24,387 INFO L225 Difference]: With dead ends: 1747 [2019-09-08 12:30:24,387 INFO L226 Difference]: Without dead ends: 1559 [2019-09-08 12:30:24,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:30:24,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2019-09-08 12:30:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 623. [2019-09-08 12:30:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-08 12:30:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 782 transitions. [2019-09-08 12:30:24,633 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 782 transitions. Word has length 103 [2019-09-08 12:30:24,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:24,634 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 782 transitions. [2019-09-08 12:30:24,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:30:24,634 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 782 transitions. [2019-09-08 12:30:24,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:30:24,635 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:24,635 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:24,635 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:24,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:24,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1989632252, now seen corresponding path program 1 times [2019-09-08 12:30:24,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:24,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:24,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:24,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:24,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:25,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-09-08 12:30:25,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:25,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:30:25,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:30:25,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:30:25,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:30:25,281 INFO L87 Difference]: Start difference. First operand 623 states and 782 transitions. Second operand 15 states. [2019-09-08 12:30:25,876 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:30:26,021 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:30:26,158 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:30:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:27,787 INFO L93 Difference]: Finished difference Result 1164 states and 1556 transitions. [2019-09-08 12:30:27,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:30:27,788 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 103 [2019-09-08 12:30:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:27,789 INFO L225 Difference]: With dead ends: 1164 [2019-09-08 12:30:27,790 INFO L226 Difference]: Without dead ends: 893 [2019-09-08 12:30:27,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:30:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-08 12:30:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 563. [2019-09-08 12:30:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-08 12:30:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 709 transitions. [2019-09-08 12:30:28,011 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 709 transitions. Word has length 103 [2019-09-08 12:30:28,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:28,011 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 709 transitions. [2019-09-08 12:30:28,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:30:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 709 transitions. [2019-09-08 12:30:28,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:30:28,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:28,012 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:28,012 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:28,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:28,013 INFO L82 PathProgramCache]: Analyzing trace with hash -57079179, now seen corresponding path program 1 times [2019-09-08 12:30:28,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:28,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:28,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:28,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:28,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:28,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-09-08 12:30:28,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:28,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:30:28,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:30:28,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:30:28,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:30:28,410 INFO L87 Difference]: Start difference. First operand 563 states and 709 transitions. Second operand 11 states. [2019-09-08 12:30:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:30,288 INFO L93 Difference]: Finished difference Result 1303 states and 1772 transitions. [2019-09-08 12:30:30,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:30,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2019-09-08 12:30:30,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:30,290 INFO L225 Difference]: With dead ends: 1303 [2019-09-08 12:30:30,290 INFO L226 Difference]: Without dead ends: 1034 [2019-09-08 12:30:30,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:30:30,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-09-08 12:30:30,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 440. [2019-09-08 12:30:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-08 12:30:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 555 transitions. [2019-09-08 12:30:30,489 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 555 transitions. Word has length 103 [2019-09-08 12:30:30,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:30,489 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 555 transitions. [2019-09-08 12:30:30,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:30:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 555 transitions. [2019-09-08 12:30:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:30,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:30,490 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:30,491 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:30,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:30,491 INFO L82 PathProgramCache]: Analyzing trace with hash -444576202, now seen corresponding path program 1 times [2019-09-08 12:30:30,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:30,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:30,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:30,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:30,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:30,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:30,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:30,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:30,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:30,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:30,681 INFO L87 Difference]: Start difference. First operand 440 states and 555 transitions. Second operand 9 states. [2019-09-08 12:30:32,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:32,466 INFO L93 Difference]: Finished difference Result 981 states and 1333 transitions. [2019-09-08 12:30:32,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:32,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:30:32,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:32,467 INFO L225 Difference]: With dead ends: 981 [2019-09-08 12:30:32,467 INFO L226 Difference]: Without dead ends: 974 [2019-09-08 12:30:32,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:30:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-09-08 12:30:32,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 440. [2019-09-08 12:30:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-08 12:30:32,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 552 transitions. [2019-09-08 12:30:32,660 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 552 transitions. Word has length 104 [2019-09-08 12:30:32,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:32,660 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 552 transitions. [2019-09-08 12:30:32,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 552 transitions. [2019-09-08 12:30:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:32,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:32,661 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:32,661 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:32,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:32,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1911918420, now seen corresponding path program 1 times [2019-09-08 12:30:32,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:32,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:32,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:32,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:32,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:32,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:32,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:32,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:32,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:32,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:32,797 INFO L87 Difference]: Start difference. First operand 440 states and 552 transitions. Second operand 9 states. [2019-09-08 12:30:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:34,020 INFO L93 Difference]: Finished difference Result 685 states and 883 transitions. [2019-09-08 12:30:34,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:30:34,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:30:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:34,022 INFO L225 Difference]: With dead ends: 685 [2019-09-08 12:30:34,022 INFO L226 Difference]: Without dead ends: 678 [2019-09-08 12:30:34,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-09-08 12:30:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-09-08 12:30:34,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 440. [2019-09-08 12:30:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-08 12:30:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 550 transitions. [2019-09-08 12:30:34,212 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 550 transitions. Word has length 104 [2019-09-08 12:30:34,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:34,213 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 550 transitions. [2019-09-08 12:30:34,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 550 transitions. [2019-09-08 12:30:34,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:34,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:34,213 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:34,214 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:34,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:34,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1218168555, now seen corresponding path program 1 times [2019-09-08 12:30:34,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:34,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:34,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:34,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:34,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:34,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:34,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:30:34,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:30:34,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:30:34,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:30:34,841 INFO L87 Difference]: Start difference. First operand 440 states and 550 transitions. Second operand 13 states. [2019-09-08 12:30:35,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:35,971 INFO L93 Difference]: Finished difference Result 822 states and 1093 transitions. [2019-09-08 12:30:35,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:30:35,971 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2019-09-08 12:30:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:35,972 INFO L225 Difference]: With dead ends: 822 [2019-09-08 12:30:35,972 INFO L226 Difference]: Without dead ends: 605 [2019-09-08 12:30:35,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:30:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-08 12:30:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 369. [2019-09-08 12:30:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-08 12:30:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 469 transitions. [2019-09-08 12:30:36,150 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 469 transitions. Word has length 104 [2019-09-08 12:30:36,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:36,150 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 469 transitions. [2019-09-08 12:30:36,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:30:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 469 transitions. [2019-09-08 12:30:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:36,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:36,151 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:36,151 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:36,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1690908129, now seen corresponding path program 1 times [2019-09-08 12:30:36,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:36,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:36,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:36,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:36,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:36,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:36,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:30:36,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:30:36,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:30:36,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:30:36,529 INFO L87 Difference]: Start difference. First operand 369 states and 469 transitions. Second operand 11 states. [2019-09-08 12:30:37,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:37,804 INFO L93 Difference]: Finished difference Result 1127 states and 1552 transitions. [2019-09-08 12:30:37,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 12:30:37,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-08 12:30:37,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:37,806 INFO L225 Difference]: With dead ends: 1127 [2019-09-08 12:30:37,806 INFO L226 Difference]: Without dead ends: 919 [2019-09-08 12:30:37,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:30:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-08 12:30:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 301. [2019-09-08 12:30:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-08 12:30:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 389 transitions. [2019-09-08 12:30:37,973 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 389 transitions. Word has length 104 [2019-09-08 12:30:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:37,973 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 389 transitions. [2019-09-08 12:30:37,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:30:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 389 transitions. [2019-09-08 12:30:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:30:37,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:37,974 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:37,974 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:37,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:37,974 INFO L82 PathProgramCache]: Analyzing trace with hash -450268320, now seen corresponding path program 1 times [2019-09-08 12:30:37,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:37,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:37,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:37,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:37,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:39,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:39,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-08 12:30:39,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 12:30:39,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 12:30:39,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:30:39,676 INFO L87 Difference]: Start difference. First operand 301 states and 389 transitions. Second operand 33 states. [2019-09-08 12:30:40,216 WARN L188 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 117 [2019-09-08 12:30:41,310 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-08 12:30:41,800 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:30:42,082 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-08 12:30:42,422 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 12:30:42,834 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-08 12:30:43,343 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2019-09-08 12:30:43,604 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-08 12:30:43,878 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-08 12:30:47,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:47,723 INFO L93 Difference]: Finished difference Result 1104 states and 1567 transitions. [2019-09-08 12:30:47,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 12:30:47,723 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 105 [2019-09-08 12:30:47,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:47,725 INFO L225 Difference]: With dead ends: 1104 [2019-09-08 12:30:47,725 INFO L226 Difference]: Without dead ends: 1098 [2019-09-08 12:30:47,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=592, Invalid=3190, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 12:30:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-09-08 12:30:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 322. [2019-09-08 12:30:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-08 12:30:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 415 transitions. [2019-09-08 12:30:47,906 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 415 transitions. Word has length 105 [2019-09-08 12:30:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:47,907 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 415 transitions. [2019-09-08 12:30:47,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 12:30:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 415 transitions. [2019-09-08 12:30:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:30:47,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:47,907 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:47,907 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:47,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:47,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2121176506, now seen corresponding path program 1 times [2019-09-08 12:30:47,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:47,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:47,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:47,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:47,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:48,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:48,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:30:48,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:30:48,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:30:48,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:30:48,670 INFO L87 Difference]: Start difference. First operand 322 states and 415 transitions. Second operand 16 states. [2019-09-08 12:30:49,438 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:30:49,756 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-08 12:30:50,024 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 12:30:51,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:51,814 INFO L93 Difference]: Finished difference Result 1002 states and 1404 transitions. [2019-09-08 12:30:51,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:30:51,815 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 106 [2019-09-08 12:30:51,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:51,816 INFO L225 Difference]: With dead ends: 1002 [2019-09-08 12:30:51,816 INFO L226 Difference]: Without dead ends: 996 [2019-09-08 12:30:51,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:30:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2019-09-08 12:30:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 328. [2019-09-08 12:30:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-08 12:30:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 423 transitions. [2019-09-08 12:30:52,001 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 423 transitions. Word has length 106 [2019-09-08 12:30:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:52,001 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 423 transitions. [2019-09-08 12:30:52,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:30:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 423 transitions. [2019-09-08 12:30:52,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:30:52,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:52,002 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:52,002 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:52,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:52,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1287854380, now seen corresponding path program 1 times [2019-09-08 12:30:52,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:52,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:52,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:52,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:52,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:54,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:54,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:30:54,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:30:54,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:30:54,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:30:54,018 INFO L87 Difference]: Start difference. First operand 328 states and 423 transitions. Second operand 26 states. [2019-09-08 12:30:54,200 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-08 12:30:55,015 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 12:30:55,171 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-08 12:30:55,607 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-09-08 12:30:55,906 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-08 12:30:56,247 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-09-08 12:30:56,686 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-09-08 12:30:56,968 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-08 12:30:57,246 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-08 12:30:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:59,482 INFO L93 Difference]: Finished difference Result 683 states and 933 transitions. [2019-09-08 12:30:59,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:30:59,482 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2019-09-08 12:30:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:59,483 INFO L225 Difference]: With dead ends: 683 [2019-09-08 12:30:59,483 INFO L226 Difference]: Without dead ends: 677 [2019-09-08 12:30:59,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 12:30:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-09-08 12:30:59,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 329. [2019-09-08 12:30:59,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-08 12:30:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 424 transitions. [2019-09-08 12:30:59,677 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 424 transitions. Word has length 106 [2019-09-08 12:30:59,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:59,677 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 424 transitions. [2019-09-08 12:30:59,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:30:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 424 transitions. [2019-09-08 12:30:59,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:30:59,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:59,678 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:59,678 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:59,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:59,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1850721926, now seen corresponding path program 1 times [2019-09-08 12:30:59,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:59,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:59,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:59,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:59,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:01,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:01,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:31:01,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:31:01,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:31:01,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:01,043 INFO L87 Difference]: Start difference. First operand 329 states and 424 transitions. Second operand 21 states. [2019-09-08 12:31:01,176 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2019-09-08 12:31:01,994 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-09-08 12:31:02,223 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-08 12:31:02,518 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-08 12:31:02,734 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:31:02,940 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-08 12:31:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:04,386 INFO L93 Difference]: Finished difference Result 671 states and 920 transitions. [2019-09-08 12:31:04,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:31:04,386 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2019-09-08 12:31:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:04,388 INFO L225 Difference]: With dead ends: 671 [2019-09-08 12:31:04,388 INFO L226 Difference]: Without dead ends: 665 [2019-09-08 12:31:04,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:31:04,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-09-08 12:31:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 330. [2019-09-08 12:31:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-08 12:31:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 425 transitions. [2019-09-08 12:31:04,589 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 425 transitions. Word has length 106 [2019-09-08 12:31:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:04,589 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 425 transitions. [2019-09-08 12:31:04,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:31:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 425 transitions. [2019-09-08 12:31:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:31:04,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:04,590 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:04,591 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:04,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:04,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1866671309, now seen corresponding path program 1 times [2019-09-08 12:31:04,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:04,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:04,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:04,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:04,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:05,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:05,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:31:05,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:31:05,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:31:05,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:31:05,372 INFO L87 Difference]: Start difference. First operand 330 states and 425 transitions. Second operand 16 states. [2019-09-08 12:31:06,122 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:31:06,277 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:31:06,425 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:31:06,565 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-08 12:31:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:08,671 INFO L93 Difference]: Finished difference Result 1111 states and 1577 transitions. [2019-09-08 12:31:08,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:31:08,672 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 106 [2019-09-08 12:31:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:08,673 INFO L225 Difference]: With dead ends: 1111 [2019-09-08 12:31:08,673 INFO L226 Difference]: Without dead ends: 1105 [2019-09-08 12:31:08,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:31:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-09-08 12:31:08,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 307. [2019-09-08 12:31:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-08 12:31:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 396 transitions. [2019-09-08 12:31:08,863 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 396 transitions. Word has length 106 [2019-09-08 12:31:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:08,863 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 396 transitions. [2019-09-08 12:31:08,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:31:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 396 transitions. [2019-09-08 12:31:08,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:31:08,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:08,863 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:08,864 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:08,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:08,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1064534923, now seen corresponding path program 1 times [2019-09-08 12:31:08,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:08,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:08,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:08,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:08,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:10,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:10,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:10,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-08 12:31:10,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 12:31:10,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 12:31:10,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:31:10,944 INFO L87 Difference]: Start difference. First operand 307 states and 396 transitions. Second operand 28 states. [2019-09-08 12:31:11,104 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-09-08 12:31:12,192 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-09-08 12:31:12,422 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-08 12:31:12,720 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-08 12:31:13,091 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-08 12:31:13,531 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-08 12:31:14,066 WARN L188 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 94 [2019-09-08 12:31:14,303 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-08 12:31:14,563 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-08 12:31:14,739 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-08 12:31:17,242 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-08 12:31:18,812 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-08 12:31:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:26,834 INFO L93 Difference]: Finished difference Result 2305 states and 3274 transitions. [2019-09-08 12:31:26,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 12:31:26,834 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 106 [2019-09-08 12:31:26,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:26,836 INFO L225 Difference]: With dead ends: 2305 [2019-09-08 12:31:26,836 INFO L226 Difference]: Without dead ends: 2299 [2019-09-08 12:31:26,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=442, Invalid=2638, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 12:31:26,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2019-09-08 12:31:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 322. [2019-09-08 12:31:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-09-08 12:31:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 414 transitions. [2019-09-08 12:31:27,042 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 414 transitions. Word has length 106 [2019-09-08 12:31:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:27,042 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 414 transitions. [2019-09-08 12:31:27,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 12:31:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 414 transitions. [2019-09-08 12:31:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:31:27,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:27,043 INFO L399 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:27,043 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:27,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:27,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1144717407, now seen corresponding path program 1 times [2019-09-08 12:31:27,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:27,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:27,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:27,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:27,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:27,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:27,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:31:27,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:31:27,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:31:27,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:31:27,681 INFO L87 Difference]: Start difference. First operand 322 states and 414 transitions. Second operand 13 states. [2019-09-08 12:31:28,322 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-09-08 12:31:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:29,562 INFO L93 Difference]: Finished difference Result 814 states and 1132 transitions. [2019-09-08 12:31:29,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:29,563 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 107 [2019-09-08 12:31:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:29,564 INFO L225 Difference]: With dead ends: 814 [2019-09-08 12:31:29,564 INFO L226 Difference]: Without dead ends: 808 [2019-09-08 12:31:29,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:31:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2019-09-08 12:31:29,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 295. [2019-09-08 12:31:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-08 12:31:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 382 transitions. [2019-09-08 12:31:29,752 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 382 transitions. Word has length 107 [2019-09-08 12:31:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:29,752 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 382 transitions. [2019-09-08 12:31:29,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:31:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 382 transitions. [2019-09-08 12:31:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:31:29,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:29,753 INFO L399 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:29,753 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:29,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:29,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1232495127, now seen corresponding path program 1 times [2019-09-08 12:31:29,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:29,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:29,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:29,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:29,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:29,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:29,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:31:29,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:31:29,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:31:29,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:31:29,826 INFO L87 Difference]: Start difference. First operand 295 states and 382 transitions. Second operand 3 states. [2019-09-08 12:31:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:30,195 INFO L93 Difference]: Finished difference Result 579 states and 806 transitions. [2019-09-08 12:31:30,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:31:30,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 12:31:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:30,196 INFO L225 Difference]: With dead ends: 579 [2019-09-08 12:31:30,196 INFO L226 Difference]: Without dead ends: 433 [2019-09-08 12:31:30,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 12:31:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-09-08 12:31:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 431. [2019-09-08 12:31:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-08 12:31:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 583 transitions. [2019-09-08 12:31:30,555 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 583 transitions. Word has length 136 [2019-09-08 12:31:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:30,555 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 583 transitions. [2019-09-08 12:31:30,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:31:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 583 transitions. [2019-09-08 12:31:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:31:30,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:30,556 INFO L399 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:30,556 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:30,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:30,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1599493294, now seen corresponding path program 1 times [2019-09-08 12:31:30,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:30,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:30,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:30,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:30,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:31:30,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:31:30,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:31:30,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:31:30,668 INFO L87 Difference]: Start difference. First operand 431 states and 583 transitions. Second operand 7 states. [2019-09-08 12:31:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:32,552 INFO L93 Difference]: Finished difference Result 1583 states and 2291 transitions. [2019-09-08 12:31:32,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:31:32,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-08 12:31:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:32,553 INFO L225 Difference]: With dead ends: 1583 [2019-09-08 12:31:32,553 INFO L226 Difference]: Without dead ends: 1301 [2019-09-08 12:31:32,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:31:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2019-09-08 12:31:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 751. [2019-09-08 12:31:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-09-08 12:31:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1059 transitions. [2019-09-08 12:31:33,231 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1059 transitions. Word has length 138 [2019-09-08 12:31:33,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:33,232 INFO L475 AbstractCegarLoop]: Abstraction has 751 states and 1059 transitions. [2019-09-08 12:31:33,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:31:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1059 transitions. [2019-09-08 12:31:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:31:33,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:33,233 INFO L399 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:33,233 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:33,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash 948532047, now seen corresponding path program 1 times [2019-09-08 12:31:33,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:33,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:33,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:33,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:33,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:33,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:31:33,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:31:33,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:31:33,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:31:33,312 INFO L87 Difference]: Start difference. First operand 751 states and 1059 transitions. Second operand 3 states. [2019-09-08 12:31:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:34,375 INFO L93 Difference]: Finished difference Result 1663 states and 2419 transitions. [2019-09-08 12:31:34,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:31:34,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 12:31:34,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:34,377 INFO L225 Difference]: With dead ends: 1663 [2019-09-08 12:31:34,377 INFO L226 Difference]: Without dead ends: 1061 [2019-09-08 12:31:34,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 12:31:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2019-09-08 12:31:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1059. [2019-09-08 12:31:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-09-08 12:31:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1513 transitions. [2019-09-08 12:31:35,361 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1513 transitions. Word has length 138 [2019-09-08 12:31:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:35,361 INFO L475 AbstractCegarLoop]: Abstraction has 1059 states and 1513 transitions. [2019-09-08 12:31:35,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:31:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1513 transitions. [2019-09-08 12:31:35,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:31:35,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:35,362 INFO L399 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:35,362 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:35,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:35,362 INFO L82 PathProgramCache]: Analyzing trace with hash 882038535, now seen corresponding path program 1 times [2019-09-08 12:31:35,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:35,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:35,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:35,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:35,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:35,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:35,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:35,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:31:35,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:31:35,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:31:35,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:31:35,440 INFO L87 Difference]: Start difference. First operand 1059 states and 1513 transitions. Second operand 3 states. [2019-09-08 12:31:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:37,460 INFO L93 Difference]: Finished difference Result 2811 states and 4099 transitions. [2019-09-08 12:31:37,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:31:37,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 12:31:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:37,462 INFO L225 Difference]: With dead ends: 2811 [2019-09-08 12:31:37,463 INFO L226 Difference]: Without dead ends: 1901 [2019-09-08 12:31:37,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 12:31:37,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2019-09-08 12:31:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1887. [2019-09-08 12:31:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1887 states. [2019-09-08 12:31:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2711 transitions. [2019-09-08 12:31:39,453 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2711 transitions. Word has length 138 [2019-09-08 12:31:39,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:39,454 INFO L475 AbstractCegarLoop]: Abstraction has 1887 states and 2711 transitions. [2019-09-08 12:31:39,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:31:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2711 transitions. [2019-09-08 12:31:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:31:39,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:39,455 INFO L399 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:39,455 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:39,455 INFO L82 PathProgramCache]: Analyzing trace with hash -820324690, now seen corresponding path program 1 times [2019-09-08 12:31:39,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:39,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:39,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:39,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:39,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:39,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:39,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:31:39,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:31:39,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:31:39,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:31:39,563 INFO L87 Difference]: Start difference. First operand 1887 states and 2711 transitions. Second operand 7 states. [2019-09-08 12:31:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:47,066 INFO L93 Difference]: Finished difference Result 7775 states and 11319 transitions. [2019-09-08 12:31:47,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:31:47,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-08 12:31:47,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:47,072 INFO L225 Difference]: With dead ends: 7775 [2019-09-08 12:31:47,072 INFO L226 Difference]: Without dead ends: 6037 [2019-09-08 12:31:47,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:31:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2019-09-08 12:31:51,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3863. [2019-09-08 12:31:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3863 states. [2019-09-08 12:31:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 5595 transitions. [2019-09-08 12:31:51,208 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 5595 transitions. Word has length 138 [2019-09-08 12:31:51,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:51,208 INFO L475 AbstractCegarLoop]: Abstraction has 3863 states and 5595 transitions. [2019-09-08 12:31:51,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:31:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 5595 transitions. [2019-09-08 12:31:51,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:31:51,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:51,209 INFO L399 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:31:51,210 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:51,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:51,210 INFO L82 PathProgramCache]: Analyzing trace with hash -456238930, now seen corresponding path program 1 times [2019-09-08 12:31:51,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:51,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:51,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:51,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:51,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:31:51,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:51,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:31:51,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:31:51,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:31:51,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:31:51,315 INFO L87 Difference]: Start difference. First operand 3863 states and 5595 transitions. Second operand 7 states. [2019-09-08 12:32:06,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:06,344 INFO L93 Difference]: Finished difference Result 17071 states and 24871 transitions. [2019-09-08 12:32:06,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:32:06,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-08 12:32:06,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:06,356 INFO L225 Difference]: With dead ends: 17071 [2019-09-08 12:32:06,356 INFO L226 Difference]: Without dead ends: 13357 [2019-09-08 12:32:06,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:32:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13357 states. [2019-09-08 12:32:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13357 to 8055. [2019-09-08 12:32:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8055 states. [2019-09-08 12:32:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8055 states to 8055 states and 11699 transitions. [2019-09-08 12:32:14,711 INFO L78 Accepts]: Start accepts. Automaton has 8055 states and 11699 transitions. Word has length 138 [2019-09-08 12:32:14,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:14,711 INFO L475 AbstractCegarLoop]: Abstraction has 8055 states and 11699 transitions. [2019-09-08 12:32:14,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:32:14,711 INFO L276 IsEmpty]: Start isEmpty. Operand 8055 states and 11699 transitions. [2019-09-08 12:32:14,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:32:14,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:14,714 INFO L399 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:14,714 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash 284220078, now seen corresponding path program 1 times [2019-09-08 12:32:14,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:14,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:14,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:14,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:14,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:14,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:14,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:32:14,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:32:14,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:32:14,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:32:14,822 INFO L87 Difference]: Start difference. First operand 8055 states and 11699 transitions. Second operand 7 states. [2019-09-08 12:32:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:45,510 INFO L93 Difference]: Finished difference Result 37343 states and 54375 transitions. [2019-09-08 12:32:45,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:32:45,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-08 12:32:45,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:45,537 INFO L225 Difference]: With dead ends: 37343 [2019-09-08 12:32:45,537 INFO L226 Difference]: Without dead ends: 29437 [2019-09-08 12:32:45,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:32:45,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29437 states. [2019-09-08 12:33:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29437 to 16919. [2019-09-08 12:33:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16919 states. [2019-09-08 12:33:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16919 states to 16919 states and 24579 transitions. [2019-09-08 12:33:03,771 INFO L78 Accepts]: Start accepts. Automaton has 16919 states and 24579 transitions. Word has length 138 [2019-09-08 12:33:03,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:03,771 INFO L475 AbstractCegarLoop]: Abstraction has 16919 states and 24579 transitions. [2019-09-08 12:33:03,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:33:03,771 INFO L276 IsEmpty]: Start isEmpty. Operand 16919 states and 24579 transitions. [2019-09-08 12:33:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:33:03,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:03,774 INFO L399 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:03,775 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:03,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:03,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2080219986, now seen corresponding path program 1 times [2019-09-08 12:33:03,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:03,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:03,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:03,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:03,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:33:03,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:33:03,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:33:03,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:33:03,883 INFO L87 Difference]: Start difference. First operand 16919 states and 24579 transitions. Second operand 7 states. [2019-09-08 12:33:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:53,025 INFO L93 Difference]: Finished difference Result 65931 states and 95945 transitions. [2019-09-08 12:33:53,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:33:53,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-09-08 12:33:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:53,072 INFO L225 Difference]: With dead ends: 65931 [2019-09-08 12:33:53,072 INFO L226 Difference]: Without dead ends: 49161 [2019-09-08 12:33:53,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:33:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49161 states. [2019-09-08 12:34:21,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49161 to 27575. [2019-09-08 12:34:21,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27575 states. [2019-09-08 12:34:21,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27575 states to 27575 states and 40083 transitions. [2019-09-08 12:34:21,363 INFO L78 Accepts]: Start accepts. Automaton has 27575 states and 40083 transitions. Word has length 138 [2019-09-08 12:34:21,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:21,364 INFO L475 AbstractCegarLoop]: Abstraction has 27575 states and 40083 transitions. [2019-09-08 12:34:21,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:34:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 27575 states and 40083 transitions. [2019-09-08 12:34:21,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:34:21,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:21,367 INFO L399 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:21,367 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:21,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:21,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1106690548, now seen corresponding path program 1 times [2019-09-08 12:34:21,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:21,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:21,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:21,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:21,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:21,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:21,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:34:21,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:34:21,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:34:21,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:34:21,465 INFO L87 Difference]: Start difference. First operand 27575 states and 40083 transitions. Second operand 6 states. [2019-09-08 12:35:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:12,514 INFO L93 Difference]: Finished difference Result 49519 states and 71103 transitions. [2019-09-08 12:35:12,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:35:12,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-09-08 12:35:12,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:12,561 INFO L225 Difference]: With dead ends: 49519 [2019-09-08 12:35:12,561 INFO L226 Difference]: Without dead ends: 49517 [2019-09-08 12:35:12,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:35:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49517 states. [2019-09-08 12:35:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49517 to 27959. [2019-09-08 12:35:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27959 states. [2019-09-08 12:35:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27959 states to 27959 states and 40403 transitions. [2019-09-08 12:35:41,953 INFO L78 Accepts]: Start accepts. Automaton has 27959 states and 40403 transitions. Word has length 139 [2019-09-08 12:35:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:41,953 INFO L475 AbstractCegarLoop]: Abstraction has 27959 states and 40403 transitions. [2019-09-08 12:35:41,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:35:41,953 INFO L276 IsEmpty]: Start isEmpty. Operand 27959 states and 40403 transitions. [2019-09-08 12:35:41,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 12:35:41,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:41,956 INFO L399 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:41,956 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:41,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:41,957 INFO L82 PathProgramCache]: Analyzing trace with hash -475105807, now seen corresponding path program 1 times [2019-09-08 12:35:41,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:41,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:41,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:41,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:41,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:35:42,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:42,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:35:42,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:35:42,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:35:42,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:35:42,067 INFO L87 Difference]: Start difference. First operand 27959 states and 40403 transitions. Second operand 7 states. [2019-09-08 12:36:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:45,936 INFO L93 Difference]: Finished difference Result 86783 states and 124791 transitions. [2019-09-08 12:36:45,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:36:45,936 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-08 12:36:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:45,994 INFO L225 Difference]: With dead ends: 86783 [2019-09-08 12:36:45,995 INFO L226 Difference]: Without dead ends: 58973 [2019-09-08 12:36:46,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:36:46,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58973 states.