java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:44:52,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:44:52,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:44:52,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:44:52,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:44:52,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:44:52,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:44:52,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:44:52,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:44:52,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:44:52,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:44:52,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:44:52,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:44:52,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:44:52,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:44:52,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:44:52,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:44:52,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:44:52,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:44:52,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:44:52,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:44:52,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:44:52,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:44:52,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:44:52,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:44:52,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:44:52,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:44:52,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:44:52,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:44:52,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:44:52,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:44:52,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:44:52,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:44:52,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:44:52,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:44:52,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:44:52,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:44:52,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:44:52,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:44:52,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:44:52,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:44:52,386 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:44:52,406 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:44:52,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:44:52,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:44:52,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:44:52,409 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:44:52,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:44:52,409 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:44:52,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:44:52,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:44:52,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:44:52,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:44:52,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:44:52,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:44:52,412 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:44:52,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:44:52,412 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:44:52,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:44:52,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:44:52,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:44:52,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:44:52,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:44:52,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:44:52,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:44:52,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:44:52,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:44:52,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:44:52,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:44:52,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:44:52,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:44:52,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:44:52,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:44:52,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:44:52,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:44:52,700 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:44:52,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 19:44:52,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46516c94b/b9f688d86d134e20a539ab1d94bd4252/FLAG31e7f2569 [2019-10-13 19:44:53,327 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:44:53,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 19:44:53,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46516c94b/b9f688d86d134e20a539ab1d94bd4252/FLAG31e7f2569 [2019-10-13 19:44:53,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46516c94b/b9f688d86d134e20a539ab1d94bd4252 [2019-10-13 19:44:53,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:44:53,690 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:44:53,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:44:53,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:44:53,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:44:53,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:44:53" (1/1) ... [2019-10-13 19:44:53,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e55f71c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:53, skipping insertion in model container [2019-10-13 19:44:53,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:44:53" (1/1) ... [2019-10-13 19:44:53,711 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:44:53,787 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:44:54,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:44:54,242 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:44:54,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:44:54,379 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:44:54,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:54 WrapperNode [2019-10-13 19:44:54,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:44:54,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:44:54,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:44:54,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:44:54,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:54" (1/1) ... [2019-10-13 19:44:54,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:54" (1/1) ... [2019-10-13 19:44:54,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:54" (1/1) ... [2019-10-13 19:44:54,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:54" (1/1) ... [2019-10-13 19:44:54,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:54" (1/1) ... [2019-10-13 19:44:54,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:54" (1/1) ... [2019-10-13 19:44:54,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:54" (1/1) ... [2019-10-13 19:44:54,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:44:54,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:44:54,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:44:54,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:44:54,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:54" (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:44:54,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:44:54,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:44:54,529 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:44:54,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:44:54,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:44:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 19:44:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 19:44:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 19:44:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:44:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 19:44:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 19:44:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 19:44:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 19:44:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 19:44:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 19:44:54,531 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 19:44:54,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:44:54,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:44:54,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:44:55,884 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:44:55,884 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 19:44:55,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:44:55 BoogieIcfgContainer [2019-10-13 19:44:55,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:44:55,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:44:55,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:44:55,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:44:55,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:44:53" (1/3) ... [2019-10-13 19:44:55,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38156bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:44:55, skipping insertion in model container [2019-10-13 19:44:55,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:54" (2/3) ... [2019-10-13 19:44:55,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38156bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:44:55, skipping insertion in model container [2019-10-13 19:44:55,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:44:55" (3/3) ... [2019-10-13 19:44:55,903 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 19:44:55,914 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:44:55,935 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:44:55,946 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:44:55,982 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:44:55,982 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:44:55,982 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:44:55,982 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:44:55,982 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:44:55,982 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:44:55,983 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:44:55,983 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:44:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states. [2019-10-13 19:44:56,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 19:44:56,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:56,018 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:44:56,020 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:56,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1231650886, now seen corresponding path program 1 times [2019-10-13 19:44:56,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:56,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266248347] [2019-10-13 19:44:56,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:56,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:56,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:56,950 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:44:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:57,022 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:44:57,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266248347] [2019-10-13 19:44:57,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:57,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:57,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478701400] [2019-10-13 19:44:57,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:44:57,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:57,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:44:57,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:57,049 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 5 states. [2019-10-13 19:44:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:59,050 INFO L93 Difference]: Finished difference Result 654 states and 1145 transitions. [2019-10-13 19:44:59,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:44:59,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-13 19:44:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:59,069 INFO L225 Difference]: With dead ends: 654 [2019-10-13 19:44:59,069 INFO L226 Difference]: Without dead ends: 430 [2019-10-13 19:44:59,074 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-13 19:44:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-13 19:44:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2019-10-13 19:44:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-10-13 19:44:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 627 transitions. [2019-10-13 19:44:59,180 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 627 transitions. Word has length 99 [2019-10-13 19:44:59,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:59,181 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 627 transitions. [2019-10-13 19:44:59,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:44:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 627 transitions. [2019-10-13 19:44:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 19:44:59,186 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:59,186 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:44:59,187 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash 829692944, now seen corresponding path program 1 times [2019-10-13 19:44:59,188 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:59,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391771076] [2019-10-13 19:44:59,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:59,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:59,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:59,435 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:44:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:59,460 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:44:59,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391771076] [2019-10-13 19:44:59,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:59,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:44:59,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793738600] [2019-10-13 19:44:59,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:44:59,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:59,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:44:59,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:59,464 INFO L87 Difference]: Start difference. First operand 428 states and 627 transitions. Second operand 4 states. [2019-10-13 19:45:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:00,655 INFO L93 Difference]: Finished difference Result 1238 states and 1811 transitions. [2019-10-13 19:45:00,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:00,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-13 19:45:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:00,660 INFO L225 Difference]: With dead ends: 1238 [2019-10-13 19:45:00,660 INFO L226 Difference]: Without dead ends: 842 [2019-10-13 19:45:00,664 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:00,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-10-13 19:45:00,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 430. [2019-10-13 19:45:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-10-13 19:45:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 629 transitions. [2019-10-13 19:45:00,709 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 629 transitions. Word has length 100 [2019-10-13 19:45:00,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:00,710 INFO L462 AbstractCegarLoop]: Abstraction has 430 states and 629 transitions. [2019-10-13 19:45:00,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 629 transitions. [2019-10-13 19:45:00,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 19:45:00,715 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:00,715 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:00,715 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:00,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:00,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1677637145, now seen corresponding path program 1 times [2019-10-13 19:45:00,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:00,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635378784] [2019-10-13 19:45:00,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:00,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:00,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:01,082 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:45:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:01,109 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:01,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635378784] [2019-10-13 19:45:01,110 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:01,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:01,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633124748] [2019-10-13 19:45:01,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:01,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:01,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:01,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:01,112 INFO L87 Difference]: Start difference. First operand 430 states and 629 transitions. Second operand 5 states. [2019-10-13 19:45:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:02,037 INFO L93 Difference]: Finished difference Result 846 states and 1240 transitions. [2019-10-13 19:45:02,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:02,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-10-13 19:45:02,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:02,041 INFO L225 Difference]: With dead ends: 846 [2019-10-13 19:45:02,041 INFO L226 Difference]: Without dead ends: 428 [2019-10-13 19:45:02,042 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:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-10-13 19:45:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2019-10-13 19:45:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-10-13 19:45:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 625 transitions. [2019-10-13 19:45:02,066 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 625 transitions. Word has length 101 [2019-10-13 19:45:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:02,066 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 625 transitions. [2019-10-13 19:45:02,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 625 transitions. [2019-10-13 19:45:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 19:45:02,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:02,068 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:02,069 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:02,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:02,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1471843135, now seen corresponding path program 1 times [2019-10-13 19:45:02,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:02,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795731990] [2019-10-13 19:45:02,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:02,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:02,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:02,359 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:45:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:02,388 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:02,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795731990] [2019-10-13 19:45:02,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:02,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:02,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697414186] [2019-10-13 19:45:02,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:02,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:02,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:02,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:02,391 INFO L87 Difference]: Start difference. First operand 428 states and 625 transitions. Second operand 4 states. [2019-10-13 19:45:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:04,095 INFO L93 Difference]: Finished difference Result 881 states and 1305 transitions. [2019-10-13 19:45:04,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:04,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-13 19:45:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:04,099 INFO L225 Difference]: With dead ends: 881 [2019-10-13 19:45:04,100 INFO L226 Difference]: Without dead ends: 631 [2019-10-13 19:45:04,101 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:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-13 19:45:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 629. [2019-10-13 19:45:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-13 19:45:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 910 transitions. [2019-10-13 19:45:04,155 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 910 transitions. Word has length 101 [2019-10-13 19:45:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:04,157 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 910 transitions. [2019-10-13 19:45:04,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 910 transitions. [2019-10-13 19:45:04,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 19:45:04,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:04,161 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-13 19:45:04,162 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:04,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1316339424, now seen corresponding path program 1 times [2019-10-13 19:45:04,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:04,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119939607] [2019-10-13 19:45:04,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:04,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:04,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:04,610 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:45:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:04,645 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:04,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119939607] [2019-10-13 19:45:04,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:04,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:04,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736282909] [2019-10-13 19:45:04,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:45:04,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:45:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:45:04,649 INFO L87 Difference]: Start difference. First operand 629 states and 910 transitions. Second operand 6 states. [2019-10-13 19:45:04,888 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:05,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:05,897 INFO L93 Difference]: Finished difference Result 1413 states and 2116 transitions. [2019-10-13 19:45:05,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:45:05,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-10-13 19:45:05,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:05,903 INFO L225 Difference]: With dead ends: 1413 [2019-10-13 19:45:05,904 INFO L226 Difference]: Without dead ends: 952 [2019-10-13 19:45:05,905 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:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-10-13 19:45:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 950. [2019-10-13 19:45:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-10-13 19:45:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1405 transitions. [2019-10-13 19:45:05,964 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1405 transitions. Word has length 103 [2019-10-13 19:45:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:05,964 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1405 transitions. [2019-10-13 19:45:05,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:45:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1405 transitions. [2019-10-13 19:45:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 19:45:05,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:05,968 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-13 19:45:05,968 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:05,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:05,968 INFO L82 PathProgramCache]: Analyzing trace with hash 822354405, now seen corresponding path program 1 times [2019-10-13 19:45:05,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:05,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55032558] [2019-10-13 19:45:05,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:05,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:05,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:06,333 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:45:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:06,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-13 19:45:06,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55032558] [2019-10-13 19:45:06,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:06,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:06,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305748630] [2019-10-13 19:45:06,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:06,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:06,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:06,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:06,365 INFO L87 Difference]: Start difference. First operand 950 states and 1405 transitions. Second operand 5 states. [2019-10-13 19:45:07,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:07,870 INFO L93 Difference]: Finished difference Result 2380 states and 3527 transitions. [2019-10-13 19:45:07,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:07,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-13 19:45:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:07,879 INFO L225 Difference]: With dead ends: 2380 [2019-10-13 19:45:07,880 INFO L226 Difference]: Without dead ends: 1453 [2019-10-13 19:45:07,882 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:07,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-10-13 19:45:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1451. [2019-10-13 19:45:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-10-13 19:45:07,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2130 transitions. [2019-10-13 19:45:07,965 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2130 transitions. Word has length 103 [2019-10-13 19:45:07,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:07,966 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 2130 transitions. [2019-10-13 19:45:07,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:07,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2130 transitions. [2019-10-13 19:45:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:45:07,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:07,969 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:07,970 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:07,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:07,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1353908859, now seen corresponding path program 1 times [2019-10-13 19:45:07,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:07,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040169258] [2019-10-13 19:45:07,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:07,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:07,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:08,293 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:45:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:08,319 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:08,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040169258] [2019-10-13 19:45:08,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:08,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:08,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709345839] [2019-10-13 19:45:08,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:08,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:08,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:08,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:08,322 INFO L87 Difference]: Start difference. First operand 1451 states and 2130 transitions. Second operand 5 states. [2019-10-13 19:45:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:09,322 INFO L93 Difference]: Finished difference Result 2511 states and 3707 transitions. [2019-10-13 19:45:09,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:09,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-13 19:45:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:09,330 INFO L225 Difference]: With dead ends: 2511 [2019-10-13 19:45:09,331 INFO L226 Difference]: Without dead ends: 1451 [2019-10-13 19:45:09,334 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:09,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2019-10-13 19:45:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1451. [2019-10-13 19:45:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-10-13 19:45:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2129 transitions. [2019-10-13 19:45:09,454 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2129 transitions. Word has length 105 [2019-10-13 19:45:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:09,454 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 2129 transitions. [2019-10-13 19:45:09,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2129 transitions. [2019-10-13 19:45:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:45:09,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:09,457 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:09,457 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:09,458 INFO L82 PathProgramCache]: Analyzing trace with hash -673168968, now seen corresponding path program 1 times [2019-10-13 19:45:09,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:09,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473803831] [2019-10-13 19:45:09,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:09,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:09,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:09,721 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:45:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:09,773 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:09,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473803831] [2019-10-13 19:45:09,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:09,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:09,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736788859] [2019-10-13 19:45:09,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:09,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:09,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:09,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:09,778 INFO L87 Difference]: Start difference. First operand 1451 states and 2129 transitions. Second operand 4 states. [2019-10-13 19:45:11,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:11,366 INFO L93 Difference]: Finished difference Result 3308 states and 4930 transitions. [2019-10-13 19:45:11,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:11,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-13 19:45:11,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:11,376 INFO L225 Difference]: With dead ends: 3308 [2019-10-13 19:45:11,377 INFO L226 Difference]: Without dead ends: 2200 [2019-10-13 19:45:11,379 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:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2019-10-13 19:45:11,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 2198. [2019-10-13 19:45:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2198 states. [2019-10-13 19:45:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 3202 transitions. [2019-10-13 19:45:11,496 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 3202 transitions. Word has length 105 [2019-10-13 19:45:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:11,497 INFO L462 AbstractCegarLoop]: Abstraction has 2198 states and 3202 transitions. [2019-10-13 19:45:11,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 3202 transitions. [2019-10-13 19:45:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 19:45:11,501 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:11,501 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-13 19:45:11,502 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:11,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash -312373315, now seen corresponding path program 1 times [2019-10-13 19:45:11,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:11,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675014841] [2019-10-13 19:45:11,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:11,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:11,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:11,874 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:45:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:11,905 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:11,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675014841] [2019-10-13 19:45:11,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:11,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:11,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047714322] [2019-10-13 19:45:11,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:11,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:11,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:11,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:11,910 INFO L87 Difference]: Start difference. First operand 2198 states and 3202 transitions. Second operand 5 states. [2019-10-13 19:45:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:13,433 INFO L93 Difference]: Finished difference Result 6352 states and 9243 transitions. [2019-10-13 19:45:13,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:13,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-13 19:45:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:13,461 INFO L225 Difference]: With dead ends: 6352 [2019-10-13 19:45:13,461 INFO L226 Difference]: Without dead ends: 4197 [2019-10-13 19:45:13,467 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:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4197 states. [2019-10-13 19:45:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4197 to 4195. [2019-10-13 19:45:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2019-10-13 19:45:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 6052 transitions. [2019-10-13 19:45:13,691 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 6052 transitions. Word has length 107 [2019-10-13 19:45:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:13,692 INFO L462 AbstractCegarLoop]: Abstraction has 4195 states and 6052 transitions. [2019-10-13 19:45:13,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 6052 transitions. [2019-10-13 19:45:13,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 19:45:13,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:13,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] [2019-10-13 19:45:13,697 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:13,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:13,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1907705071, now seen corresponding path program 1 times [2019-10-13 19:45:13,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:13,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487995708] [2019-10-13 19:45:13,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:13,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:13,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:13,952 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:45:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:14,018 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:14,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487995708] [2019-10-13 19:45:14,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:14,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:14,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945374840] [2019-10-13 19:45:14,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:14,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:14,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:14,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:14,021 INFO L87 Difference]: Start difference. First operand 4195 states and 6052 transitions. Second operand 4 states. [2019-10-13 19:45:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:15,195 INFO L93 Difference]: Finished difference Result 12393 states and 17909 transitions. [2019-10-13 19:45:15,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:15,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-10-13 19:45:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:15,276 INFO L225 Difference]: With dead ends: 12393 [2019-10-13 19:45:15,276 INFO L226 Difference]: Without dead ends: 8303 [2019-10-13 19:45:15,286 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:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8303 states. [2019-10-13 19:45:15,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8303 to 4201. [2019-10-13 19:45:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4201 states. [2019-10-13 19:45:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 6058 transitions. [2019-10-13 19:45:15,520 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 6058 transitions. Word has length 108 [2019-10-13 19:45:15,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:15,520 INFO L462 AbstractCegarLoop]: Abstraction has 4201 states and 6058 transitions. [2019-10-13 19:45:15,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 6058 transitions. [2019-10-13 19:45:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 19:45:15,525 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:15,526 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-13 19:45:15,526 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:15,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:15,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1358405212, now seen corresponding path program 1 times [2019-10-13 19:45:15,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:15,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415500912] [2019-10-13 19:45:15,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:15,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:15,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:15,764 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:45:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:15,788 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:15,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415500912] [2019-10-13 19:45:15,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:15,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:15,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825704586] [2019-10-13 19:45:15,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:15,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:15,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:15,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:15,791 INFO L87 Difference]: Start difference. First operand 4201 states and 6058 transitions. Second operand 5 states. [2019-10-13 19:45:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:16,809 INFO L93 Difference]: Finished difference Result 8360 states and 12060 transitions. [2019-10-13 19:45:16,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:16,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-13 19:45:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:16,825 INFO L225 Difference]: With dead ends: 8360 [2019-10-13 19:45:16,826 INFO L226 Difference]: Without dead ends: 4195 [2019-10-13 19:45:16,832 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:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2019-10-13 19:45:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 4195. [2019-10-13 19:45:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4195 states. [2019-10-13 19:45:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 6046 transitions. [2019-10-13 19:45:17,035 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 6046 transitions. Word has length 109 [2019-10-13 19:45:17,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:17,035 INFO L462 AbstractCegarLoop]: Abstraction has 4195 states and 6046 transitions. [2019-10-13 19:45:17,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:17,036 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 6046 transitions. [2019-10-13 19:45:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 19:45:17,041 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:17,041 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-13 19:45:17,041 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:17,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:17,042 INFO L82 PathProgramCache]: Analyzing trace with hash 825640158, now seen corresponding path program 1 times [2019-10-13 19:45:17,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:17,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485963276] [2019-10-13 19:45:17,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:17,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:17,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:17,283 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:45:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:17,315 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:17,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485963276] [2019-10-13 19:45:17,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:17,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:17,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424254172] [2019-10-13 19:45:17,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:17,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:17,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:17,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:17,318 INFO L87 Difference]: Start difference. First operand 4195 states and 6046 transitions. Second operand 4 states. [2019-10-13 19:45:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:18,996 INFO L93 Difference]: Finished difference Result 9753 states and 14169 transitions. [2019-10-13 19:45:18,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:18,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-13 19:45:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:19,011 INFO L225 Difference]: With dead ends: 9753 [2019-10-13 19:45:19,011 INFO L226 Difference]: Without dead ends: 6233 [2019-10-13 19:45:19,018 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:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2019-10-13 19:45:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 6231. [2019-10-13 19:45:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2019-10-13 19:45:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 8841 transitions. [2019-10-13 19:45:19,318 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 8841 transitions. Word has length 109 [2019-10-13 19:45:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:19,319 INFO L462 AbstractCegarLoop]: Abstraction has 6231 states and 8841 transitions. [2019-10-13 19:45:19,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 8841 transitions. [2019-10-13 19:45:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 19:45:19,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:19,324 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-13 19:45:19,325 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:19,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:19,325 INFO L82 PathProgramCache]: Analyzing trace with hash 200750214, now seen corresponding path program 1 times [2019-10-13 19:45:19,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:19,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998752142] [2019-10-13 19:45:19,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:19,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:19,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:19,745 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:45:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:19,789 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,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998752142] [2019-10-13 19:45:19,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:19,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 19:45:19,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778045398] [2019-10-13 19:45:19,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 19:45:19,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:19,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 19:45:19,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:45:19,792 INFO L87 Difference]: Start difference. First operand 6231 states and 8841 transitions. Second operand 13 states. [2019-10-13 19:45:20,073 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-10-13 19:45:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:22,639 INFO L93 Difference]: Finished difference Result 17888 states and 26756 transitions. [2019-10-13 19:45:22,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:45:22,640 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 111 [2019-10-13 19:45:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:22,673 INFO L225 Difference]: With dead ends: 17888 [2019-10-13 19:45:22,673 INFO L226 Difference]: Without dead ends: 13847 [2019-10-13 19:45:22,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-10-13 19:45:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13847 states. [2019-10-13 19:45:23,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13847 to 12191. [2019-10-13 19:45:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12191 states. [2019-10-13 19:45:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12191 states to 12191 states and 17824 transitions. [2019-10-13 19:45:23,465 INFO L78 Accepts]: Start accepts. Automaton has 12191 states and 17824 transitions. Word has length 111 [2019-10-13 19:45:23,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:23,466 INFO L462 AbstractCegarLoop]: Abstraction has 12191 states and 17824 transitions. [2019-10-13 19:45:23,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 19:45:23,466 INFO L276 IsEmpty]: Start isEmpty. Operand 12191 states and 17824 transitions. [2019-10-13 19:45:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 19:45:23,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:23,473 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-13 19:45:23,473 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash -825612106, now seen corresponding path program 1 times [2019-10-13 19:45:23,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:23,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952644734] [2019-10-13 19:45:23,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:23,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:23,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:23,758 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:45:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:23,797 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:23,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952644734] [2019-10-13 19:45:23,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:23,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:23,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842778693] [2019-10-13 19:45:23,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:23,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:23,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:23,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:23,800 INFO L87 Difference]: Start difference. First operand 12191 states and 17824 transitions. Second operand 4 states. [2019-10-13 19:45:24,004 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-13 19:45:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:26,095 INFO L93 Difference]: Finished difference Result 28778 states and 44113 transitions. [2019-10-13 19:45:26,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:26,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-13 19:45:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:26,144 INFO L225 Difference]: With dead ends: 28778 [2019-10-13 19:45:26,145 INFO L226 Difference]: Without dead ends: 20474 [2019-10-13 19:45:26,161 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:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20474 states. [2019-10-13 19:45:27,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20474 to 20448. [2019-10-13 19:45:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20448 states. [2019-10-13 19:45:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20448 states to 20448 states and 30546 transitions. [2019-10-13 19:45:27,425 INFO L78 Accepts]: Start accepts. Automaton has 20448 states and 30546 transitions. Word has length 111 [2019-10-13 19:45:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:27,426 INFO L462 AbstractCegarLoop]: Abstraction has 20448 states and 30546 transitions. [2019-10-13 19:45:27,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 20448 states and 30546 transitions. [2019-10-13 19:45:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 19:45:27,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:27,433 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:27,433 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:27,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:27,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1946924417, now seen corresponding path program 1 times [2019-10-13 19:45:27,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:27,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476506920] [2019-10-13 19:45:27,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:27,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:27,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:27,820 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-10-13 19:45:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:27,846 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,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476506920] [2019-10-13 19:45:27,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:27,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 19:45:27,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563494971] [2019-10-13 19:45:27,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:45:27,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:27,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:45:27,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:45:27,848 INFO L87 Difference]: Start difference. First operand 20448 states and 30546 transitions. Second operand 9 states. [2019-10-13 19:45:28,048 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 161