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_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:43:54,374 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:43:54,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:43:54,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:43:54,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:43:54,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:43:54,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:43:54,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:43:54,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:43:54,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:43:54,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:43:54,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:43:54,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:43:54,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:43:54,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:43:54,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:43:54,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:43:54,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:43:54,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:43:54,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:43:54,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:43:54,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:43:54,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:43:54,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:43:54,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:43:54,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:43:54,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:43:54,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:43:54,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:43:54,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:43:54,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:43:54,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:43:54,429 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:43:54,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:43:54,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:43:54,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:43:54,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:43:54,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:43:54,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:43:54,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:43:54,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:43:54,441 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-10-14 23:43:54,462 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:43:54,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:43:54,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:43:54,464 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:43:54,464 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:43:54,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:43:54,464 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:43:54,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:43:54,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:43:54,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:43:54,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:43:54,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:43:54,466 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:43:54,466 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:43:54,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:43:54,466 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:43:54,467 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:43:54,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:43:54,467 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:43:54,467 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:43:54,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:43:54,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:43:54,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:43:54,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:43:54,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:43:54,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:43:54,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:43:54,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:43:54,469 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:43:54,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:43:54,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:43:54,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:43:54,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:43:54,755 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:43:54,756 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-14 23:43:54,822 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb1df17f/dcef4fe0f40f4856bcbb24bcff2ff7f4/FLAG3175b6954 [2019-10-14 23:43:55,418 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:43:55,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-14 23:43:55,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb1df17f/dcef4fe0f40f4856bcbb24bcff2ff7f4/FLAG3175b6954 [2019-10-14 23:43:55,671 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbb1df17f/dcef4fe0f40f4856bcbb24bcff2ff7f4 [2019-10-14 23:43:55,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:43:55,682 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:43:55,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:43:55,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:43:55,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:43:55,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:43:55" (1/1) ... [2019-10-14 23:43:55,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@362dc79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:55, skipping insertion in model container [2019-10-14 23:43:55,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:43:55" (1/1) ... [2019-10-14 23:43:55,697 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:43:55,754 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:43:56,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:43:56,152 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:43:56,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:43:56,407 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:43:56,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:56 WrapperNode [2019-10-14 23:43:56,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:43:56,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:43:56,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:43:56,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:43:56,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:56" (1/1) ... [2019-10-14 23:43:56,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:56" (1/1) ... [2019-10-14 23:43:56,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:56" (1/1) ... [2019-10-14 23:43:56,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:56" (1/1) ... [2019-10-14 23:43:56,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:56" (1/1) ... [2019-10-14 23:43:56,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:56" (1/1) ... [2019-10-14 23:43:56,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:56" (1/1) ... [2019-10-14 23:43:56,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:43:56,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:43:56,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:43:56,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:43:56,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:56" (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-10-14 23:43:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:43:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:43:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:43:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:43:56,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:43:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-14 23:43:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-14 23:43:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-14 23:43:56,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:43:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:43:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-14 23:43:56,587 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-14 23:43:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-14 23:43:56,588 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-14 23:43:56,589 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-14 23:43:56,590 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-14 23:43:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:43:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:43:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:43:57,864 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:43:57,865 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:43:57,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:43:57 BoogieIcfgContainer [2019-10-14 23:43:57,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:43:57,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:43:57,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:43:57,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:43:57,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:43:55" (1/3) ... [2019-10-14 23:43:57,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52be05eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:43:57, skipping insertion in model container [2019-10-14 23:43:57,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:43:56" (2/3) ... [2019-10-14 23:43:57,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52be05eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:43:57, skipping insertion in model container [2019-10-14 23:43:57,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:43:57" (3/3) ... [2019-10-14 23:43:57,884 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-14 23:43:57,895 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:43:57,916 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:43:57,927 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:43:57,959 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:43:57,959 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:43:57,960 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:43:57,960 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:43:57,960 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:43:57,960 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:43:57,960 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:43:57,960 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:43:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states. [2019-10-14 23:43:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-14 23:43:57,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:43:57,998 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:43:58,000 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:43:58,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:43:58,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1231650886, now seen corresponding path program 1 times [2019-10-14 23:43:58,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:43:58,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978262393] [2019-10-14 23:43:58,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:58,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:43:58,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:43:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:58,970 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:43:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:43:59,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:43:59,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978262393] [2019-10-14 23:43:59,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:43:59,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:43:59,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141040780] [2019-10-14 23:43:59,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:43:59,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:43:59,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:43:59,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:43:59,076 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 5 states. [2019-10-14 23:44:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:01,331 INFO L93 Difference]: Finished difference Result 654 states and 1145 transitions. [2019-10-14 23:44:01,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:44:01,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-14 23:44:01,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:01,352 INFO L225 Difference]: With dead ends: 654 [2019-10-14 23:44:01,353 INFO L226 Difference]: Without dead ends: 430 [2019-10-14 23:44:01,358 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-14 23:44:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2019-10-14 23:44:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-10-14 23:44:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2019-10-14 23:44:01,451 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 99 [2019-10-14 23:44:01,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:01,456 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2019-10-14 23:44:01,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2019-10-14 23:44:01,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-14 23:44:01,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:01,467 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:01,467 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:01,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:01,468 INFO L82 PathProgramCache]: Analyzing trace with hash 829692944, now seen corresponding path program 1 times [2019-10-14 23:44:01,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:01,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308249170] [2019-10-14 23:44:01,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:01,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:01,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:01,786 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:44:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:01,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308249170] [2019-10-14 23:44:01,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:01,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:01,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103647692] [2019-10-14 23:44:01,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:01,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:01,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:01,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:01,812 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand 4 states. [2019-10-14 23:44:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:02,927 INFO L93 Difference]: Finished difference Result 1238 states and 1811 transitions. [2019-10-14 23:44:02,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:44:02,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-14 23:44:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:02,933 INFO L225 Difference]: With dead ends: 1238 [2019-10-14 23:44:02,933 INFO L226 Difference]: Without dead ends: 842 [2019-10-14 23:44:02,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-10-14 23:44:02,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 430. [2019-10-14 23:44:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-10-14 23:44:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 629 transitions. [2019-10-14 23:44:02,982 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 629 transitions. Word has length 100 [2019-10-14 23:44:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:02,983 INFO L462 AbstractCegarLoop]: Abstraction has 430 states and 629 transitions. [2019-10-14 23:44:02,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 629 transitions. [2019-10-14 23:44:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-14 23:44:02,986 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:02,986 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:02,987 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:02,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:02,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1677637145, now seen corresponding path program 1 times [2019-10-14 23:44:02,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:02,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982664329] [2019-10-14 23:44:02,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:02,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:02,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:03,341 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:44:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:03,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982664329] [2019-10-14 23:44:03,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:03,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:03,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908209898] [2019-10-14 23:44:03,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:03,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:03,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:03,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:03,390 INFO L87 Difference]: Start difference. First operand 430 states and 629 transitions. Second operand 5 states. [2019-10-14 23:44:04,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:04,401 INFO L93 Difference]: Finished difference Result 846 states and 1240 transitions. [2019-10-14 23:44:04,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:04,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-10-14 23:44:04,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:04,405 INFO L225 Difference]: With dead ends: 846 [2019-10-14 23:44:04,405 INFO L226 Difference]: Without dead ends: 428 [2019-10-14 23:44:04,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-10-14 23:44:04,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2019-10-14 23:44:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-10-14 23:44:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 625 transitions. [2019-10-14 23:44:04,431 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 625 transitions. Word has length 101 [2019-10-14 23:44:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:04,431 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 625 transitions. [2019-10-14 23:44:04,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 625 transitions. [2019-10-14 23:44:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-14 23:44:04,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:04,433 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:04,434 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:04,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:04,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1471843135, now seen corresponding path program 1 times [2019-10-14 23:44:04,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:04,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779827425] [2019-10-14 23:44:04,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:04,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:04,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:04,686 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:44:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:04,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779827425] [2019-10-14 23:44:04,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:04,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:04,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989257942] [2019-10-14 23:44:04,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:04,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:04,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:04,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:04,754 INFO L87 Difference]: Start difference. First operand 428 states and 625 transitions. Second operand 4 states. [2019-10-14 23:44:06,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:06,357 INFO L93 Difference]: Finished difference Result 881 states and 1305 transitions. [2019-10-14 23:44:06,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:44:06,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-14 23:44:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:06,363 INFO L225 Difference]: With dead ends: 881 [2019-10-14 23:44:06,363 INFO L226 Difference]: Without dead ends: 631 [2019-10-14 23:44:06,365 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:06,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-14 23:44:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 629. [2019-10-14 23:44:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-14 23:44:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 910 transitions. [2019-10-14 23:44:06,415 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 910 transitions. Word has length 101 [2019-10-14 23:44:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:06,417 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 910 transitions. [2019-10-14 23:44:06,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 910 transitions. [2019-10-14 23:44:06,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-14 23:44:06,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:06,421 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:06,421 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:06,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:06,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1316339424, now seen corresponding path program 1 times [2019-10-14 23:44:06,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:06,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370549384] [2019-10-14 23:44:06,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:06,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:06,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:06,947 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:44:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:07,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370549384] [2019-10-14 23:44:07,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:07,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:07,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105745618] [2019-10-14 23:44:07,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:44:07,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:07,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:44:07,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:07,005 INFO L87 Difference]: Start difference. First operand 629 states and 910 transitions. Second operand 6 states. [2019-10-14 23:44:07,278 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-14 23:44:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:08,440 INFO L93 Difference]: Finished difference Result 1413 states and 2116 transitions. [2019-10-14 23:44:08,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:44:08,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-10-14 23:44:08,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:08,447 INFO L225 Difference]: With dead ends: 1413 [2019-10-14 23:44:08,447 INFO L226 Difference]: Without dead ends: 952 [2019-10-14 23:44:08,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:44:08,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-10-14 23:44:08,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 950. [2019-10-14 23:44:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-10-14 23:44:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1405 transitions. [2019-10-14 23:44:08,530 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1405 transitions. Word has length 103 [2019-10-14 23:44:08,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:08,530 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1405 transitions. [2019-10-14 23:44:08,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:44:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1405 transitions. [2019-10-14 23:44:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-14 23:44:08,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:08,534 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:08,535 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:08,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:08,535 INFO L82 PathProgramCache]: Analyzing trace with hash 822354405, now seen corresponding path program 1 times [2019-10-14 23:44:08,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:08,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432852021] [2019-10-14 23:44:08,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:08,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:08,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:08,947 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:44:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:08,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432852021] [2019-10-14 23:44:08,989 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:08,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:08,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726742557] [2019-10-14 23:44:09,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:09,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:09,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:09,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:09,005 INFO L87 Difference]: Start difference. First operand 950 states and 1405 transitions. Second operand 5 states. [2019-10-14 23:44:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:10,502 INFO L93 Difference]: Finished difference Result 2380 states and 3527 transitions. [2019-10-14 23:44:10,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:10,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-14 23:44:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:10,517 INFO L225 Difference]: With dead ends: 2380 [2019-10-14 23:44:10,517 INFO L226 Difference]: Without dead ends: 1453 [2019-10-14 23:44:10,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-10-14 23:44:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1451. [2019-10-14 23:44:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-10-14 23:44:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2130 transitions. [2019-10-14 23:44:10,604 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2130 transitions. Word has length 103 [2019-10-14 23:44:10,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:10,604 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 2130 transitions. [2019-10-14 23:44:10,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2130 transitions. [2019-10-14 23:44:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:44:10,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:10,608 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:10,608 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:10,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1353908859, now seen corresponding path program 1 times [2019-10-14 23:44:10,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:10,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166673694] [2019-10-14 23:44:10,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:10,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:10,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:11,100 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:44:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:11,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166673694] [2019-10-14 23:44:11,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:11,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:11,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293485841] [2019-10-14 23:44:11,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:11,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:11,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:11,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:11,151 INFO L87 Difference]: Start difference. First operand 1451 states and 2130 transitions. Second operand 5 states. [2019-10-14 23:44:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:12,073 INFO L93 Difference]: Finished difference Result 2511 states and 3707 transitions. [2019-10-14 23:44:12,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:12,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-14 23:44:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:12,082 INFO L225 Difference]: With dead ends: 2511 [2019-10-14 23:44:12,082 INFO L226 Difference]: Without dead ends: 1451 [2019-10-14 23:44:12,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-10-14 23:44:12,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1451. [2019-10-14 23:44:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-10-14 23:44:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2129 transitions. [2019-10-14 23:44:12,159 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2129 transitions. Word has length 105 [2019-10-14 23:44:12,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:12,159 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 2129 transitions. [2019-10-14 23:44:12,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2129 transitions. [2019-10-14 23:44:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:44:12,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:12,162 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:12,162 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:12,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:12,162 INFO L82 PathProgramCache]: Analyzing trace with hash -673168968, now seen corresponding path program 1 times [2019-10-14 23:44:12,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:12,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656767778] [2019-10-14 23:44:12,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:12,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:12,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:12,475 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:44:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:12,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656767778] [2019-10-14 23:44:12,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:12,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:12,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650506759] [2019-10-14 23:44:12,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:12,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:12,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:12,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:12,506 INFO L87 Difference]: Start difference. First operand 1451 states and 2129 transitions. Second operand 4 states. [2019-10-14 23:44:14,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:14,111 INFO L93 Difference]: Finished difference Result 3308 states and 4930 transitions. [2019-10-14 23:44:14,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:44:14,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-14 23:44:14,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:14,123 INFO L225 Difference]: With dead ends: 3308 [2019-10-14 23:44:14,124 INFO L226 Difference]: Without dead ends: 2200 [2019-10-14 23:44:14,127 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2019-10-14 23:44:14,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 2198. [2019-10-14 23:44:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2198 states. [2019-10-14 23:44:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 3202 transitions. [2019-10-14 23:44:14,265 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 3202 transitions. Word has length 105 [2019-10-14 23:44:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:14,267 INFO L462 AbstractCegarLoop]: Abstraction has 2198 states and 3202 transitions. [2019-10-14 23:44:14,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 3202 transitions. [2019-10-14 23:44:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-14 23:44:14,277 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:14,277 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:14,277 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:14,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:14,278 INFO L82 PathProgramCache]: Analyzing trace with hash -312373315, now seen corresponding path program 1 times [2019-10-14 23:44:14,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:14,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729725846] [2019-10-14 23:44:14,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:14,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:14,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:14,632 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:44:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:14,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729725846] [2019-10-14 23:44:14,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:14,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:14,664 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892858205] [2019-10-14 23:44:14,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:14,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:14,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:14,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:14,670 INFO L87 Difference]: Start difference. First operand 2198 states and 3202 transitions. Second operand 5 states. [2019-10-14 23:44:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:16,138 INFO L93 Difference]: Finished difference Result 6352 states and 9243 transitions. [2019-10-14 23:44:16,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:16,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-14 23:44:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:16,156 INFO L225 Difference]: With dead ends: 6352 [2019-10-14 23:44:16,156 INFO L226 Difference]: Without dead ends: 4197 [2019-10-14 23:44:16,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4197 states. [2019-10-14 23:44:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4197 to 4195. [2019-10-14 23:44:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2019-10-14 23:44:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 6052 transitions. [2019-10-14 23:44:16,423 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 6052 transitions. Word has length 107 [2019-10-14 23:44:16,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:16,424 INFO L462 AbstractCegarLoop]: Abstraction has 4195 states and 6052 transitions. [2019-10-14 23:44:16,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:16,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 6052 transitions. [2019-10-14 23:44:16,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-14 23:44:16,430 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:16,430 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:16,430 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:16,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:16,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1907705071, now seen corresponding path program 1 times [2019-10-14 23:44:16,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:16,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679647825] [2019-10-14 23:44:16,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:16,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:16,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:16,652 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:44:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:16,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679647825] [2019-10-14 23:44:16,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:16,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:16,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882207600] [2019-10-14 23:44:16,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:16,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:16,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:16,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:16,676 INFO L87 Difference]: Start difference. First operand 4195 states and 6052 transitions. Second operand 4 states. [2019-10-14 23:44:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:17,935 INFO L93 Difference]: Finished difference Result 12393 states and 17909 transitions. [2019-10-14 23:44:17,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:44:17,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-10-14 23:44:17,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:17,963 INFO L225 Difference]: With dead ends: 12393 [2019-10-14 23:44:17,963 INFO L226 Difference]: Without dead ends: 8303 [2019-10-14 23:44:17,973 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:17,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8303 states. [2019-10-14 23:44:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8303 to 4201. [2019-10-14 23:44:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4201 states. [2019-10-14 23:44:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 6058 transitions. [2019-10-14 23:44:18,314 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 6058 transitions. Word has length 108 [2019-10-14 23:44:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:18,315 INFO L462 AbstractCegarLoop]: Abstraction has 4201 states and 6058 transitions. [2019-10-14 23:44:18,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 6058 transitions. [2019-10-14 23:44:18,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-14 23:44:18,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:18,320 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:18,321 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:18,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:18,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1358405212, now seen corresponding path program 1 times [2019-10-14 23:44:18,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:18,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586681360] [2019-10-14 23:44:18,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:18,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:18,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:18,607 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:44:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:18,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586681360] [2019-10-14 23:44:18,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:18,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:18,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025104813] [2019-10-14 23:44:18,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:18,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:18,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:18,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:18,636 INFO L87 Difference]: Start difference. First operand 4201 states and 6058 transitions. Second operand 5 states. [2019-10-14 23:44:19,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:19,627 INFO L93 Difference]: Finished difference Result 8360 states and 12060 transitions. [2019-10-14 23:44:19,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:19,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-14 23:44:19,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:19,644 INFO L225 Difference]: With dead ends: 8360 [2019-10-14 23:44:19,644 INFO L226 Difference]: Without dead ends: 4195 [2019-10-14 23:44:19,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:19,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2019-10-14 23:44:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 4195. [2019-10-14 23:44:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2019-10-14 23:44:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 6046 transitions. [2019-10-14 23:44:19,939 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 6046 transitions. Word has length 109 [2019-10-14 23:44:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:19,939 INFO L462 AbstractCegarLoop]: Abstraction has 4195 states and 6046 transitions. [2019-10-14 23:44:19,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 6046 transitions. [2019-10-14 23:44:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-14 23:44:19,944 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:19,944 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:19,945 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:19,945 INFO L82 PathProgramCache]: Analyzing trace with hash 825640158, now seen corresponding path program 1 times [2019-10-14 23:44:19,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:19,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873098937] [2019-10-14 23:44:19,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:19,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:19,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:20,194 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:44:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:20,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873098937] [2019-10-14 23:44:20,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:20,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:20,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941881542] [2019-10-14 23:44:20,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:20,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:20,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:20,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:20,227 INFO L87 Difference]: Start difference. First operand 4195 states and 6046 transitions. Second operand 4 states. [2019-10-14 23:44:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:21,942 INFO L93 Difference]: Finished difference Result 9753 states and 14169 transitions. [2019-10-14 23:44:21,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:44:21,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-14 23:44:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:21,975 INFO L225 Difference]: With dead ends: 9753 [2019-10-14 23:44:21,976 INFO L226 Difference]: Without dead ends: 6233 [2019-10-14 23:44:21,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2019-10-14 23:44:22,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 6231. [2019-10-14 23:44:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2019-10-14 23:44:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 8841 transitions. [2019-10-14 23:44:22,227 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 8841 transitions. Word has length 109 [2019-10-14 23:44:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:22,228 INFO L462 AbstractCegarLoop]: Abstraction has 6231 states and 8841 transitions. [2019-10-14 23:44:22,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 8841 transitions. [2019-10-14 23:44:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-14 23:44:22,234 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:22,234 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:22,235 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:22,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:22,235 INFO L82 PathProgramCache]: Analyzing trace with hash 200750214, now seen corresponding path program 1 times [2019-10-14 23:44:22,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:22,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287179750] [2019-10-14 23:44:22,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:22,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:22,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:22,655 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:44:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:22,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287179750] [2019-10-14 23:44:22,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:22,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-14 23:44:22,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068301218] [2019-10-14 23:44:22,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 23:44:22,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:22,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 23:44:22,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:44:22,786 INFO L87 Difference]: Start difference. First operand 6231 states and 8841 transitions. Second operand 13 states. [2019-10-14 23:44:23,080 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-10-14 23:44:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:25,453 INFO L93 Difference]: Finished difference Result 17888 states and 26756 transitions. [2019-10-14 23:44:25,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:44:25,453 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 111 [2019-10-14 23:44:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:25,483 INFO L225 Difference]: With dead ends: 17888 [2019-10-14 23:44:25,484 INFO L226 Difference]: Without dead ends: 13847 [2019-10-14 23:44:25,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:44:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13847 states. [2019-10-14 23:44:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13847 to 12191. [2019-10-14 23:44:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12191 states. [2019-10-14 23:44:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12191 states to 12191 states and 17824 transitions. [2019-10-14 23:44:26,298 INFO L78 Accepts]: Start accepts. Automaton has 12191 states and 17824 transitions. Word has length 111 [2019-10-14 23:44:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:26,299 INFO L462 AbstractCegarLoop]: Abstraction has 12191 states and 17824 transitions. [2019-10-14 23:44:26,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 23:44:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 12191 states and 17824 transitions. [2019-10-14 23:44:26,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-14 23:44:26,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:26,308 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:26,308 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:26,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:26,308 INFO L82 PathProgramCache]: Analyzing trace with hash -825612106, now seen corresponding path program 1 times [2019-10-14 23:44:26,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:26,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848286173] [2019-10-14 23:44:26,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:26,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:26,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:26,537 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:44:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:26,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848286173] [2019-10-14 23:44:26,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:26,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:26,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290710175] [2019-10-14 23:44:26,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:26,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:26,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:26,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:26,565 INFO L87 Difference]: Start difference. First operand 12191 states and 17824 transitions. Second operand 4 states. [2019-10-14 23:44:26,769 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-14 23:44:28,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:28,984 INFO L93 Difference]: Finished difference Result 28778 states and 44113 transitions. [2019-10-14 23:44:28,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:28,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-14 23:44:28,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:29,033 INFO L225 Difference]: With dead ends: 28778 [2019-10-14 23:44:29,034 INFO L226 Difference]: Without dead ends: 20474 [2019-10-14 23:44:29,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20474 states. [2019-10-14 23:44:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20474 to 20448. [2019-10-14 23:44:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20448 states. [2019-10-14 23:44:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20448 states to 20448 states and 30546 transitions. [2019-10-14 23:44:30,766 INFO L78 Accepts]: Start accepts. Automaton has 20448 states and 30546 transitions. Word has length 111 [2019-10-14 23:44:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:30,767 INFO L462 AbstractCegarLoop]: Abstraction has 20448 states and 30546 transitions. [2019-10-14 23:44:30,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 20448 states and 30546 transitions. [2019-10-14 23:44:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-14 23:44:30,774 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:30,774 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:30,775 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:30,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1946924417, now seen corresponding path program 1 times [2019-10-14 23:44:30,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:30,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590475072] [2019-10-14 23:44:30,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:30,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:30,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:31,116 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-14 23:44:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:31,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590475072] [2019-10-14 23:44:31,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:31,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 23:44:31,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158948873] [2019-10-14 23:44:31,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:44:31,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:31,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:44:31,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:44:31,142 INFO L87 Difference]: Start difference. First operand 20448 states and 30546 transitions. Second operand 9 states.