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_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:44:55,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:44:55,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:44:55,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:44:55,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:44:55,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:44:55,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:44:55,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:44:55,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:44:55,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:44:55,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:44:55,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:44:55,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:44:55,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:44:55,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:44:55,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:44:55,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:44:55,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:44:55,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:44:55,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:44:55,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:44:55,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:44:55,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:44:55,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:44:55,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:44:55,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:44:55,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:44:55,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:44:55,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:44:55,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:44:55,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:44:55,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:44:55,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:44:55,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:44:55,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:44:55,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:44:55,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:44:55,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:44:55,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:44:55,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:44:55,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:44:55,617 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:44:55,640 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:44:55,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:44:55,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:44:55,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:44:55,644 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:44:55,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:44:55,645 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:44:55,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:44:55,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:44:55,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:44:55,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:44:55,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:44:55,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:44:55,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:44:55,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:44:55,648 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:44:55,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:44:55,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:44:55,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:44:55,649 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:44:55,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:44:55,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:44:55,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:44:55,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:44:55,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:44:55,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:44:55,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:44:55,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:44:55,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:44:55,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:44:55,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:44:55,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:44:55,950 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:44:55,951 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:44:55,951 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-14 23:44:56,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/286e393a1/5e6aa8ed99094ef99ee94fc5cc0270e9/FLAGe6364d396 [2019-10-14 23:44:56,651 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:44:56,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-14 23:44:56,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/286e393a1/5e6aa8ed99094ef99ee94fc5cc0270e9/FLAGe6364d396 [2019-10-14 23:44:56,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/286e393a1/5e6aa8ed99094ef99ee94fc5cc0270e9 [2019-10-14 23:44:56,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:44:56,886 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:44:56,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:44:56,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:44:56,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:44:56,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:44:56" (1/1) ... [2019-10-14 23:44:56,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b1910d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:56, skipping insertion in model container [2019-10-14 23:44:56,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:44:56" (1/1) ... [2019-10-14 23:44:56,906 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:44:56,976 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:44:57,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:44:57,491 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:44:57,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:44:57,645 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:44:57,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57 WrapperNode [2019-10-14 23:44:57,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:44:57,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:44:57,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:44:57,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:44:57,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (1/1) ... [2019-10-14 23:44:57,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (1/1) ... [2019-10-14 23:44:57,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (1/1) ... [2019-10-14 23:44:57,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (1/1) ... [2019-10-14 23:44:57,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (1/1) ... [2019-10-14 23:44:57,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (1/1) ... [2019-10-14 23:44:57,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (1/1) ... [2019-10-14 23:44:57,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:44:57,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:44:57,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:44:57,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:44:57,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (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:44:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:44:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:44:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:44:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:44:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:44:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-14 23:44:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-14 23:44:57,841 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-14 23:44:57,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:44:57,841 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:44:57,841 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-14 23:44:57,841 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-14 23:44:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-14 23:44:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-14 23:44:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-14 23:44:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-14 23:44:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:44:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:44:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:44:59,199 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:44:59,200 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:44:59,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:44:59 BoogieIcfgContainer [2019-10-14 23:44:59,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:44:59,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:44:59,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:44:59,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:44:59,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:44:56" (1/3) ... [2019-10-14 23:44:59,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b8023e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:44:59, skipping insertion in model container [2019-10-14 23:44:59,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:57" (2/3) ... [2019-10-14 23:44:59,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b8023e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:44:59, skipping insertion in model container [2019-10-14 23:44:59,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:44:59" (3/3) ... [2019-10-14 23:44:59,217 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-14 23:44:59,228 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:44:59,257 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-14 23:44:59,271 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-14 23:44:59,307 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:44:59,307 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:44:59,307 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:44:59,307 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:44:59,308 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:44:59,308 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:44:59,308 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:44:59,308 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:44:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2019-10-14 23:44:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-14 23:44:59,344 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:59,345 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] [2019-10-14 23:44:59,347 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:59,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:59,352 INFO L82 PathProgramCache]: Analyzing trace with hash -907914047, now seen corresponding path program 1 times [2019-10-14 23:44:59,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:59,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815577264] [2019-10-14 23:44:59,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:59,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:59,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:00,381 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:45:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:00,451 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:45:00,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815577264] [2019-10-14 23:45:00,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:00,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:00,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766343754] [2019-10-14 23:45:00,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:00,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:00,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:00,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:00,475 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 5 states. [2019-10-14 23:45:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:02,658 INFO L93 Difference]: Finished difference Result 789 states and 1385 transitions. [2019-10-14 23:45:02,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:45:02,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-14 23:45:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:02,679 INFO L225 Difference]: With dead ends: 789 [2019-10-14 23:45:02,679 INFO L226 Difference]: Without dead ends: 519 [2019-10-14 23:45:02,685 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-14 23:45:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-10-14 23:45:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 496. [2019-10-14 23:45:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-10-14 23:45:02,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 722 transitions. [2019-10-14 23:45:02,770 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 722 transitions. Word has length 102 [2019-10-14 23:45:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:02,771 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 722 transitions. [2019-10-14 23:45:02,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 722 transitions. [2019-10-14 23:45:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-14 23:45:02,775 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:02,776 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:45:02,776 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1093362695, now seen corresponding path program 1 times [2019-10-14 23:45:02,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:02,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306418976] [2019-10-14 23:45:02,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:02,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:02,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:03,087 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:45:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:03,114 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:45:03,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306418976] [2019-10-14 23:45:03,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:03,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:03,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605611286] [2019-10-14 23:45:03,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:03,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:03,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:03,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:03,118 INFO L87 Difference]: Start difference. First operand 496 states and 722 transitions. Second operand 4 states. [2019-10-14 23:45:05,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:05,160 INFO L93 Difference]: Finished difference Result 1442 states and 2096 transitions. [2019-10-14 23:45:05,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:05,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-14 23:45:05,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:05,168 INFO L225 Difference]: With dead ends: 1442 [2019-10-14 23:45:05,168 INFO L226 Difference]: Without dead ends: 978 [2019-10-14 23:45:05,171 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:45:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-10-14 23:45:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 498. [2019-10-14 23:45:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-10-14 23:45:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 724 transitions. [2019-10-14 23:45:05,213 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 724 transitions. Word has length 103 [2019-10-14 23:45:05,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:05,214 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 724 transitions. [2019-10-14 23:45:05,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:05,214 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 724 transitions. [2019-10-14 23:45:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-14 23:45:05,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:05,217 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] [2019-10-14 23:45:05,218 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:05,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1521321784, now seen corresponding path program 1 times [2019-10-14 23:45:05,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:05,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277031345] [2019-10-14 23:45:05,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:05,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:05,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:05,522 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:45:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:05,557 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:45:05,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277031345] [2019-10-14 23:45:05,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:05,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:05,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610367229] [2019-10-14 23:45:05,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:05,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:05,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:05,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:05,570 INFO L87 Difference]: Start difference. First operand 498 states and 724 transitions. Second operand 4 states. [2019-10-14 23:45:06,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:06,990 INFO L93 Difference]: Finished difference Result 1029 states and 1554 transitions. [2019-10-14 23:45:06,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:06,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-14 23:45:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:06,994 INFO L225 Difference]: With dead ends: 1029 [2019-10-14 23:45:06,995 INFO L226 Difference]: Without dead ends: 662 [2019-10-14 23:45:06,996 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:45:06,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-10-14 23:45:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 646. [2019-10-14 23:45:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-10-14 23:45:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 968 transitions. [2019-10-14 23:45:07,031 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 968 transitions. Word has length 104 [2019-10-14 23:45:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:07,031 INFO L462 AbstractCegarLoop]: Abstraction has 646 states and 968 transitions. [2019-10-14 23:45:07,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 968 transitions. [2019-10-14 23:45:07,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-14 23:45:07,034 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:07,034 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] [2019-10-14 23:45:07,034 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:07,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:07,035 INFO L82 PathProgramCache]: Analyzing trace with hash 60289518, now seen corresponding path program 1 times [2019-10-14 23:45:07,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:07,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229595875] [2019-10-14 23:45:07,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:07,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:07,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:07,326 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:45:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:07,362 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:45:07,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229595875] [2019-10-14 23:45:07,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:07,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:07,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995050371] [2019-10-14 23:45:07,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:07,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:07,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:07,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:07,366 INFO L87 Difference]: Start difference. First operand 646 states and 968 transitions. Second operand 4 states. [2019-10-14 23:45:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:09,436 INFO L93 Difference]: Finished difference Result 1690 states and 2556 transitions. [2019-10-14 23:45:09,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:09,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-14 23:45:09,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:09,445 INFO L225 Difference]: With dead ends: 1690 [2019-10-14 23:45:09,445 INFO L226 Difference]: Without dead ends: 1241 [2019-10-14 23:45:09,447 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:45:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-10-14 23:45:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1220. [2019-10-14 23:45:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2019-10-14 23:45:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1820 transitions. [2019-10-14 23:45:09,535 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1820 transitions. Word has length 104 [2019-10-14 23:45:09,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:09,536 INFO L462 AbstractCegarLoop]: Abstraction has 1220 states and 1820 transitions. [2019-10-14 23:45:09,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1820 transitions. [2019-10-14 23:45:09,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-14 23:45:09,538 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:09,538 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] [2019-10-14 23:45:09,539 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:09,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:09,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1524807285, now seen corresponding path program 1 times [2019-10-14 23:45:09,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:09,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304735789] [2019-10-14 23:45:09,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:09,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:09,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:10,063 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:45:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:10,107 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:45:10,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304735789] [2019-10-14 23:45:10,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:10,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:10,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706054076] [2019-10-14 23:45:10,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:10,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:10,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:10,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:10,111 INFO L87 Difference]: Start difference. First operand 1220 states and 1820 transitions. Second operand 5 states. [2019-10-14 23:45:11,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:11,366 INFO L93 Difference]: Finished difference Result 1973 states and 2965 transitions. [2019-10-14 23:45:11,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:11,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-14 23:45:11,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:11,372 INFO L225 Difference]: With dead ends: 1973 [2019-10-14 23:45:11,372 INFO L226 Difference]: Without dead ends: 938 [2019-10-14 23:45:11,374 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:45:11,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-10-14 23:45:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2019-10-14 23:45:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2019-10-14 23:45:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1391 transitions. [2019-10-14 23:45:11,418 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1391 transitions. Word has length 104 [2019-10-14 23:45:11,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:11,418 INFO L462 AbstractCegarLoop]: Abstraction has 938 states and 1391 transitions. [2019-10-14 23:45:11,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1391 transitions. [2019-10-14 23:45:11,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:45:11,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:11,420 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] [2019-10-14 23:45:11,421 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:11,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:11,421 INFO L82 PathProgramCache]: Analyzing trace with hash 431033542, now seen corresponding path program 1 times [2019-10-14 23:45:11,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:11,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081609751] [2019-10-14 23:45:11,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:11,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:11,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:11,721 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:45:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:11,757 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:45:11,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081609751] [2019-10-14 23:45:11,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:11,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:11,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114880100] [2019-10-14 23:45:11,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:11,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:11,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:11,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:11,760 INFO L87 Difference]: Start difference. First operand 938 states and 1391 transitions. Second operand 4 states. [2019-10-14 23:45:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:13,126 INFO L93 Difference]: Finished difference Result 2034 states and 3133 transitions. [2019-10-14 23:45:13,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:13,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-14 23:45:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:13,134 INFO L225 Difference]: With dead ends: 2034 [2019-10-14 23:45:13,135 INFO L226 Difference]: Without dead ends: 1366 [2019-10-14 23:45:13,136 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:45:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-10-14 23:45:13,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1322. [2019-10-14 23:45:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-10-14 23:45:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2014 transitions. [2019-10-14 23:45:13,195 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2014 transitions. Word has length 106 [2019-10-14 23:45:13,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:13,195 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 2014 transitions. [2019-10-14 23:45:13,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:13,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2014 transitions. [2019-10-14 23:45:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-14 23:45:13,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:13,198 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:45:13,198 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:13,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1740408399, now seen corresponding path program 1 times [2019-10-14 23:45:13,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:13,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495612360] [2019-10-14 23:45:13,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:13,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:13,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:13,553 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:45:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:13,585 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:45:13,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495612360] [2019-10-14 23:45:13,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:13,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:13,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124398789] [2019-10-14 23:45:13,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:13,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:13,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:13,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:13,588 INFO L87 Difference]: Start difference. First operand 1322 states and 2014 transitions. Second operand 5 states. [2019-10-14 23:45:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:15,404 INFO L93 Difference]: Finished difference Result 3366 states and 5138 transitions. [2019-10-14 23:45:15,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:15,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-14 23:45:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:15,416 INFO L225 Difference]: With dead ends: 3366 [2019-10-14 23:45:15,416 INFO L226 Difference]: Without dead ends: 2067 [2019-10-14 23:45:15,419 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:45:15,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-10-14 23:45:15,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2052. [2019-10-14 23:45:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-10-14 23:45:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 3114 transitions. [2019-10-14 23:45:15,517 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 3114 transitions. Word has length 107 [2019-10-14 23:45:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:15,519 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 3114 transitions. [2019-10-14 23:45:15,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:15,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 3114 transitions. [2019-10-14 23:45:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-14 23:45:15,521 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:15,522 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:45:15,522 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:15,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:15,522 INFO L82 PathProgramCache]: Analyzing trace with hash -481916784, now seen corresponding path program 1 times [2019-10-14 23:45:15,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:15,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883639791] [2019-10-14 23:45:15,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:15,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:15,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:15,858 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:45:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:15,954 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:45:15,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883639791] [2019-10-14 23:45:15,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:15,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:15,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506034906] [2019-10-14 23:45:15,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:15,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:15,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:15,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:15,959 INFO L87 Difference]: Start difference. First operand 2052 states and 3114 transitions. Second operand 4 states. [2019-10-14 23:45:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:17,867 INFO L93 Difference]: Finished difference Result 5515 states and 8477 transitions. [2019-10-14 23:45:17,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:17,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-14 23:45:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:17,883 INFO L225 Difference]: With dead ends: 5515 [2019-10-14 23:45:17,883 INFO L226 Difference]: Without dead ends: 3822 [2019-10-14 23:45:17,887 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:45:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2019-10-14 23:45:18,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3809. [2019-10-14 23:45:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3809 states. [2019-10-14 23:45:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 5773 transitions. [2019-10-14 23:45:18,069 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 5773 transitions. Word has length 109 [2019-10-14 23:45:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:18,070 INFO L462 AbstractCegarLoop]: Abstraction has 3809 states and 5773 transitions. [2019-10-14 23:45:18,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 5773 transitions. [2019-10-14 23:45:18,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-14 23:45:18,073 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:18,073 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:45:18,074 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:18,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:18,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1064644563, now seen corresponding path program 1 times [2019-10-14 23:45:18,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:18,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171631279] [2019-10-14 23:45:18,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:18,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:18,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:18,392 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:45:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:18,419 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:45:18,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171631279] [2019-10-14 23:45:18,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:18,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:18,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298472000] [2019-10-14 23:45:18,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:18,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:18,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:18,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:18,422 INFO L87 Difference]: Start difference. First operand 3809 states and 5773 transitions. Second operand 5 states. [2019-10-14 23:45:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:19,578 INFO L93 Difference]: Finished difference Result 5943 states and 9044 transitions. [2019-10-14 23:45:19,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:19,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-14 23:45:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:19,590 INFO L225 Difference]: With dead ends: 5943 [2019-10-14 23:45:19,591 INFO L226 Difference]: Without dead ends: 3112 [2019-10-14 23:45:19,597 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:45:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2019-10-14 23:45:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 3112. [2019-10-14 23:45:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2019-10-14 23:45:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4697 transitions. [2019-10-14 23:45:19,731 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4697 transitions. Word has length 109 [2019-10-14 23:45:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:19,731 INFO L462 AbstractCegarLoop]: Abstraction has 3112 states and 4697 transitions. [2019-10-14 23:45:19,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:19,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4697 transitions. [2019-10-14 23:45:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-14 23:45:19,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:19,735 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:45:19,735 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:19,736 INFO L82 PathProgramCache]: Analyzing trace with hash 894991708, now seen corresponding path program 1 times [2019-10-14 23:45:19,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:19,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419854219] [2019-10-14 23:45:19,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:19,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:19,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:20,011 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:45:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:20,037 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:45:20,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419854219] [2019-10-14 23:45:20,038 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:20,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:20,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691209488] [2019-10-14 23:45:20,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:20,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:20,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:20,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:20,039 INFO L87 Difference]: Start difference. First operand 3112 states and 4697 transitions. Second operand 4 states. [2019-10-14 23:45:21,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:21,574 INFO L93 Difference]: Finished difference Result 7812 states and 12106 transitions. [2019-10-14 23:45:21,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:21,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-14 23:45:21,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:21,591 INFO L225 Difference]: With dead ends: 7812 [2019-10-14 23:45:21,591 INFO L226 Difference]: Without dead ends: 5036 [2019-10-14 23:45:21,597 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:45:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2019-10-14 23:45:21,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 4830. [2019-10-14 23:45:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4830 states. [2019-10-14 23:45:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4830 states to 4830 states and 7460 transitions. [2019-10-14 23:45:21,792 INFO L78 Accepts]: Start accepts. Automaton has 4830 states and 7460 transitions. Word has length 111 [2019-10-14 23:45:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:21,793 INFO L462 AbstractCegarLoop]: Abstraction has 4830 states and 7460 transitions. [2019-10-14 23:45:21,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4830 states and 7460 transitions. [2019-10-14 23:45:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-14 23:45:21,796 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:21,796 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] [2019-10-14 23:45:21,796 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:21,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:21,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1533697134, now seen corresponding path program 1 times [2019-10-14 23:45:21,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:21,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56384455] [2019-10-14 23:45:21,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:21,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:21,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:22,100 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:45:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:22,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56384455] [2019-10-14 23:45:22,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:22,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:22,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137429584] [2019-10-14 23:45:22,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:22,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:22,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:22,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:22,125 INFO L87 Difference]: Start difference. First operand 4830 states and 7460 transitions. Second operand 4 states. [2019-10-14 23:45:22,380 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-10-14 23:45:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:23,694 INFO L93 Difference]: Finished difference Result 13617 states and 21279 transitions. [2019-10-14 23:45:23,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:23,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-14 23:45:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:23,731 INFO L225 Difference]: With dead ends: 13617 [2019-10-14 23:45:23,731 INFO L226 Difference]: Without dead ends: 9347 [2019-10-14 23:45:23,742 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-14 23:45:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9347 states. [2019-10-14 23:45:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9347 to 9275. [2019-10-14 23:45:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9275 states. [2019-10-14 23:45:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9275 states to 9275 states and 14366 transitions. [2019-10-14 23:45:24,174 INFO L78 Accepts]: Start accepts. Automaton has 9275 states and 14366 transitions. Word has length 112 [2019-10-14 23:45:24,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:24,175 INFO L462 AbstractCegarLoop]: Abstraction has 9275 states and 14366 transitions. [2019-10-14 23:45:24,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 9275 states and 14366 transitions. [2019-10-14 23:45:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-14 23:45:24,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:24,179 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] [2019-10-14 23:45:24,180 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:24,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1051932183, now seen corresponding path program 1 times [2019-10-14 23:45:24,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:24,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582160805] [2019-10-14 23:45:24,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:24,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:24,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:24,495 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:45:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:24,529 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:45:24,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582160805] [2019-10-14 23:45:24,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:24,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:24,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380413023] [2019-10-14 23:45:24,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:24,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:24,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:24,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:24,532 INFO L87 Difference]: Start difference. First operand 9275 states and 14366 transitions. Second operand 5 states. [2019-10-14 23:45:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:26,788 INFO L93 Difference]: Finished difference Result 25948 states and 40113 transitions. [2019-10-14 23:45:26,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:26,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-10-14 23:45:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:26,833 INFO L225 Difference]: With dead ends: 25948 [2019-10-14 23:45:26,833 INFO L226 Difference]: Without dead ends: 16716 [2019-10-14 23:45:26,851 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:45:26,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16716 states. [2019-10-14 23:45:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16716 to 16644. [2019-10-14 23:45:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16644 states. [2019-10-14 23:45:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16644 states to 16644 states and 25497 transitions. [2019-10-14 23:45:27,649 INFO L78 Accepts]: Start accepts. Automaton has 16644 states and 25497 transitions. Word has length 112 [2019-10-14 23:45:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:27,650 INFO L462 AbstractCegarLoop]: Abstraction has 16644 states and 25497 transitions. [2019-10-14 23:45:27,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 16644 states and 25497 transitions. [2019-10-14 23:45:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-14 23:45:27,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:27,657 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] [2019-10-14 23:45:27,657 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:27,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:27,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1424445537, now seen corresponding path program 1 times [2019-10-14 23:45:27,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:27,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648324897] [2019-10-14 23:45:27,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:27,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:27,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:27,896 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:45:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:27,918 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:45:27,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648324897] [2019-10-14 23:45:27,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:27,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:27,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325724312] [2019-10-14 23:45:27,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:27,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:27,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:27,921 INFO L87 Difference]: Start difference. First operand 16644 states and 25497 transitions. Second operand 4 states. [2019-10-14 23:45:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:30,662 INFO L93 Difference]: Finished difference Result 49726 states and 76228 transitions. [2019-10-14 23:45:30,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:30,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-14 23:45:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:30,741 INFO L225 Difference]: With dead ends: 49726 [2019-10-14 23:45:30,742 INFO L226 Difference]: Without dead ends: 33194 [2019-10-14 23:45:30,769 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:45:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33194 states. [2019-10-14 23:45:31,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33194 to 16650. [2019-10-14 23:45:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16650 states. [2019-10-14 23:45:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16650 states to 16650 states and 25503 transitions. [2019-10-14 23:45:31,630 INFO L78 Accepts]: Start accepts. Automaton has 16650 states and 25503 transitions. Word has length 113 [2019-10-14 23:45:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:31,631 INFO L462 AbstractCegarLoop]: Abstraction has 16650 states and 25503 transitions. [2019-10-14 23:45:31,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 16650 states and 25503 transitions. [2019-10-14 23:45:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-14 23:45:31,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:31,637 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] [2019-10-14 23:45:31,637 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:31,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:31,638 INFO L82 PathProgramCache]: Analyzing trace with hash 274337368, now seen corresponding path program 1 times [2019-10-14 23:45:31,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:31,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005118763] [2019-10-14 23:45:31,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:31,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:31,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:31,942 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:45:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:31,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005118763] [2019-10-14 23:45:31,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:31,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:31,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597142205] [2019-10-14 23:45:31,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:31,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:31,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:31,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:31,971 INFO L87 Difference]: Start difference. First operand 16650 states and 25503 transitions. Second operand 5 states.