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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:12:26,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:12:26,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:12:26,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:12:26,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:12:26,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:12:26,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:12:26,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:12:26,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:12:26,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:12:26,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:12:26,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:12:26,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:12:26,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:12:26,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:12:26,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:12:26,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:12:26,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:12:26,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:12:26,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:12:26,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:12:26,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:12:26,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:12:26,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:12:26,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:12:26,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:12:26,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:12:26,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:12:26,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:12:26,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:12:26,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:12:26,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:12:26,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:12:26,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:12:26,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:12:26,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:12:26,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:12:26,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:12:26,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:12:26,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:12:26,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:12:26,417 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 11:12:26,431 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:12:26,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:12:26,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:12:26,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:12:26,433 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:12:26,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:12:26,434 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:12:26,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:12:26,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:12:26,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:12:26,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:12:26,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:12:26,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:12:26,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:12:26,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:12:26,435 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:12:26,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:12:26,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:12:26,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:12:26,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:12:26,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:12:26,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:12:26,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:12:26,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:12:26,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:12:26,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:12:26,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:12:26,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:12:26,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:12:26,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:12:26,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:12:26,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:12:26,486 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:12:26,487 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:12:26,487 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 11:12:26,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71211bc7e/9382c1301ffc4cf6b5eff30badc65e49/FLAG19a177583 [2019-09-08 11:12:27,509 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:12:27,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 11:12:27,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71211bc7e/9382c1301ffc4cf6b5eff30badc65e49/FLAG19a177583 [2019-09-08 11:12:27,959 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71211bc7e/9382c1301ffc4cf6b5eff30badc65e49 [2019-09-08 11:12:27,970 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:12:27,972 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:12:27,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:12:27,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:12:27,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:12:27,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:12:27" (1/1) ... [2019-09-08 11:12:27,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e83ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:12:27, skipping insertion in model container [2019-09-08 11:12:27,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:12:27" (1/1) ... [2019-09-08 11:12:27,989 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:12:28,413 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:12:31,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:12:31,505 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:12:33,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:12:33,303 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:12:33,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:12:33 WrapperNode [2019-09-08 11:12:33,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:12:33,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:12:33,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:12:33,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:12:33,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:12:33" (1/1) ... [2019-09-08 11:12:33,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:12:33" (1/1) ... [2019-09-08 11:12:33,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:12:33" (1/1) ... [2019-09-08 11:12:33,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:12:33" (1/1) ... [2019-09-08 11:12:33,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:12:33" (1/1) ... [2019-09-08 11:12:33,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:12:33" (1/1) ... [2019-09-08 11:12:33,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:12:33" (1/1) ... [2019-09-08 11:12:33,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:12:33,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:12:33,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:12:33,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:12:33,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:12:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:12:33,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:12:33,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:12:33,866 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:12:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:12:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:12:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:12:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:12:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:12:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:12:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:12:33,867 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:12:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:12:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:12:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:12:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:12:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:12:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:12:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:12:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:12:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:12:33,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:12:47,299 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:12:47,300 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:12:47,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:12:47 BoogieIcfgContainer [2019-09-08 11:12:47,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:12:47,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:12:47,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:12:47,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:12:47,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:12:27" (1/3) ... [2019-09-08 11:12:47,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6ee310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:12:47, skipping insertion in model container [2019-09-08 11:12:47,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:12:33" (2/3) ... [2019-09-08 11:12:47,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6ee310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:12:47, skipping insertion in model container [2019-09-08 11:12:47,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:12:47" (3/3) ... [2019-09-08 11:12:47,313 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 11:12:47,323 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:12:47,346 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-09-08 11:12:47,363 INFO L252 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-09-08 11:12:47,426 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:12:47,427 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:12:47,427 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:12:47,427 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:12:47,427 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:12:47,428 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:12:47,428 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:12:47,428 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:12:47,428 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:12:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 6188 states. [2019-09-08 11:12:47,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:12:47,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:47,565 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] [2019-09-08 11:12:47,567 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:47,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1291767050, now seen corresponding path program 1 times [2019-09-08 11:12:47,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:47,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:47,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:47,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:47,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:48,436 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 11:12:48,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:48,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:12:48,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:12:48,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:12:48,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:12:48,461 INFO L87 Difference]: Start difference. First operand 6188 states. Second operand 5 states. [2019-09-08 11:12:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:55,367 INFO L93 Difference]: Finished difference Result 9231 states and 16410 transitions. [2019-09-08 11:12:55,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:12:55,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 11:12:55,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:55,466 INFO L225 Difference]: With dead ends: 9231 [2019-09-08 11:12:55,466 INFO L226 Difference]: Without dead ends: 5819 [2019-09-08 11:12:55,492 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 11:12:55,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5819 states. [2019-09-08 11:12:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5819 to 5789. [2019-09-08 11:12:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5789 states. [2019-09-08 11:12:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 7691 transitions. [2019-09-08 11:12:55,935 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 7691 transitions. Word has length 81 [2019-09-08 11:12:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:55,937 INFO L475 AbstractCegarLoop]: Abstraction has 5789 states and 7691 transitions. [2019-09-08 11:12:55,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:12:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 7691 transitions. [2019-09-08 11:12:55,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:12:55,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:55,967 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] [2019-09-08 11:12:55,968 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash -801511020, now seen corresponding path program 1 times [2019-09-08 11:12:55,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:55,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:55,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:55,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:55,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:56,736 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 11:12:56,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:56,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:12:56,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:12:56,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:12:56,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:12:56,743 INFO L87 Difference]: Start difference. First operand 5789 states and 7691 transitions. Second operand 9 states. [2019-09-08 11:13:10,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:10,298 INFO L93 Difference]: Finished difference Result 6482 states and 8672 transitions. [2019-09-08 11:13:10,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:13:10,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-08 11:13:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:10,330 INFO L225 Difference]: With dead ends: 6482 [2019-09-08 11:13:10,331 INFO L226 Difference]: Without dead ends: 6477 [2019-09-08 11:13:10,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:13:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6477 states. [2019-09-08 11:13:10,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6477 to 5789. [2019-09-08 11:13:10,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5789 states. [2019-09-08 11:13:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 7690 transitions. [2019-09-08 11:13:10,563 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 7690 transitions. Word has length 82 [2019-09-08 11:13:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:10,567 INFO L475 AbstractCegarLoop]: Abstraction has 5789 states and 7690 transitions. [2019-09-08 11:13:10,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:13:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 7690 transitions. [2019-09-08 11:13:10,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:13:10,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:10,584 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] [2019-09-08 11:13:10,585 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:10,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:10,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1546143278, now seen corresponding path program 1 times [2019-09-08 11:13:10,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:10,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:10,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:10,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:10,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:10,841 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 11:13:10,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:10,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:13:10,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:13:10,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:13:10,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:13:10,843 INFO L87 Difference]: Start difference. First operand 5789 states and 7690 transitions. Second operand 5 states. [2019-09-08 11:13:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:17,417 INFO L93 Difference]: Finished difference Result 11484 states and 15438 transitions. [2019-09-08 11:13:17,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:13:17,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 11:13:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:17,457 INFO L225 Difference]: With dead ends: 11484 [2019-09-08 11:13:17,458 INFO L226 Difference]: Without dead ends: 7764 [2019-09-08 11:13:17,466 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 11:13:17,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7764 states. [2019-09-08 11:13:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7764 to 7740. [2019-09-08 11:13:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7740 states. [2019-09-08 11:13:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7740 states to 7740 states and 10337 transitions. [2019-09-08 11:13:17,733 INFO L78 Accepts]: Start accepts. Automaton has 7740 states and 10337 transitions. Word has length 82 [2019-09-08 11:13:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:17,734 INFO L475 AbstractCegarLoop]: Abstraction has 7740 states and 10337 transitions. [2019-09-08 11:13:17,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:13:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 7740 states and 10337 transitions. [2019-09-08 11:13:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:13:17,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:17,752 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] [2019-09-08 11:13:17,752 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:17,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:17,753 INFO L82 PathProgramCache]: Analyzing trace with hash 517430368, now seen corresponding path program 1 times [2019-09-08 11:13:17,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:17,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:17,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:17,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:17,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:18,459 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 11:13:18,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:18,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:13:18,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:13:18,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:13:18,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:13:18,462 INFO L87 Difference]: Start difference. First operand 7740 states and 10337 transitions. Second operand 12 states. [2019-09-08 11:13:27,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:27,015 INFO L93 Difference]: Finished difference Result 18895 states and 26919 transitions. [2019-09-08 11:13:27,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 11:13:27,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2019-09-08 11:13:27,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:27,103 INFO L225 Difference]: With dead ends: 18895 [2019-09-08 11:13:27,103 INFO L226 Difference]: Without dead ends: 18453 [2019-09-08 11:13:27,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2019-09-08 11:13:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18453 states. [2019-09-08 11:13:27,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18453 to 7703. [2019-09-08 11:13:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7703 states. [2019-09-08 11:13:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7703 states to 7703 states and 10287 transitions. [2019-09-08 11:13:27,764 INFO L78 Accepts]: Start accepts. Automaton has 7703 states and 10287 transitions. Word has length 83 [2019-09-08 11:13:27,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:27,765 INFO L475 AbstractCegarLoop]: Abstraction has 7703 states and 10287 transitions. [2019-09-08 11:13:27,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:13:27,765 INFO L276 IsEmpty]: Start isEmpty. Operand 7703 states and 10287 transitions. [2019-09-08 11:13:27,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:13:27,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:27,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] [2019-09-08 11:13:27,789 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1731159645, now seen corresponding path program 1 times [2019-09-08 11:13:27,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:27,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:27,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:27,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:27,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:28,008 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 11:13:28,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:28,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:13:28,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:13:28,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:13:28,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:13:28,012 INFO L87 Difference]: Start difference. First operand 7703 states and 10287 transitions. Second operand 5 states. [2019-09-08 11:13:33,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:33,999 INFO L93 Difference]: Finished difference Result 15088 states and 20269 transitions. [2019-09-08 11:13:34,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:13:34,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-08 11:13:34,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:34,023 INFO L225 Difference]: With dead ends: 15088 [2019-09-08 11:13:34,023 INFO L226 Difference]: Without dead ends: 9708 [2019-09-08 11:13:34,038 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 11:13:34,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9708 states. [2019-09-08 11:13:34,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9708 to 9682. [2019-09-08 11:13:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9682 states. [2019-09-08 11:13:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9682 states to 9682 states and 12837 transitions. [2019-09-08 11:13:34,612 INFO L78 Accepts]: Start accepts. Automaton has 9682 states and 12837 transitions. Word has length 83 [2019-09-08 11:13:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:34,613 INFO L475 AbstractCegarLoop]: Abstraction has 9682 states and 12837 transitions. [2019-09-08 11:13:34,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:13:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 9682 states and 12837 transitions. [2019-09-08 11:13:34,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:13:34,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:34,629 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] [2019-09-08 11:13:34,630 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:34,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:34,630 INFO L82 PathProgramCache]: Analyzing trace with hash 960563928, now seen corresponding path program 1 times [2019-09-08 11:13:34,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:34,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:34,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:34,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:34,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:34,806 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 11:13:34,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:34,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:13:34,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:13:34,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:13:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:13:34,808 INFO L87 Difference]: Start difference. First operand 9682 states and 12837 transitions. Second operand 5 states. [2019-09-08 11:13:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:40,020 INFO L93 Difference]: Finished difference Result 17765 states and 23813 transitions. [2019-09-08 11:13:40,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:13:40,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-08 11:13:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:40,044 INFO L225 Difference]: With dead ends: 17765 [2019-09-08 11:13:40,044 INFO L226 Difference]: Without dead ends: 11635 [2019-09-08 11:13:40,061 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 11:13:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11635 states. [2019-09-08 11:13:40,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11635 to 11606. [2019-09-08 11:13:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11606 states. [2019-09-08 11:13:40,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11606 states to 11606 states and 15682 transitions. [2019-09-08 11:13:40,962 INFO L78 Accepts]: Start accepts. Automaton has 11606 states and 15682 transitions. Word has length 83 [2019-09-08 11:13:40,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:40,963 INFO L475 AbstractCegarLoop]: Abstraction has 11606 states and 15682 transitions. [2019-09-08 11:13:40,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:13:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand 11606 states and 15682 transitions. [2019-09-08 11:13:40,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:13:40,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:40,978 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] [2019-09-08 11:13:40,979 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:40,979 INFO L82 PathProgramCache]: Analyzing trace with hash -738216084, now seen corresponding path program 1 times [2019-09-08 11:13:40,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:40,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:40,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:40,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:40,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:41,171 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 11:13:41,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:41,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:13:41,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:13:41,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:13:41,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:13:41,174 INFO L87 Difference]: Start difference. First operand 11606 states and 15682 transitions. Second operand 6 states. [2019-09-08 11:13:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:46,381 INFO L93 Difference]: Finished difference Result 26846 states and 36621 transitions. [2019-09-08 11:13:46,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:13:46,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-08 11:13:46,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:46,418 INFO L225 Difference]: With dead ends: 26846 [2019-09-08 11:13:46,419 INFO L226 Difference]: Without dead ends: 19477 [2019-09-08 11:13:46,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:13:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19477 states. [2019-09-08 11:13:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19477 to 19445. [2019-09-08 11:13:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19445 states. [2019-09-08 11:13:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19445 states to 19445 states and 26492 transitions. [2019-09-08 11:13:47,875 INFO L78 Accepts]: Start accepts. Automaton has 19445 states and 26492 transitions. Word has length 84 [2019-09-08 11:13:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:47,875 INFO L475 AbstractCegarLoop]: Abstraction has 19445 states and 26492 transitions. [2019-09-08 11:13:47,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:13:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 19445 states and 26492 transitions. [2019-09-08 11:13:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:13:47,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:47,890 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] [2019-09-08 11:13:47,890 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:47,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:47,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1264971505, now seen corresponding path program 1 times [2019-09-08 11:13:47,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:47,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:47,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:47,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:47,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:48,232 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 11:13:48,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:48,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:13:48,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:13:48,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:13:48,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:13:48,234 INFO L87 Difference]: Start difference. First operand 19445 states and 26492 transitions. Second operand 10 states. [2019-09-08 11:14:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:05,155 INFO L93 Difference]: Finished difference Result 57287 states and 83632 transitions. [2019-09-08 11:14:05,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:14:05,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-09-08 11:14:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:05,238 INFO L225 Difference]: With dead ends: 57287 [2019-09-08 11:14:05,238 INFO L226 Difference]: Without dead ends: 52628 [2019-09-08 11:14:05,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 11:14:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52628 states. [2019-09-08 11:14:06,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52628 to 19452. [2019-09-08 11:14:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-09-08 11:14:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 26499 transitions. [2019-09-08 11:14:06,783 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 26499 transitions. Word has length 84 [2019-09-08 11:14:06,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:06,783 INFO L475 AbstractCegarLoop]: Abstraction has 19452 states and 26499 transitions. [2019-09-08 11:14:06,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:14:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 26499 transitions. [2019-09-08 11:14:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:14:06,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:06,796 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] [2019-09-08 11:14:06,796 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:06,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:06,797 INFO L82 PathProgramCache]: Analyzing trace with hash -150978572, now seen corresponding path program 1 times [2019-09-08 11:14:06,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:06,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:06,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:07,584 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 11:14:07,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:07,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 11:14:07,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 11:14:07,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 11:14:07,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:14:07,586 INFO L87 Difference]: Start difference. First operand 19452 states and 26499 transitions. Second operand 15 states. [2019-09-08 11:14:08,462 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 11:14:08,710 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-08 11:14:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:22,585 INFO L93 Difference]: Finished difference Result 57189 states and 83190 transitions. [2019-09-08 11:14:22,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:14:22,586 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2019-09-08 11:14:22,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:22,674 INFO L225 Difference]: With dead ends: 57189 [2019-09-08 11:14:22,674 INFO L226 Difference]: Without dead ends: 57185 [2019-09-08 11:14:22,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=269, Invalid=921, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 11:14:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57185 states. [2019-09-08 11:14:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57185 to 19448. [2019-09-08 11:14:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19448 states. [2019-09-08 11:14:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19448 states to 19448 states and 26494 transitions. [2019-09-08 11:14:24,601 INFO L78 Accepts]: Start accepts. Automaton has 19448 states and 26494 transitions. Word has length 85 [2019-09-08 11:14:24,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:24,602 INFO L475 AbstractCegarLoop]: Abstraction has 19448 states and 26494 transitions. [2019-09-08 11:14:24,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 11:14:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand 19448 states and 26494 transitions. [2019-09-08 11:14:24,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:14:24,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:24,617 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] [2019-09-08 11:14:24,617 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:24,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:24,618 INFO L82 PathProgramCache]: Analyzing trace with hash -131175961, now seen corresponding path program 1 times [2019-09-08 11:14:24,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:24,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:24,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:24,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:24,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:24,840 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 11:14:24,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:24,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:14:24,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:14:24,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:14:24,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:14:24,841 INFO L87 Difference]: Start difference. First operand 19448 states and 26494 transitions. Second operand 9 states. [2019-09-08 11:14:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:36,221 INFO L93 Difference]: Finished difference Result 29402 states and 41048 transitions. [2019-09-08 11:14:36,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:14:36,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-09-08 11:14:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:36,258 INFO L225 Difference]: With dead ends: 29402 [2019-09-08 11:14:36,258 INFO L226 Difference]: Without dead ends: 29394 [2019-09-08 11:14:36,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:14:36,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29394 states. [2019-09-08 11:14:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29394 to 19448. [2019-09-08 11:14:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19448 states. [2019-09-08 11:14:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19448 states to 19448 states and 26493 transitions. [2019-09-08 11:14:38,057 INFO L78 Accepts]: Start accepts. Automaton has 19448 states and 26493 transitions. Word has length 85 [2019-09-08 11:14:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:38,057 INFO L475 AbstractCegarLoop]: Abstraction has 19448 states and 26493 transitions. [2019-09-08 11:14:38,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:14:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 19448 states and 26493 transitions. [2019-09-08 11:14:38,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:14:38,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:38,070 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] [2019-09-08 11:14:38,070 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:38,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:38,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1225382710, now seen corresponding path program 1 times [2019-09-08 11:14:38,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:38,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:38,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:38,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:38,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 11:14:38,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:38,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:14:38,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:14:38,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:14:38,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:14:38,313 INFO L87 Difference]: Start difference. First operand 19448 states and 26493 transitions. Second operand 9 states. [2019-09-08 11:14:49,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:49,710 INFO L93 Difference]: Finished difference Result 35029 states and 49996 transitions. [2019-09-08 11:14:49,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:14:49,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-09-08 11:14:49,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:49,742 INFO L225 Difference]: With dead ends: 35029 [2019-09-08 11:14:49,742 INFO L226 Difference]: Without dead ends: 30571 [2019-09-08 11:14:49,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:14:49,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30571 states. [2019-09-08 11:14:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30571 to 19448. [2019-09-08 11:14:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19448 states. [2019-09-08 11:14:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19448 states to 19448 states and 26491 transitions. [2019-09-08 11:14:51,365 INFO L78 Accepts]: Start accepts. Automaton has 19448 states and 26491 transitions. Word has length 86 [2019-09-08 11:14:51,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:51,365 INFO L475 AbstractCegarLoop]: Abstraction has 19448 states and 26491 transitions. [2019-09-08 11:14:51,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:14:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 19448 states and 26491 transitions. [2019-09-08 11:14:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:14:51,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:51,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] [2019-09-08 11:14:51,377 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:51,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:51,377 INFO L82 PathProgramCache]: Analyzing trace with hash 337059138, now seen corresponding path program 1 times [2019-09-08 11:14:51,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:51,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:51,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:51,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:51,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:51,641 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 11:14:51,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:51,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:14:51,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:14:51,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:14:51,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:14:51,643 INFO L87 Difference]: Start difference. First operand 19448 states and 26491 transitions. Second operand 10 states. [2019-09-08 11:14:52,736 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2019-09-08 11:15:10,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:10,761 INFO L93 Difference]: Finished difference Result 57258 states and 83513 transitions. [2019-09-08 11:15:10,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 11:15:10,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-09-08 11:15:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:10,818 INFO L225 Difference]: With dead ends: 57258 [2019-09-08 11:15:10,818 INFO L226 Difference]: Without dead ends: 52603 [2019-09-08 11:15:10,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 11:15:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52603 states. [2019-09-08 11:15:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52603 to 19455. [2019-09-08 11:15:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19455 states. [2019-09-08 11:15:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19455 states to 19455 states and 26498 transitions. [2019-09-08 11:15:12,697 INFO L78 Accepts]: Start accepts. Automaton has 19455 states and 26498 transitions. Word has length 86 [2019-09-08 11:15:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:12,697 INFO L475 AbstractCegarLoop]: Abstraction has 19455 states and 26498 transitions. [2019-09-08 11:15:12,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:15:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 19455 states and 26498 transitions. [2019-09-08 11:15:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:15:12,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:12,709 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] [2019-09-08 11:15:12,709 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:12,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:12,710 INFO L82 PathProgramCache]: Analyzing trace with hash -197149534, now seen corresponding path program 1 times [2019-09-08 11:15:12,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:12,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:12,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:12,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:12,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:12,963 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 11:15:12,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:12,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:15:12,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:15:12,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:15:12,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:15:12,965 INFO L87 Difference]: Start difference. First operand 19455 states and 26498 transitions. Second operand 10 states. [2019-09-08 11:15:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:31,736 INFO L93 Difference]: Finished difference Result 50308 states and 73050 transitions. [2019-09-08 11:15:31,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 11:15:31,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-09-08 11:15:31,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:31,786 INFO L225 Difference]: With dead ends: 50308 [2019-09-08 11:15:31,786 INFO L226 Difference]: Without dead ends: 45805 [2019-09-08 11:15:31,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2019-09-08 11:15:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45805 states. [2019-09-08 11:15:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45805 to 19406. [2019-09-08 11:15:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19406 states. [2019-09-08 11:15:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19406 states to 19406 states and 26428 transitions. [2019-09-08 11:15:35,304 INFO L78 Accepts]: Start accepts. Automaton has 19406 states and 26428 transitions. Word has length 86 [2019-09-08 11:15:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:35,305 INFO L475 AbstractCegarLoop]: Abstraction has 19406 states and 26428 transitions. [2019-09-08 11:15:35,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:15:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 19406 states and 26428 transitions. [2019-09-08 11:15:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:15:35,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:35,318 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] [2019-09-08 11:15:35,319 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:35,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:35,319 INFO L82 PathProgramCache]: Analyzing trace with hash -259498320, now seen corresponding path program 1 times [2019-09-08 11:15:35,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:35,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:35,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:35,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:35,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:35,795 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 11:15:35,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:35,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:15:35,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:15:35,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:15:35,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:15:35,797 INFO L87 Difference]: Start difference. First operand 19406 states and 26428 transitions. Second operand 13 states. [2019-09-08 11:15:36,264 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-09-08 11:15:36,416 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-08 11:15:36,596 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-08 11:15:37,083 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-08 11:15:37,553 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-08 11:15:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:48,521 INFO L93 Difference]: Finished difference Result 49586 states and 72315 transitions. [2019-09-08 11:15:48,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:15:48,522 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-09-08 11:15:48,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:48,567 INFO L225 Difference]: With dead ends: 49586 [2019-09-08 11:15:48,567 INFO L226 Difference]: Without dead ends: 45023 [2019-09-08 11:15:48,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:15:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45023 states. [2019-09-08 11:15:51,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45023 to 19374. [2019-09-08 11:15:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19374 states. [2019-09-08 11:15:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19374 states to 19374 states and 26389 transitions. [2019-09-08 11:15:51,095 INFO L78 Accepts]: Start accepts. Automaton has 19374 states and 26389 transitions. Word has length 86 [2019-09-08 11:15:51,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:51,095 INFO L475 AbstractCegarLoop]: Abstraction has 19374 states and 26389 transitions. [2019-09-08 11:15:51,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:15:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 19374 states and 26389 transitions. [2019-09-08 11:15:51,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:15:51,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:51,110 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] [2019-09-08 11:15:51,111 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:51,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:51,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1761274596, now seen corresponding path program 1 times [2019-09-08 11:15:51,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:51,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:51,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:51,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:51,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:51,312 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 11:15:51,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:51,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:15:51,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:15:51,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:15:51,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:15:51,314 INFO L87 Difference]: Start difference. First operand 19374 states and 26389 transitions. Second operand 9 states. [2019-09-08 11:16:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:07,753 INFO L93 Difference]: Finished difference Result 45204 states and 65397 transitions. [2019-09-08 11:16:07,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:16:07,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 11:16:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:07,794 INFO L225 Difference]: With dead ends: 45204 [2019-09-08 11:16:07,795 INFO L226 Difference]: Without dead ends: 40718 [2019-09-08 11:16:07,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:16:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40718 states. [2019-09-08 11:16:10,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40718 to 19374. [2019-09-08 11:16:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19374 states. [2019-09-08 11:16:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19374 states to 19374 states and 26387 transitions. [2019-09-08 11:16:10,434 INFO L78 Accepts]: Start accepts. Automaton has 19374 states and 26387 transitions. Word has length 87 [2019-09-08 11:16:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:10,435 INFO L475 AbstractCegarLoop]: Abstraction has 19374 states and 26387 transitions. [2019-09-08 11:16:10,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:16:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 19374 states and 26387 transitions. [2019-09-08 11:16:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:16:10,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:10,450 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] [2019-09-08 11:16:10,451 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:10,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:10,451 INFO L82 PathProgramCache]: Analyzing trace with hash -973081306, now seen corresponding path program 1 times [2019-09-08 11:16:10,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:10,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:10,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:10,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:10,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:10,681 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 11:16:10,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:10,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:16:10,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:16:10,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:16:10,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:16:10,683 INFO L87 Difference]: Start difference. First operand 19374 states and 26387 transitions. Second operand 9 states. [2019-09-08 11:16:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:28,551 INFO L93 Difference]: Finished difference Result 49634 states and 72999 transitions. [2019-09-08 11:16:28,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:16:28,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 11:16:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:28,598 INFO L225 Difference]: With dead ends: 49634 [2019-09-08 11:16:28,598 INFO L226 Difference]: Without dead ends: 45048 [2019-09-08 11:16:28,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:16:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45048 states. [2019-09-08 11:16:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45048 to 19374. [2019-09-08 11:16:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19374 states. [2019-09-08 11:16:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19374 states to 19374 states and 26385 transitions. [2019-09-08 11:16:32,166 INFO L78 Accepts]: Start accepts. Automaton has 19374 states and 26385 transitions. Word has length 87 [2019-09-08 11:16:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:32,166 INFO L475 AbstractCegarLoop]: Abstraction has 19374 states and 26385 transitions. [2019-09-08 11:16:32,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:16:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 19374 states and 26385 transitions. [2019-09-08 11:16:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:16:32,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:32,178 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] [2019-09-08 11:16:32,178 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:32,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:32,179 INFO L82 PathProgramCache]: Analyzing trace with hash -618593868, now seen corresponding path program 1 times [2019-09-08 11:16:32,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:32,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:32,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:32,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:32,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:32,559 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 11:16:32,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:32,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:16:32,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:16:32,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:16:32,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:16:32,560 INFO L87 Difference]: Start difference. First operand 19374 states and 26385 transitions. Second operand 12 states. [2019-09-08 11:16:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:48,112 INFO L93 Difference]: Finished difference Result 45582 states and 65756 transitions. [2019-09-08 11:16:48,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:16:48,113 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-08 11:16:48,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:48,154 INFO L225 Difference]: With dead ends: 45582 [2019-09-08 11:16:48,154 INFO L226 Difference]: Without dead ends: 45578 [2019-09-08 11:16:48,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:16:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45578 states. [2019-09-08 11:16:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45578 to 19370. [2019-09-08 11:16:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19370 states. [2019-09-08 11:16:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19370 states to 19370 states and 26381 transitions. [2019-09-08 11:16:50,681 INFO L78 Accepts]: Start accepts. Automaton has 19370 states and 26381 transitions. Word has length 87 [2019-09-08 11:16:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:50,681 INFO L475 AbstractCegarLoop]: Abstraction has 19370 states and 26381 transitions. [2019-09-08 11:16:50,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:16:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 19370 states and 26381 transitions. [2019-09-08 11:16:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:16:50,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:50,694 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] [2019-09-08 11:16:50,694 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:50,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:50,694 INFO L82 PathProgramCache]: Analyzing trace with hash 933067154, now seen corresponding path program 1 times [2019-09-08 11:16:50,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:50,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:50,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:50,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:50,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:50,999 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 11:16:50,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:51,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:16:51,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:16:51,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:16:51,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:16:51,001 INFO L87 Difference]: Start difference. First operand 19370 states and 26381 transitions. Second operand 9 states. [2019-09-08 11:17:05,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:05,169 INFO L93 Difference]: Finished difference Result 31707 states and 45232 transitions. [2019-09-08 11:17:05,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:17:05,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 11:17:05,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:05,204 INFO L225 Difference]: With dead ends: 31707 [2019-09-08 11:17:05,204 INFO L226 Difference]: Without dead ends: 31697 [2019-09-08 11:17:05,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:17:05,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31697 states. [2019-09-08 11:17:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31697 to 19370. [2019-09-08 11:17:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19370 states. [2019-09-08 11:17:07,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19370 states to 19370 states and 26380 transitions. [2019-09-08 11:17:07,862 INFO L78 Accepts]: Start accepts. Automaton has 19370 states and 26380 transitions. Word has length 87 [2019-09-08 11:17:07,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:07,862 INFO L475 AbstractCegarLoop]: Abstraction has 19370 states and 26380 transitions. [2019-09-08 11:17:07,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:17:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 19370 states and 26380 transitions. [2019-09-08 11:17:07,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:17:07,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:07,876 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] [2019-09-08 11:17:07,876 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:07,876 INFO L82 PathProgramCache]: Analyzing trace with hash 259041370, now seen corresponding path program 1 times [2019-09-08 11:17:07,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:07,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:07,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:07,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:07,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:08,077 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 11:17:08,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:08,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:17:08,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:17:08,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:17:08,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:17:08,079 INFO L87 Difference]: Start difference. First operand 19370 states and 26380 transitions. Second operand 9 states. [2019-09-08 11:17:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:27,352 INFO L93 Difference]: Finished difference Result 49532 states and 72868 transitions. [2019-09-08 11:17:27,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:17:27,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 11:17:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:27,399 INFO L225 Difference]: With dead ends: 49532 [2019-09-08 11:17:27,399 INFO L226 Difference]: Without dead ends: 45044 [2019-09-08 11:17:27,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:17:27,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45044 states. [2019-09-08 11:17:30,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45044 to 19370. [2019-09-08 11:17:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19370 states. [2019-09-08 11:17:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19370 states to 19370 states and 26379 transitions. [2019-09-08 11:17:30,208 INFO L78 Accepts]: Start accepts. Automaton has 19370 states and 26379 transitions. Word has length 87 [2019-09-08 11:17:30,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:30,208 INFO L475 AbstractCegarLoop]: Abstraction has 19370 states and 26379 transitions. [2019-09-08 11:17:30,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:17:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 19370 states and 26379 transitions. [2019-09-08 11:17:30,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:17:30,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:30,220 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] [2019-09-08 11:17:30,221 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:30,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:30,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2069024480, now seen corresponding path program 1 times [2019-09-08 11:17:30,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:30,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:30,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:30,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:30,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:30,437 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 11:17:30,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:30,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:17:30,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:17:30,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:17:30,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:17:30,439 INFO L87 Difference]: Start difference. First operand 19370 states and 26379 transitions. Second operand 9 states. [2019-09-08 11:17:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:47,272 INFO L93 Difference]: Finished difference Result 45167 states and 65346 transitions. [2019-09-08 11:17:47,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:17:47,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-08 11:17:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:47,315 INFO L225 Difference]: With dead ends: 45167 [2019-09-08 11:17:47,315 INFO L226 Difference]: Without dead ends: 40709 [2019-09-08 11:17:47,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:17:47,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40709 states. [2019-09-08 11:17:50,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40709 to 19370. [2019-09-08 11:17:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19370 states. [2019-09-08 11:17:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19370 states to 19370 states and 26378 transitions. [2019-09-08 11:17:50,256 INFO L78 Accepts]: Start accepts. Automaton has 19370 states and 26378 transitions. Word has length 87 [2019-09-08 11:17:50,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:50,257 INFO L475 AbstractCegarLoop]: Abstraction has 19370 states and 26378 transitions. [2019-09-08 11:17:50,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:17:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 19370 states and 26378 transitions. [2019-09-08 11:17:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:17:50,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:50,269 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] [2019-09-08 11:17:50,270 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:50,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:50,270 INFO L82 PathProgramCache]: Analyzing trace with hash 198764564, now seen corresponding path program 1 times [2019-09-08 11:17:50,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:50,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:50,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:50,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:50,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:50,503 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 11:17:50,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:50,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:17:50,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:17:50,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:17:50,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:17:50,505 INFO L87 Difference]: Start difference. First operand 19370 states and 26378 transitions. Second operand 10 states. [2019-09-08 11:18:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:12,265 INFO L93 Difference]: Finished difference Result 50403 states and 73152 transitions. [2019-09-08 11:18:12,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 11:18:12,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-09-08 11:18:12,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:12,314 INFO L225 Difference]: With dead ends: 50403 [2019-09-08 11:18:12,314 INFO L226 Difference]: Without dead ends: 45769 [2019-09-08 11:18:12,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2019-09-08 11:18:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45769 states. [2019-09-08 11:18:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45769 to 19370. [2019-09-08 11:18:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19370 states. [2019-09-08 11:18:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19370 states to 19370 states and 26377 transitions. [2019-09-08 11:18:15,317 INFO L78 Accepts]: Start accepts. Automaton has 19370 states and 26377 transitions. Word has length 87 [2019-09-08 11:18:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:15,318 INFO L475 AbstractCegarLoop]: Abstraction has 19370 states and 26377 transitions. [2019-09-08 11:18:15,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:18:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 19370 states and 26377 transitions. [2019-09-08 11:18:15,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:18:15,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:15,332 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] [2019-09-08 11:18:15,332 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:15,332 INFO L82 PathProgramCache]: Analyzing trace with hash 546832817, now seen corresponding path program 1 times [2019-09-08 11:18:15,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:15,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:15,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:15,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:15,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:15,432 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 11:18:15,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:15,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:18:15,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:18:15,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:18:15,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:18:15,433 INFO L87 Difference]: Start difference. First operand 19370 states and 26377 transitions. Second operand 3 states. [2019-09-08 11:18:18,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:18,965 INFO L93 Difference]: Finished difference Result 29661 states and 41358 transitions. [2019-09-08 11:18:18,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:18:18,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-08 11:18:18,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:18,987 INFO L225 Difference]: With dead ends: 29661 [2019-09-08 11:18:18,988 INFO L226 Difference]: Without dead ends: 18806 [2019-09-08 11:18:19,000 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 11:18:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18806 states. [2019-09-08 11:18:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18806 to 18792. [2019-09-08 11:18:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18792 states. [2019-09-08 11:18:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18792 states to 18792 states and 26106 transitions. [2019-09-08 11:18:22,317 INFO L78 Accepts]: Start accepts. Automaton has 18792 states and 26106 transitions. Word has length 88 [2019-09-08 11:18:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:22,318 INFO L475 AbstractCegarLoop]: Abstraction has 18792 states and 26106 transitions. [2019-09-08 11:18:22,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:18:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 18792 states and 26106 transitions. [2019-09-08 11:18:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:18:22,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:22,328 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] [2019-09-08 11:18:22,329 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:22,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:22,329 INFO L82 PathProgramCache]: Analyzing trace with hash -382656533, now seen corresponding path program 1 times [2019-09-08 11:18:22,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:22,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:22,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:22,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:22,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:22,449 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 11:18:22,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:22,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:18:22,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:18:22,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:18:22,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:18:22,451 INFO L87 Difference]: Start difference. First operand 18792 states and 26106 transitions. Second operand 3 states. [2019-09-08 11:18:28,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:28,276 INFO L93 Difference]: Finished difference Result 38565 states and 55078 transitions. [2019-09-08 11:18:28,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:18:28,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-08 11:18:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:28,310 INFO L225 Difference]: With dead ends: 38565 [2019-09-08 11:18:28,310 INFO L226 Difference]: Without dead ends: 29350 [2019-09-08 11:18:28,321 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 11:18:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29350 states. [2019-09-08 11:18:34,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29350 to 29336. [2019-09-08 11:18:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29336 states. [2019-09-08 11:18:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29336 states to 29336 states and 41176 transitions. [2019-09-08 11:18:34,232 INFO L78 Accepts]: Start accepts. Automaton has 29336 states and 41176 transitions. Word has length 88 [2019-09-08 11:18:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:34,233 INFO L475 AbstractCegarLoop]: Abstraction has 29336 states and 41176 transitions. [2019-09-08 11:18:34,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:18:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 29336 states and 41176 transitions. [2019-09-08 11:18:34,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:18:34,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:34,247 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] [2019-09-08 11:18:34,248 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:34,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:34,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1486761653, now seen corresponding path program 1 times [2019-09-08 11:18:34,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:34,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:34,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:34,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:34,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:34,338 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 11:18:34,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:34,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:18:34,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:18:34,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:18:34,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:18:34,340 INFO L87 Difference]: Start difference. First operand 29336 states and 41176 transitions. Second operand 3 states. [2019-09-08 11:18:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:45,963 INFO L93 Difference]: Finished difference Result 62794 states and 90340 transitions. [2019-09-08 11:18:45,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:18:45,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-08 11:18:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:46,020 INFO L225 Difference]: With dead ends: 62794 [2019-09-08 11:18:46,021 INFO L226 Difference]: Without dead ends: 48063 [2019-09-08 11:18:46,041 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 11:18:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48063 states. [2019-09-08 11:18:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48063 to 48034. [2019-09-08 11:18:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48034 states. [2019-09-08 11:18:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48034 states to 48034 states and 67607 transitions. [2019-09-08 11:18:56,092 INFO L78 Accepts]: Start accepts. Automaton has 48034 states and 67607 transitions. Word has length 88 [2019-09-08 11:18:56,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:56,092 INFO L475 AbstractCegarLoop]: Abstraction has 48034 states and 67607 transitions. [2019-09-08 11:18:56,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:18:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 48034 states and 67607 transitions. [2019-09-08 11:18:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:18:56,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:56,112 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] [2019-09-08 11:18:56,112 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1651671834, now seen corresponding path program 1 times [2019-09-08 11:18:56,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:56,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:56,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:56,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:56,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:56,227 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 11:18:56,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:56,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:18:56,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:18:56,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:18:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:18:56,229 INFO L87 Difference]: Start difference. First operand 48034 states and 67607 transitions. Second operand 3 states. [2019-09-08 11:19:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:11,416 INFO L93 Difference]: Finished difference Result 84272 states and 122926 transitions. [2019-09-08 11:19:11,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:19:11,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-08 11:19:11,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:11,479 INFO L225 Difference]: With dead ends: 84272 [2019-09-08 11:19:11,479 INFO L226 Difference]: Without dead ends: 57590 [2019-09-08 11:19:11,511 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 11:19:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57590 states. [2019-09-08 11:19:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57590 to 46535. [2019-09-08 11:19:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46535 states. [2019-09-08 11:19:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46535 states to 46535 states and 66215 transitions. [2019-09-08 11:19:22,848 INFO L78 Accepts]: Start accepts. Automaton has 46535 states and 66215 transitions. Word has length 88 [2019-09-08 11:19:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:22,848 INFO L475 AbstractCegarLoop]: Abstraction has 46535 states and 66215 transitions. [2019-09-08 11:19:22,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:19:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 46535 states and 66215 transitions. [2019-09-08 11:19:22,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:19:22,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:22,864 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] [2019-09-08 11:19:22,864 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:22,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:22,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1164909041, now seen corresponding path program 1 times [2019-09-08 11:19:22,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:22,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:22,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:22,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:22,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:22,958 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 11:19:22,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:22,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:19:22,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:19:22,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:19:22,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:19:22,960 INFO L87 Difference]: Start difference. First operand 46535 states and 66215 transitions. Second operand 3 states. [2019-09-08 11:19:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:37,517 INFO L93 Difference]: Finished difference Result 85601 states and 124707 transitions. [2019-09-08 11:19:37,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:19:37,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-08 11:19:37,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:37,584 INFO L225 Difference]: With dead ends: 85601 [2019-09-08 11:19:37,584 INFO L226 Difference]: Without dead ends: 47063 [2019-09-08 11:19:37,619 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 11:19:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47063 states. [2019-09-08 11:19:47,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47063 to 38475. [2019-09-08 11:19:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38475 states. [2019-09-08 11:19:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38475 states to 38475 states and 55708 transitions. [2019-09-08 11:19:47,885 INFO L78 Accepts]: Start accepts. Automaton has 38475 states and 55708 transitions. Word has length 88 [2019-09-08 11:19:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:47,885 INFO L475 AbstractCegarLoop]: Abstraction has 38475 states and 55708 transitions. [2019-09-08 11:19:47,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:19:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 38475 states and 55708 transitions. [2019-09-08 11:19:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:19:47,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:47,897 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] [2019-09-08 11:19:47,898 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:47,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:47,898 INFO L82 PathProgramCache]: Analyzing trace with hash 860766840, now seen corresponding path program 1 times [2019-09-08 11:19:47,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:47,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:47,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:47,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:47,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:48,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 11:19:48,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:48,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:19:48,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:19:48,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:19:48,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:19:48,410 INFO L87 Difference]: Start difference. First operand 38475 states and 55708 transitions. Second operand 13 states. [2019-09-08 11:19:48,907 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 11:19:49,136 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 11:19:50,097 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-08 11:20:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:20:33,010 INFO L93 Difference]: Finished difference Result 119312 states and 176996 transitions. [2019-09-08 11:20:33,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:20:33,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2019-09-08 11:20:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:20:33,160 INFO L225 Difference]: With dead ends: 119312 [2019-09-08 11:20:33,160 INFO L226 Difference]: Without dead ends: 119299 [2019-09-08 11:20:33,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:20:33,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119299 states. [2019-09-08 11:20:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119299 to 38462. [2019-09-08 11:20:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38462 states. [2019-09-08 11:20:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38462 states to 38462 states and 55695 transitions. [2019-09-08 11:20:44,862 INFO L78 Accepts]: Start accepts. Automaton has 38462 states and 55695 transitions. Word has length 88 [2019-09-08 11:20:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:20:44,863 INFO L475 AbstractCegarLoop]: Abstraction has 38462 states and 55695 transitions. [2019-09-08 11:20:44,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:20:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 38462 states and 55695 transitions. [2019-09-08 11:20:44,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:20:44,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:20:44,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] [2019-09-08 11:20:44,873 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:20:44,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:20:44,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1288774228, now seen corresponding path program 1 times [2019-09-08 11:20:44,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:20:44,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:20:44,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:44,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:20:44,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:20:45,094 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 11:20:45,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:20:45,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:20:45,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:20:45,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:20:45,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:20:45,096 INFO L87 Difference]: Start difference. First operand 38462 states and 55695 transitions. Second operand 9 states. [2019-09-08 11:21:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:25,931 INFO L93 Difference]: Finished difference Result 93838 states and 138312 transitions. [2019-09-08 11:21:25,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 11:21:25,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 11:21:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:26,038 INFO L225 Difference]: With dead ends: 93838 [2019-09-08 11:21:26,038 INFO L226 Difference]: Without dead ends: 91966 [2019-09-08 11:21:26,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:21:26,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91966 states. [2019-09-08 11:21:37,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91966 to 38446. [2019-09-08 11:21:37,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38446 states. [2019-09-08 11:21:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38446 states to 38446 states and 55671 transitions. [2019-09-08 11:21:37,606 INFO L78 Accepts]: Start accepts. Automaton has 38446 states and 55671 transitions. Word has length 88 [2019-09-08 11:21:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:37,607 INFO L475 AbstractCegarLoop]: Abstraction has 38446 states and 55671 transitions. [2019-09-08 11:21:37,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:21:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 38446 states and 55671 transitions. [2019-09-08 11:21:37,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:21:37,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:37,617 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] [2019-09-08 11:21:37,618 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:37,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:37,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1923738534, now seen corresponding path program 1 times [2019-09-08 11:21:37,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:37,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:37,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:37,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:37,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:37,712 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 11:21:37,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:37,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:37,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:37,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:37,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:37,713 INFO L87 Difference]: Start difference. First operand 38446 states and 55671 transitions. Second operand 3 states. [2019-09-08 11:21:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:58,509 INFO L93 Difference]: Finished difference Result 96534 states and 142462 transitions. [2019-09-08 11:21:58,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:58,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-08 11:21:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:58,589 INFO L225 Difference]: With dead ends: 96534 [2019-09-08 11:21:58,589 INFO L226 Difference]: Without dead ends: 66365 [2019-09-08 11:21:58,617 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 11:21:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66365 states. [2019-09-08 11:22:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66365 to 57191. [2019-09-08 11:22:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57191 states. [2019-09-08 11:22:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57191 states to 57191 states and 82624 transitions. [2019-09-08 11:22:18,981 INFO L78 Accepts]: Start accepts. Automaton has 57191 states and 82624 transitions. Word has length 88 [2019-09-08 11:22:18,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:22:18,982 INFO L475 AbstractCegarLoop]: Abstraction has 57191 states and 82624 transitions. [2019-09-08 11:22:18,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:22:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 57191 states and 82624 transitions. [2019-09-08 11:22:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:22:18,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:22:18,995 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] [2019-09-08 11:22:18,995 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:22:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:22:18,995 INFO L82 PathProgramCache]: Analyzing trace with hash -556215029, now seen corresponding path program 1 times [2019-09-08 11:22:18,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:22:18,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:22:18,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:18,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:22:18,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:22:19,070 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 11:22:19,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:22:19,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:22:19,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:22:19,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:22:19,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:22:19,072 INFO L87 Difference]: Start difference. First operand 57191 states and 82624 transitions. Second operand 3 states. [2019-09-08 11:22:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:22:42,405 INFO L93 Difference]: Finished difference Result 116912 states and 171080 transitions. [2019-09-08 11:22:42,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:22:42,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-09-08 11:22:42,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:22:42,482 INFO L225 Difference]: With dead ends: 116912 [2019-09-08 11:22:42,482 INFO L226 Difference]: Without dead ends: 64695 [2019-09-08 11:22:42,517 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 11:22:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64695 states. [2019-09-08 11:23:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64695 to 51718. [2019-09-08 11:23:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51718 states. [2019-09-08 11:23:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51718 states to 51718 states and 75528 transitions. [2019-09-08 11:23:02,412 INFO L78 Accepts]: Start accepts. Automaton has 51718 states and 75528 transitions. Word has length 89 [2019-09-08 11:23:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:02,413 INFO L475 AbstractCegarLoop]: Abstraction has 51718 states and 75528 transitions. [2019-09-08 11:23:02,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:23:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 51718 states and 75528 transitions. [2019-09-08 11:23:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:23:02,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:02,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] [2019-09-08 11:23:02,423 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:02,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:02,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1120036254, now seen corresponding path program 1 times [2019-09-08 11:23:02,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:02,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:02,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:02,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:02,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:02,654 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 11:23:02,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:02,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:23:02,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:23:02,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:23:02,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:23:02,655 INFO L87 Difference]: Start difference. First operand 51718 states and 75528 transitions. Second operand 10 states. [2019-09-08 11:24:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:26,239 INFO L93 Difference]: Finished difference Result 190394 states and 281194 transitions. [2019-09-08 11:24:26,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 11:24:26,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-08 11:24:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:26,563 INFO L225 Difference]: With dead ends: 190394 [2019-09-08 11:24:26,564 INFO L226 Difference]: Without dead ends: 189633 [2019-09-08 11:24:26,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-09-08 11:24:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189633 states. [2019-09-08 11:24:49,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189633 to 51689. [2019-09-08 11:24:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51689 states. [2019-09-08 11:24:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51689 states to 51689 states and 75489 transitions. [2019-09-08 11:24:49,210 INFO L78 Accepts]: Start accepts. Automaton has 51689 states and 75489 transitions. Word has length 89 [2019-09-08 11:24:49,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:49,210 INFO L475 AbstractCegarLoop]: Abstraction has 51689 states and 75489 transitions. [2019-09-08 11:24:49,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:24:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 51689 states and 75489 transitions. [2019-09-08 11:24:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:24:49,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:49,220 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] [2019-09-08 11:24:49,220 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:49,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:49,220 INFO L82 PathProgramCache]: Analyzing trace with hash 79328490, now seen corresponding path program 1 times [2019-09-08 11:24:49,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:49,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:49,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:49,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:49,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:49,493 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 11:24:49,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:49,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:24:49,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:24:49,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:24:49,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:24:49,495 INFO L87 Difference]: Start difference. First operand 51689 states and 75489 transitions. Second operand 10 states.