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.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:45:11,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:45:11,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:45:11,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:45:11,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:45:11,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:45:11,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:45:11,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:45:11,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:45:11,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:45:11,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:45:11,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:45:11,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:45:11,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:45:11,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:45:11,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:45:11,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:45:11,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:45:11,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:45:11,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:45:11,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:45:11,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:45:11,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:45:11,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:45:11,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:45:11,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:45:11,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:45:11,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:45:11,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:45:11,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:45:11,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:45:11,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:45:11,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:45:11,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:45:11,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:45:11,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:45:11,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:45:11,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:45:11,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:45:11,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:45:11,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:45:11,612 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-13 19:45:11,636 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:45:11,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:45:11,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:45:11,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:45:11,639 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:45:11,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:45:11,640 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:45:11,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:45:11,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:45:11,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:45:11,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:45:11,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:45:11,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:45:11,642 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:45:11,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:45:11,643 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:45:11,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:45:11,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:45:11,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:45:11,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:45:11,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:45:11,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:45:11,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:45:11,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:45:11,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:45:11,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:45:11,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:45:11,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:45:11,647 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:45:11,936 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:45:11,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:45:11,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:45:11,954 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:45:11,955 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:45:11,955 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.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 19:45:12,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d189a850/f4294a6f362b4b89bb5ca99de88a169c/FLAG5278c87a7 [2019-10-13 19:45:12,536 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:45:12,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 19:45:12,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d189a850/f4294a6f362b4b89bb5ca99de88a169c/FLAG5278c87a7 [2019-10-13 19:45:12,872 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d189a850/f4294a6f362b4b89bb5ca99de88a169c [2019-10-13 19:45:12,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:45:12,884 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:45:12,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:45:12,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:45:12,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:45:12,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:12" (1/1) ... [2019-10-13 19:45:12,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f0596f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:12, skipping insertion in model container [2019-10-13 19:45:12,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:12" (1/1) ... [2019-10-13 19:45:12,900 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:45:12,984 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:45:13,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:45:13,534 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:45:13,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:45:13,719 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:45:13,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:13 WrapperNode [2019-10-13 19:45:13,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:45:13,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:45:13,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:45:13,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:45:13,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:13" (1/1) ... [2019-10-13 19:45:13,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:13" (1/1) ... [2019-10-13 19:45:13,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:13" (1/1) ... [2019-10-13 19:45:13,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:13" (1/1) ... [2019-10-13 19:45:13,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:13" (1/1) ... [2019-10-13 19:45:13,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:13" (1/1) ... [2019-10-13 19:45:13,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:13" (1/1) ... [2019-10-13 19:45:13,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:45:13,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:45:13,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:45:13,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:45:13,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:13" (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-13 19:45:13,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:45:13,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:45:13,894 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:45:13,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:45:13,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:45:13,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 19:45:13,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 19:45:13,896 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 19:45:13,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:45:13,896 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 19:45:13,897 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 19:45:13,897 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 19:45:13,897 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 19:45:13,898 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 19:45:13,899 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 19:45:13,899 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 19:45:13,902 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:45:13,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:45:13,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:45:15,407 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:45:15,407 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 19:45:15,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:15 BoogieIcfgContainer [2019-10-13 19:45:15,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:45:15,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:45:15,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:45:15,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:45:15,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:45:12" (1/3) ... [2019-10-13 19:45:15,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39af653d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:15, skipping insertion in model container [2019-10-13 19:45:15,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:13" (2/3) ... [2019-10-13 19:45:15,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39af653d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:15, skipping insertion in model container [2019-10-13 19:45:15,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:15" (3/3) ... [2019-10-13 19:45:15,418 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 19:45:15,430 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:45:15,441 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:45:15,452 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:45:15,481 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:45:15,482 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:45:15,482 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:45:15,482 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:45:15,482 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:45:15,482 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:45:15,483 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:45:15,483 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:45:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states. [2019-10-13 19:45:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 19:45:15,525 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:15,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:45:15,529 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:15,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:15,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1464169863, now seen corresponding path program 1 times [2019-10-13 19:45:15,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:15,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664775442] [2019-10-13 19:45:15,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:15,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:15,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:16,461 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:16,569 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-13 19:45:16,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664775442] [2019-10-13 19:45:16,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:16,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:16,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957483408] [2019-10-13 19:45:16,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:16,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:16,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:16,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:16,600 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 4 states. [2019-10-13 19:45:16,886 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2019-10-13 19:45:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:18,544 INFO L93 Difference]: Finished difference Result 619 states and 1086 transitions. [2019-10-13 19:45:18,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:18,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-13 19:45:18,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:18,568 INFO L225 Difference]: With dead ends: 619 [2019-10-13 19:45:18,568 INFO L226 Difference]: Without dead ends: 492 [2019-10-13 19:45:18,574 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-10-13 19:45:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 490. [2019-10-13 19:45:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-13 19:45:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 727 transitions. [2019-10-13 19:45:18,668 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 727 transitions. Word has length 147 [2019-10-13 19:45:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:18,669 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 727 transitions. [2019-10-13 19:45:18,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 727 transitions. [2019-10-13 19:45:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 19:45:18,674 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:18,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:45:18,675 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:18,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:18,675 INFO L82 PathProgramCache]: Analyzing trace with hash 558735771, now seen corresponding path program 1 times [2019-10-13 19:45:18,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:18,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85678732] [2019-10-13 19:45:18,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:18,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:18,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:19,065 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:19,115 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-13 19:45:19,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85678732] [2019-10-13 19:45:19,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:19,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:19,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400142412] [2019-10-13 19:45:19,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:19,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:19,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:19,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:19,119 INFO L87 Difference]: Start difference. First operand 490 states and 727 transitions. Second operand 4 states. [2019-10-13 19:45:19,355 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2019-10-13 19:45:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:20,603 INFO L93 Difference]: Finished difference Result 1032 states and 1578 transitions. [2019-10-13 19:45:20,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:20,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-13 19:45:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:20,609 INFO L225 Difference]: With dead ends: 1032 [2019-10-13 19:45:20,610 INFO L226 Difference]: Without dead ends: 840 [2019-10-13 19:45:20,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:20,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-10-13 19:45:20,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 838. [2019-10-13 19:45:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-13 19:45:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1255 transitions. [2019-10-13 19:45:20,690 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1255 transitions. Word has length 147 [2019-10-13 19:45:20,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:20,691 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1255 transitions. [2019-10-13 19:45:20,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1255 transitions. [2019-10-13 19:45:20,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 19:45:20,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:20,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:45:20,698 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:20,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:20,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1754446721, now seen corresponding path program 1 times [2019-10-13 19:45:20,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:20,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057770671] [2019-10-13 19:45:20,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:20,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:20,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:21,382 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:21,457 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-13 19:45:21,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057770671] [2019-10-13 19:45:21,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:21,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:21,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481642410] [2019-10-13 19:45:21,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:21,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:21,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:21,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:21,471 INFO L87 Difference]: Start difference. First operand 838 states and 1255 transitions. Second operand 5 states. [2019-10-13 19:45:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:23,835 INFO L93 Difference]: Finished difference Result 2461 states and 3682 transitions. [2019-10-13 19:45:23,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:23,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 19:45:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:23,844 INFO L225 Difference]: With dead ends: 2461 [2019-10-13 19:45:23,844 INFO L226 Difference]: Without dead ends: 1636 [2019-10-13 19:45:23,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:45:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2019-10-13 19:45:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1634. [2019-10-13 19:45:23,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-10-13 19:45:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2428 transitions. [2019-10-13 19:45:23,928 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2428 transitions. Word has length 147 [2019-10-13 19:45:23,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:23,929 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 2428 transitions. [2019-10-13 19:45:23,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2428 transitions. [2019-10-13 19:45:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 19:45:23,933 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:23,933 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:45:23,934 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:23,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:23,934 INFO L82 PathProgramCache]: Analyzing trace with hash 818598479, now seen corresponding path program 1 times [2019-10-13 19:45:23,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:23,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527791138] [2019-10-13 19:45:23,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:23,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:23,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:24,207 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:24,250 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-13 19:45:24,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527791138] [2019-10-13 19:45:24,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:24,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:24,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700671545] [2019-10-13 19:45:24,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:24,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:24,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:24,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:24,254 INFO L87 Difference]: Start difference. First operand 1634 states and 2428 transitions. Second operand 4 states. [2019-10-13 19:45:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:25,713 INFO L93 Difference]: Finished difference Result 4856 states and 7214 transitions. [2019-10-13 19:45:25,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:25,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-13 19:45:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:25,734 INFO L225 Difference]: With dead ends: 4856 [2019-10-13 19:45:25,734 INFO L226 Difference]: Without dead ends: 3254 [2019-10-13 19:45:25,740 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-13 19:45:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2019-10-13 19:45:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 1636. [2019-10-13 19:45:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-10-13 19:45:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2430 transitions. [2019-10-13 19:45:25,844 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2430 transitions. Word has length 148 [2019-10-13 19:45:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:25,844 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 2430 transitions. [2019-10-13 19:45:25,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2430 transitions. [2019-10-13 19:45:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 19:45:25,848 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:25,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:45:25,849 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:25,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:25,849 INFO L82 PathProgramCache]: Analyzing trace with hash -77658400, now seen corresponding path program 1 times [2019-10-13 19:45:25,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:25,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871929847] [2019-10-13 19:45:25,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:25,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:25,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:26,198 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:26,264 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-13 19:45:26,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871929847] [2019-10-13 19:45:26,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:26,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:26,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342446145] [2019-10-13 19:45:26,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:26,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:26,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:26,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:26,267 INFO L87 Difference]: Start difference. First operand 1636 states and 2430 transitions. Second operand 5 states. [2019-10-13 19:45:27,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:27,499 INFO L93 Difference]: Finished difference Result 3258 states and 4842 transitions. [2019-10-13 19:45:27,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:27,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-10-13 19:45:27,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:27,508 INFO L225 Difference]: With dead ends: 3258 [2019-10-13 19:45:27,508 INFO L226 Difference]: Without dead ends: 1634 [2019-10-13 19:45:27,513 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-13 19:45:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2019-10-13 19:45:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2019-10-13 19:45:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-10-13 19:45:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2426 transitions. [2019-10-13 19:45:27,585 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2426 transitions. Word has length 149 [2019-10-13 19:45:27,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:27,586 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 2426 transitions. [2019-10-13 19:45:27,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2426 transitions. [2019-10-13 19:45:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 19:45:27,589 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:27,590 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:45:27,590 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:27,590 INFO L82 PathProgramCache]: Analyzing trace with hash -381277494, now seen corresponding path program 1 times [2019-10-13 19:45:27,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:27,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778260734] [2019-10-13 19:45:27,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:27,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:27,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:27,894 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:27,980 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-13 19:45:27,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778260734] [2019-10-13 19:45:27,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:27,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:27,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401021617] [2019-10-13 19:45:27,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:27,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:27,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:27,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:27,988 INFO L87 Difference]: Start difference. First operand 1634 states and 2426 transitions. Second operand 4 states. [2019-10-13 19:45:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:30,147 INFO L93 Difference]: Finished difference Result 3870 states and 5761 transitions. [2019-10-13 19:45:30,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:30,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-10-13 19:45:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:30,160 INFO L225 Difference]: With dead ends: 3870 [2019-10-13 19:45:30,160 INFO L226 Difference]: Without dead ends: 2414 [2019-10-13 19:45:30,163 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-13 19:45:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-10-13 19:45:30,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2412. [2019-10-13 19:45:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2412 states. [2019-10-13 19:45:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 3535 transitions. [2019-10-13 19:45:30,258 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 3535 transitions. Word has length 149 [2019-10-13 19:45:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:30,258 INFO L462 AbstractCegarLoop]: Abstraction has 2412 states and 3535 transitions. [2019-10-13 19:45:30,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 3535 transitions. [2019-10-13 19:45:30,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 19:45:30,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:30,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:45:30,263 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:30,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:30,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1397721559, now seen corresponding path program 1 times [2019-10-13 19:45:30,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:30,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720199092] [2019-10-13 19:45:30,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:30,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:30,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:30,581 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:30,623 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-13 19:45:30,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720199092] [2019-10-13 19:45:30,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:30,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:30,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977334575] [2019-10-13 19:45:30,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:45:30,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:30,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:45:30,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:45:30,626 INFO L87 Difference]: Start difference. First operand 2412 states and 3535 transitions. Second operand 6 states. [2019-10-13 19:45:30,860 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:45:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:32,250 INFO L93 Difference]: Finished difference Result 4658 states and 6855 transitions. [2019-10-13 19:45:32,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:45:32,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-10-13 19:45:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:32,262 INFO L225 Difference]: With dead ends: 4658 [2019-10-13 19:45:32,263 INFO L226 Difference]: Without dead ends: 2414 [2019-10-13 19:45:32,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:45:32,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-10-13 19:45:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2412. [2019-10-13 19:45:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2412 states. [2019-10-13 19:45:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 3520 transitions. [2019-10-13 19:45:32,374 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 3520 transitions. Word has length 152 [2019-10-13 19:45:32,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:32,374 INFO L462 AbstractCegarLoop]: Abstraction has 2412 states and 3520 transitions. [2019-10-13 19:45:32,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:45:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 3520 transitions. [2019-10-13 19:45:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 19:45:32,380 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:32,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:45:32,380 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:32,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1633318332, now seen corresponding path program 1 times [2019-10-13 19:45:32,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:32,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426111235] [2019-10-13 19:45:32,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:32,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:32,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:32,757 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:32,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426111235] [2019-10-13 19:45:32,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:32,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:32,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036770731] [2019-10-13 19:45:32,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:32,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:32,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:32,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:32,799 INFO L87 Difference]: Start difference. First operand 2412 states and 3520 transitions. Second operand 5 states. [2019-10-13 19:45:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:34,823 INFO L93 Difference]: Finished difference Result 6242 states and 9103 transitions. [2019-10-13 19:45:34,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:34,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-10-13 19:45:34,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:34,840 INFO L225 Difference]: With dead ends: 6242 [2019-10-13 19:45:34,840 INFO L226 Difference]: Without dead ends: 3853 [2019-10-13 19:45:34,847 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-13 19:45:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2019-10-13 19:45:35,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2019-10-13 19:45:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3851 states. [2019-10-13 19:45:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5567 transitions. [2019-10-13 19:45:35,017 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5567 transitions. Word has length 152 [2019-10-13 19:45:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:35,018 INFO L462 AbstractCegarLoop]: Abstraction has 3851 states and 5567 transitions. [2019-10-13 19:45:35,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5567 transitions. [2019-10-13 19:45:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 19:45:35,025 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:35,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:45:35,026 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:35,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:35,027 INFO L82 PathProgramCache]: Analyzing trace with hash -83620211, now seen corresponding path program 1 times [2019-10-13 19:45:35,027 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:35,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522526009] [2019-10-13 19:45:35,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:35,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:35,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:35,351 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:35,390 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-13 19:45:35,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522526009] [2019-10-13 19:45:35,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:35,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:35,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996755442] [2019-10-13 19:45:35,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:35,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:35,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:35,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:35,393 INFO L87 Difference]: Start difference. First operand 3851 states and 5567 transitions. Second operand 4 states. [2019-10-13 19:45:37,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:37,580 INFO L93 Difference]: Finished difference Result 10239 states and 14831 transitions. [2019-10-13 19:45:37,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:37,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-13 19:45:37,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:37,601 INFO L225 Difference]: With dead ends: 10239 [2019-10-13 19:45:37,601 INFO L226 Difference]: Without dead ends: 6731 [2019-10-13 19:45:37,608 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-13 19:45:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6731 states. [2019-10-13 19:45:37,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6731 to 6729. [2019-10-13 19:45:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6729 states. [2019-10-13 19:45:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6729 states to 6729 states and 9603 transitions. [2019-10-13 19:45:37,892 INFO L78 Accepts]: Start accepts. Automaton has 6729 states and 9603 transitions. Word has length 154 [2019-10-13 19:45:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:37,892 INFO L462 AbstractCegarLoop]: Abstraction has 6729 states and 9603 transitions. [2019-10-13 19:45:37,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 6729 states and 9603 transitions. [2019-10-13 19:45:37,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 19:45:37,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:37,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:45:37,902 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:37,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:37,902 INFO L82 PathProgramCache]: Analyzing trace with hash 423811114, now seen corresponding path program 1 times [2019-10-13 19:45:37,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:37,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424770306] [2019-10-13 19:45:37,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:37,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:37,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:38,174 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:38,210 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-13 19:45:38,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424770306] [2019-10-13 19:45:38,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:38,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:38,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489954941] [2019-10-13 19:45:38,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:38,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:38,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:38,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:38,212 INFO L87 Difference]: Start difference. First operand 6729 states and 9603 transitions. Second operand 5 states. [2019-10-13 19:45:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:39,429 INFO L93 Difference]: Finished difference Result 11002 states and 15732 transitions. [2019-10-13 19:45:39,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:39,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-10-13 19:45:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:39,451 INFO L225 Difference]: With dead ends: 11002 [2019-10-13 19:45:39,451 INFO L226 Difference]: Without dead ends: 5964 [2019-10-13 19:45:39,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:45:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2019-10-13 19:45:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 5964. [2019-10-13 19:45:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5964 states. [2019-10-13 19:45:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5964 states to 5964 states and 8508 transitions. [2019-10-13 19:45:39,686 INFO L78 Accepts]: Start accepts. Automaton has 5964 states and 8508 transitions. Word has length 154 [2019-10-13 19:45:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:39,686 INFO L462 AbstractCegarLoop]: Abstraction has 5964 states and 8508 transitions. [2019-10-13 19:45:39,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5964 states and 8508 transitions. [2019-10-13 19:45:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 19:45:39,695 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:39,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:45:39,696 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:39,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:39,696 INFO L82 PathProgramCache]: Analyzing trace with hash 923876710, now seen corresponding path program 1 times [2019-10-13 19:45:39,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:39,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711237877] [2019-10-13 19:45:39,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:39,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:39,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:40,077 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:40,119 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-13 19:45:40,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711237877] [2019-10-13 19:45:40,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:40,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:40,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762360910] [2019-10-13 19:45:40,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:40,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:40,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:40,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:40,122 INFO L87 Difference]: Start difference. First operand 5964 states and 8508 transitions. Second operand 5 states. [2019-10-13 19:45:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:42,308 INFO L93 Difference]: Finished difference Result 17410 states and 24777 transitions. [2019-10-13 19:45:42,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:42,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-13 19:45:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:42,333 INFO L225 Difference]: With dead ends: 17410 [2019-10-13 19:45:42,334 INFO L226 Difference]: Without dead ends: 11489 [2019-10-13 19:45:42,343 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-13 19:45:42,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11489 states. [2019-10-13 19:45:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11489 to 11487. [2019-10-13 19:45:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11487 states. [2019-10-13 19:45:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11487 states to 11487 states and 16184 transitions. [2019-10-13 19:45:42,789 INFO L78 Accepts]: Start accepts. Automaton has 11487 states and 16184 transitions. Word has length 157 [2019-10-13 19:45:42,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:42,789 INFO L462 AbstractCegarLoop]: Abstraction has 11487 states and 16184 transitions. [2019-10-13 19:45:42,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 11487 states and 16184 transitions. [2019-10-13 19:45:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 19:45:42,802 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:42,803 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:45:42,803 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:42,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:42,803 INFO L82 PathProgramCache]: Analyzing trace with hash -2109819854, now seen corresponding path program 1 times [2019-10-13 19:45:42,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:42,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131977606] [2019-10-13 19:45:42,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:42,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:42,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:43,024 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:43,052 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-13 19:45:43,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131977606] [2019-10-13 19:45:43,053 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:43,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:43,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822944851] [2019-10-13 19:45:43,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:43,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:43,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:43,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:43,054 INFO L87 Difference]: Start difference. First operand 11487 states and 16184 transitions. Second operand 4 states. [2019-10-13 19:45:45,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:45,673 INFO L93 Difference]: Finished difference Result 34269 states and 48305 transitions. [2019-10-13 19:45:45,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:45,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-13 19:45:45,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:45,715 INFO L225 Difference]: With dead ends: 34269 [2019-10-13 19:45:45,715 INFO L226 Difference]: Without dead ends: 22887 [2019-10-13 19:45:45,735 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-13 19:45:45,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22887 states. [2019-10-13 19:45:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22887 to 11493. [2019-10-13 19:45:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11493 states. [2019-10-13 19:45:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11493 states to 11493 states and 16190 transitions. [2019-10-13 19:45:46,265 INFO L78 Accepts]: Start accepts. Automaton has 11493 states and 16190 transitions. Word has length 158 [2019-10-13 19:45:46,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:46,265 INFO L462 AbstractCegarLoop]: Abstraction has 11493 states and 16190 transitions. [2019-10-13 19:45:46,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:46,265 INFO L276 IsEmpty]: Start isEmpty. Operand 11493 states and 16190 transitions. [2019-10-13 19:45:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 19:45:46,277 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:45:46,277 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:46,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:46,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1177749259, now seen corresponding path program 1 times [2019-10-13 19:45:46,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:46,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936556127] [2019-10-13 19:45:46,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:46,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:46,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:46,662 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:46,730 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-13 19:45:46,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936556127] [2019-10-13 19:45:46,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:46,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:46,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612404318] [2019-10-13 19:45:46,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:46,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:46,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:46,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:46,734 INFO L87 Difference]: Start difference. First operand 11493 states and 16190 transitions. Second operand 4 states.