java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:57:27,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:57:27,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:57:27,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:57:27,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:57:27,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:57:27,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:57:27,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:57:27,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:57:27,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:57:27,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:57:27,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:57:27,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:57:27,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:57:27,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:57:27,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:57:27,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:57:27,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:57:27,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:57:27,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:57:27,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:57:27,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:57:27,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:57:27,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:57:27,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:57:27,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:57:27,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:57:27,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:57:27,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:57:27,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:57:27,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:57:27,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:57:27,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:57:27,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:57:27,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:57:27,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:57:27,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:57:27,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:57:27,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:57:27,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:57:27,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:57:27,402 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:57:27,426 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:57:27,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:57:27,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:57:27,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:57:27,429 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:57:27,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:57:27,429 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:57:27,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:57:27,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:57:27,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:57:27,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:57:27,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:57:27,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:57:27,432 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:57:27,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:57:27,432 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:57:27,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:57:27,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:57:27,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:57:27,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:57:27,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:57:27,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:57:27,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:57:27,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:57:27,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:57:27,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:57:27,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:57:27,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:57:27,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:57:27,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:57:27,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:57:27,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:57:27,517 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:57:27,517 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:57:27,518 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:57:27,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dfb105e9/e4007df4e839459ba99ba1890ce93774/FLAG2ad86ff9d [2019-09-08 12:57:28,110 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:57:28,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:57:28,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dfb105e9/e4007df4e839459ba99ba1890ce93774/FLAG2ad86ff9d [2019-09-08 12:57:28,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dfb105e9/e4007df4e839459ba99ba1890ce93774 [2019-09-08 12:57:28,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:57:28,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:57:28,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:57:28,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:57:28,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:57:28,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:57:28" (1/1) ... [2019-09-08 12:57:28,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@767ffd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:57:28, skipping insertion in model container [2019-09-08 12:57:28,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:57:28" (1/1) ... [2019-09-08 12:57:28,427 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:57:28,490 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:57:28,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:57:28,913 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:57:29,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:57:29,026 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:57:29,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:57:29 WrapperNode [2019-09-08 12:57:29,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:57:29,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:57:29,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:57:29,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:57:29,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:57:29" (1/1) ... [2019-09-08 12:57:29,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:57:29" (1/1) ... [2019-09-08 12:57:29,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:57:29" (1/1) ... [2019-09-08 12:57:29,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:57:29" (1/1) ... [2019-09-08 12:57:29,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:57:29" (1/1) ... [2019-09-08 12:57:29,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:57:29" (1/1) ... [2019-09-08 12:57:29,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:57:29" (1/1) ... [2019-09-08 12:57:29,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:57:29,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:57:29,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:57:29,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:57:29,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:57:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:57:29,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:57:29,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:57:29,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:57:29,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:57:29,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:57:29,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:57:29,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:57:29,163 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:57:29,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:57:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:57:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:57:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:57:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:57:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:57:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:57:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:57:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:57:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:57:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:57:30,105 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:57:30,106 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:57:30,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:57:30 BoogieIcfgContainer [2019-09-08 12:57:30,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:57:30,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:57:30,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:57:30,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:57:30,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:57:28" (1/3) ... [2019-09-08 12:57:30,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0d40bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:57:30, skipping insertion in model container [2019-09-08 12:57:30,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:57:29" (2/3) ... [2019-09-08 12:57:30,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0d40bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:57:30, skipping insertion in model container [2019-09-08 12:57:30,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:57:30" (3/3) ... [2019-09-08 12:57:30,120 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:57:30,130 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:57:30,138 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:57:30,157 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:57:30,189 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:57:30,190 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:57:30,190 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:57:30,190 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:57:30,191 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:57:30,191 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:57:30,191 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:57:30,191 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:57:30,191 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:57:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-09-08 12:57:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 12:57:30,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:30,229 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:30,231 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:30,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:30,239 INFO L82 PathProgramCache]: Analyzing trace with hash 170153311, now seen corresponding path program 1 times [2019-09-08 12:57:30,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:30,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:30,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:30,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:30,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:30,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:30,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:57:30,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:57:30,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:57:30,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:30,738 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 3 states. [2019-09-08 12:57:30,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:30,913 INFO L93 Difference]: Finished difference Result 348 states and 578 transitions. [2019-09-08 12:57:30,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:57:30,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 12:57:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:30,945 INFO L225 Difference]: With dead ends: 348 [2019-09-08 12:57:30,945 INFO L226 Difference]: Without dead ends: 241 [2019-09-08 12:57:30,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:30,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-08 12:57:31,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 238. [2019-09-08 12:57:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-08 12:57:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 369 transitions. [2019-09-08 12:57:31,067 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 369 transitions. Word has length 66 [2019-09-08 12:57:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:31,068 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 369 transitions. [2019-09-08 12:57:31,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:57:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 369 transitions. [2019-09-08 12:57:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:57:31,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:31,072 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:31,073 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:31,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:31,073 INFO L82 PathProgramCache]: Analyzing trace with hash -340326208, now seen corresponding path program 1 times [2019-09-08 12:57:31,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:31,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:31,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:31,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:31,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:31,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:31,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:57:31,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:57:31,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:57:31,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:31,270 INFO L87 Difference]: Start difference. First operand 238 states and 369 transitions. Second operand 3 states. [2019-09-08 12:57:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:31,342 INFO L93 Difference]: Finished difference Result 576 states and 921 transitions. [2019-09-08 12:57:31,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:57:31,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 12:57:31,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:31,346 INFO L225 Difference]: With dead ends: 576 [2019-09-08 12:57:31,346 INFO L226 Difference]: Without dead ends: 399 [2019-09-08 12:57:31,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-08 12:57:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2019-09-08 12:57:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-09-08 12:57:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 624 transitions. [2019-09-08 12:57:31,384 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 624 transitions. Word has length 68 [2019-09-08 12:57:31,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:31,384 INFO L475 AbstractCegarLoop]: Abstraction has 395 states and 624 transitions. [2019-09-08 12:57:31,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:57:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 624 transitions. [2019-09-08 12:57:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 12:57:31,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:31,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:31,391 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:31,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1584902111, now seen corresponding path program 1 times [2019-09-08 12:57:31,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:31,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:31,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:31,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:31,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:31,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:31,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:57:31,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:57:31,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:57:31,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:31,552 INFO L87 Difference]: Start difference. First operand 395 states and 624 transitions. Second operand 3 states. [2019-09-08 12:57:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:31,633 INFO L93 Difference]: Finished difference Result 1031 states and 1658 transitions. [2019-09-08 12:57:31,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:57:31,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 12:57:31,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:31,639 INFO L225 Difference]: With dead ends: 1031 [2019-09-08 12:57:31,639 INFO L226 Difference]: Without dead ends: 697 [2019-09-08 12:57:31,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-08 12:57:31,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 691. [2019-09-08 12:57:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-08 12:57:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1100 transitions. [2019-09-08 12:57:31,690 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1100 transitions. Word has length 70 [2019-09-08 12:57:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:31,691 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 1100 transitions. [2019-09-08 12:57:31,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:57:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1100 transitions. [2019-09-08 12:57:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 12:57:31,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:31,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:31,694 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:31,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:31,695 INFO L82 PathProgramCache]: Analyzing trace with hash 834475330, now seen corresponding path program 1 times [2019-09-08 12:57:31,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:31,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:31,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:31,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:31,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:31,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:31,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:57:31,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:57:31,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:57:31,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:57:31,844 INFO L87 Difference]: Start difference. First operand 691 states and 1100 transitions. Second operand 5 states. [2019-09-08 12:57:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:32,186 INFO L93 Difference]: Finished difference Result 2983 states and 4858 transitions. [2019-09-08 12:57:32,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:57:32,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 12:57:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:32,202 INFO L225 Difference]: With dead ends: 2983 [2019-09-08 12:57:32,203 INFO L226 Difference]: Without dead ends: 2353 [2019-09-08 12:57:32,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:57:32,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-09-08 12:57:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1243. [2019-09-08 12:57:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2019-09-08 12:57:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1995 transitions. [2019-09-08 12:57:32,288 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1995 transitions. Word has length 72 [2019-09-08 12:57:32,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:32,289 INFO L475 AbstractCegarLoop]: Abstraction has 1243 states and 1995 transitions. [2019-09-08 12:57:32,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:57:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1995 transitions. [2019-09-08 12:57:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 12:57:32,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:32,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:32,292 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:32,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash 37321009, now seen corresponding path program 1 times [2019-09-08 12:57:32,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:32,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:32,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:32,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:32,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:32,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:32,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:57:32,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:57:32,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:57:32,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:57:32,382 INFO L87 Difference]: Start difference. First operand 1243 states and 1995 transitions. Second operand 4 states. [2019-09-08 12:57:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:32,573 INFO L93 Difference]: Finished difference Result 3623 states and 5891 transitions. [2019-09-08 12:57:32,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:57:32,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-08 12:57:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:32,588 INFO L225 Difference]: With dead ends: 3623 [2019-09-08 12:57:32,589 INFO L226 Difference]: Without dead ends: 2441 [2019-09-08 12:57:32,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:57:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2019-09-08 12:57:32,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 1833. [2019-09-08 12:57:32,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2019-09-08 12:57:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2956 transitions. [2019-09-08 12:57:32,759 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2956 transitions. Word has length 73 [2019-09-08 12:57:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:32,759 INFO L475 AbstractCegarLoop]: Abstraction has 1833 states and 2956 transitions. [2019-09-08 12:57:32,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:57:32,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2956 transitions. [2019-09-08 12:57:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:57:32,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:32,762 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:32,762 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:32,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:32,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1099898857, now seen corresponding path program 1 times [2019-09-08 12:57:32,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:32,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:32,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:32,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:32,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:32,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:32,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:57:32,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:57:32,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:57:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:57:32,885 INFO L87 Difference]: Start difference. First operand 1833 states and 2956 transitions. Second operand 7 states. [2019-09-08 12:57:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:33,433 INFO L93 Difference]: Finished difference Result 8012 states and 12969 transitions. [2019-09-08 12:57:33,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:57:33,434 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 12:57:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:33,479 INFO L225 Difference]: With dead ends: 8012 [2019-09-08 12:57:33,480 INFO L226 Difference]: Without dead ends: 6240 [2019-09-08 12:57:33,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:57:33,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6240 states. [2019-09-08 12:57:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6240 to 6091. [2019-09-08 12:57:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6091 states. [2019-09-08 12:57:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6091 states to 6091 states and 9828 transitions. [2019-09-08 12:57:33,959 INFO L78 Accepts]: Start accepts. Automaton has 6091 states and 9828 transitions. Word has length 74 [2019-09-08 12:57:33,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:33,960 INFO L475 AbstractCegarLoop]: Abstraction has 6091 states and 9828 transitions. [2019-09-08 12:57:33,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:57:33,960 INFO L276 IsEmpty]: Start isEmpty. Operand 6091 states and 9828 transitions. [2019-09-08 12:57:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 12:57:33,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:33,965 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:33,965 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:33,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:33,965 INFO L82 PathProgramCache]: Analyzing trace with hash -315368200, now seen corresponding path program 1 times [2019-09-08 12:57:33,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:33,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:33,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:33,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:33,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:34,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:34,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:57:34,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:57:34,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:57:34,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:57:34,096 INFO L87 Difference]: Start difference. First operand 6091 states and 9828 transitions. Second operand 4 states. [2019-09-08 12:57:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:34,775 INFO L93 Difference]: Finished difference Result 17740 states and 28748 transitions. [2019-09-08 12:57:34,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:57:34,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-08 12:57:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:34,875 INFO L225 Difference]: With dead ends: 17740 [2019-09-08 12:57:34,875 INFO L226 Difference]: Without dead ends: 12234 [2019-09-08 12:57:34,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:57:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12234 states. [2019-09-08 12:57:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12234 to 8666. [2019-09-08 12:57:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8666 states. [2019-09-08 12:57:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8666 states to 8666 states and 13985 transitions. [2019-09-08 12:57:35,565 INFO L78 Accepts]: Start accepts. Automaton has 8666 states and 13985 transitions. Word has length 75 [2019-09-08 12:57:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:35,566 INFO L475 AbstractCegarLoop]: Abstraction has 8666 states and 13985 transitions. [2019-09-08 12:57:35,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:57:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 8666 states and 13985 transitions. [2019-09-08 12:57:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:57:35,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:35,577 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:35,577 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:35,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:35,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1167797200, now seen corresponding path program 1 times [2019-09-08 12:57:35,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:35,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:35,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:35,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:35,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:35,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:35,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:57:35,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:57:35,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:57:35,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:35,656 INFO L87 Difference]: Start difference. First operand 8666 states and 13985 transitions. Second operand 3 states. [2019-09-08 12:57:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:36,389 INFO L93 Difference]: Finished difference Result 19416 states and 31491 transitions. [2019-09-08 12:57:36,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:57:36,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 12:57:36,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:36,424 INFO L225 Difference]: With dead ends: 19416 [2019-09-08 12:57:36,424 INFO L226 Difference]: Without dead ends: 12910 [2019-09-08 12:57:36,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12910 states. [2019-09-08 12:57:37,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12910 to 12908. [2019-09-08 12:57:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12908 states. [2019-09-08 12:57:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12908 states to 12908 states and 20797 transitions. [2019-09-08 12:57:37,443 INFO L78 Accepts]: Start accepts. Automaton has 12908 states and 20797 transitions. Word has length 76 [2019-09-08 12:57:37,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:37,443 INFO L475 AbstractCegarLoop]: Abstraction has 12908 states and 20797 transitions. [2019-09-08 12:57:37,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:57:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 12908 states and 20797 transitions. [2019-09-08 12:57:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:57:37,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:37,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:37,446 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:37,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:37,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1289808927, now seen corresponding path program 1 times [2019-09-08 12:57:37,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:37,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:37,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:37,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:37,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:37,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:57:37,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:57:37,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:57:37,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:37,506 INFO L87 Difference]: Start difference. First operand 12908 states and 20797 transitions. Second operand 3 states. [2019-09-08 12:57:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:38,166 INFO L93 Difference]: Finished difference Result 28699 states and 46225 transitions. [2019-09-08 12:57:38,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:57:38,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 12:57:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:38,212 INFO L225 Difference]: With dead ends: 28699 [2019-09-08 12:57:38,212 INFO L226 Difference]: Without dead ends: 19264 [2019-09-08 12:57:38,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:38,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19264 states. [2019-09-08 12:57:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19264 to 19262. [2019-09-08 12:57:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19262 states. [2019-09-08 12:57:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19262 states to 19262 states and 30825 transitions. [2019-09-08 12:57:39,080 INFO L78 Accepts]: Start accepts. Automaton has 19262 states and 30825 transitions. Word has length 76 [2019-09-08 12:57:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:39,080 INFO L475 AbstractCegarLoop]: Abstraction has 19262 states and 30825 transitions. [2019-09-08 12:57:39,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:57:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 19262 states and 30825 transitions. [2019-09-08 12:57:39,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:57:39,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:39,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:39,081 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:39,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:39,082 INFO L82 PathProgramCache]: Analyzing trace with hash -645952435, now seen corresponding path program 1 times [2019-09-08 12:57:39,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:39,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:39,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:39,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:39,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:39,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:39,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:57:39,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:57:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:57:39,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:39,149 INFO L87 Difference]: Start difference. First operand 19262 states and 30825 transitions. Second operand 3 states. [2019-09-08 12:57:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:40,484 INFO L93 Difference]: Finished difference Result 41183 states and 65995 transitions. [2019-09-08 12:57:40,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:57:40,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 12:57:40,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:40,551 INFO L225 Difference]: With dead ends: 41183 [2019-09-08 12:57:40,552 INFO L226 Difference]: Without dead ends: 27358 [2019-09-08 12:57:40,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27358 states. [2019-09-08 12:57:41,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27358 to 27356. [2019-09-08 12:57:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27356 states. [2019-09-08 12:57:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27356 states to 27356 states and 43474 transitions. [2019-09-08 12:57:41,613 INFO L78 Accepts]: Start accepts. Automaton has 27356 states and 43474 transitions. Word has length 76 [2019-09-08 12:57:41,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:41,613 INFO L475 AbstractCegarLoop]: Abstraction has 27356 states and 43474 transitions. [2019-09-08 12:57:41,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:57:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 27356 states and 43474 transitions. [2019-09-08 12:57:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:57:41,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:41,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:41,615 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:41,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:41,615 INFO L82 PathProgramCache]: Analyzing trace with hash 384202792, now seen corresponding path program 1 times [2019-09-08 12:57:41,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:41,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:41,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:41,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:41,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:41,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:41,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:57:41,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:57:41,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:57:41,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:57:41,741 INFO L87 Difference]: Start difference. First operand 27356 states and 43474 transitions. Second operand 5 states. [2019-09-08 12:57:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:43,177 INFO L93 Difference]: Finished difference Result 65984 states and 104835 transitions. [2019-09-08 12:57:43,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:57:43,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:57:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:43,260 INFO L225 Difference]: With dead ends: 65984 [2019-09-08 12:57:43,260 INFO L226 Difference]: Without dead ends: 38723 [2019-09-08 12:57:43,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:57:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38723 states. [2019-09-08 12:57:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38723 to 38717. [2019-09-08 12:57:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38717 states. [2019-09-08 12:57:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38717 states to 38717 states and 61352 transitions. [2019-09-08 12:57:45,551 INFO L78 Accepts]: Start accepts. Automaton has 38717 states and 61352 transitions. Word has length 77 [2019-09-08 12:57:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:45,552 INFO L475 AbstractCegarLoop]: Abstraction has 38717 states and 61352 transitions. [2019-09-08 12:57:45,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:57:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 38717 states and 61352 transitions. [2019-09-08 12:57:45,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:57:45,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:45,553 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:45,553 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:45,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:45,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1943011290, now seen corresponding path program 1 times [2019-09-08 12:57:45,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:45,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:45,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:45,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:45,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:45,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:45,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:57:45,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:57:45,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:57:45,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:57:45,718 INFO L87 Difference]: Start difference. First operand 38717 states and 61352 transitions. Second operand 5 states. [2019-09-08 12:57:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:48,759 INFO L93 Difference]: Finished difference Result 124825 states and 198152 transitions. [2019-09-08 12:57:48,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:57:48,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-08 12:57:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:48,941 INFO L225 Difference]: With dead ends: 124825 [2019-09-08 12:57:48,942 INFO L226 Difference]: Without dead ends: 86203 [2019-09-08 12:57:48,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:57:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86203 states. [2019-09-08 12:57:52,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86203 to 54113. [2019-09-08 12:57:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54113 states. [2019-09-08 12:57:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54113 states to 54113 states and 85430 transitions. [2019-09-08 12:57:52,583 INFO L78 Accepts]: Start accepts. Automaton has 54113 states and 85430 transitions. Word has length 80 [2019-09-08 12:57:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:52,583 INFO L475 AbstractCegarLoop]: Abstraction has 54113 states and 85430 transitions. [2019-09-08 12:57:52,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:57:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 54113 states and 85430 transitions. [2019-09-08 12:57:52,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:57:52,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:52,584 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:52,585 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:52,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:52,585 INFO L82 PathProgramCache]: Analyzing trace with hash 101898565, now seen corresponding path program 1 times [2019-09-08 12:57:52,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:52,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:52,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:52,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:52,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:52,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:52,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:57:52,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:57:52,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:57:52,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:57:52,677 INFO L87 Difference]: Start difference. First operand 54113 states and 85430 transitions. Second operand 5 states. [2019-09-08 12:57:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:56,084 INFO L93 Difference]: Finished difference Result 93621 states and 147035 transitions. [2019-09-08 12:57:56,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:57:56,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 12:57:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:56,253 INFO L225 Difference]: With dead ends: 93621 [2019-09-08 12:57:56,253 INFO L226 Difference]: Without dead ends: 93619 [2019-09-08 12:57:56,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:57:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93619 states. [2019-09-08 12:58:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93619 to 55321. [2019-09-08 12:58:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55321 states. [2019-09-08 12:58:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55321 states to 55321 states and 86629 transitions. [2019-09-08 12:58:00,202 INFO L78 Accepts]: Start accepts. Automaton has 55321 states and 86629 transitions. Word has length 81 [2019-09-08 12:58:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:00,202 INFO L475 AbstractCegarLoop]: Abstraction has 55321 states and 86629 transitions. [2019-09-08 12:58:00,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:58:00,202 INFO L276 IsEmpty]: Start isEmpty. Operand 55321 states and 86629 transitions. [2019-09-08 12:58:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:58:00,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:00,205 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:00,205 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:00,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:00,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1367270456, now seen corresponding path program 1 times [2019-09-08 12:58:00,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:00,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:00,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:00,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:00,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:58:00,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:00,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:00,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:00,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:00,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:00,274 INFO L87 Difference]: Start difference. First operand 55321 states and 86629 transitions. Second operand 3 states. [2019-09-08 12:58:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:04,097 INFO L93 Difference]: Finished difference Result 105595 states and 166065 transitions. [2019-09-08 12:58:04,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:04,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 12:58:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:04,234 INFO L225 Difference]: With dead ends: 105595 [2019-09-08 12:58:04,234 INFO L226 Difference]: Without dead ends: 95471 [2019-09-08 12:58:04,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95471 states. [2019-09-08 12:58:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95471 to 95394. [2019-09-08 12:58:09,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95394 states. [2019-09-08 12:58:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95394 states to 95394 states and 149708 transitions. [2019-09-08 12:58:10,065 INFO L78 Accepts]: Start accepts. Automaton has 95394 states and 149708 transitions. Word has length 107 [2019-09-08 12:58:10,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:10,066 INFO L475 AbstractCegarLoop]: Abstraction has 95394 states and 149708 transitions. [2019-09-08 12:58:10,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 95394 states and 149708 transitions. [2019-09-08 12:58:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:58:10,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:10,069 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:10,069 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:10,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:10,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1245258729, now seen corresponding path program 1 times [2019-09-08 12:58:10,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:10,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:10,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:10,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:10,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:58:10,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:10,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:58:10,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:58:10,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:58:10,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:58:10,175 INFO L87 Difference]: Start difference. First operand 95394 states and 149708 transitions. Second operand 5 states. [2019-09-08 12:58:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:15,255 INFO L93 Difference]: Finished difference Result 168191 states and 264603 transitions. [2019-09-08 12:58:15,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:58:15,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-08 12:58:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:15,441 INFO L225 Difference]: With dead ends: 168191 [2019-09-08 12:58:15,441 INFO L226 Difference]: Without dead ends: 110775 [2019-09-08 12:58:15,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:58:15,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110775 states. [2019-09-08 12:58:23,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110775 to 110077. [2019-09-08 12:58:23,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110077 states. [2019-09-08 12:58:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110077 states to 110077 states and 172730 transitions. [2019-09-08 12:58:23,374 INFO L78 Accepts]: Start accepts. Automaton has 110077 states and 172730 transitions. Word has length 107 [2019-09-08 12:58:23,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:23,374 INFO L475 AbstractCegarLoop]: Abstraction has 110077 states and 172730 transitions. [2019-09-08 12:58:23,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:58:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 110077 states and 172730 transitions. [2019-09-08 12:58:23,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:58:23,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:23,377 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:23,377 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:23,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:23,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1113947205, now seen corresponding path program 1 times [2019-09-08 12:58:23,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:23,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:23,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:23,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:23,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:23,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:58:23,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:58:23,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:24,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 12:58:24,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:58:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 12:58:24,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:58:24,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 12:58:24,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:58:24,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:58:24,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:58:24,133 INFO L87 Difference]: Start difference. First operand 110077 states and 172730 transitions. Second operand 8 states. [2019-09-08 12:58:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:31,400 INFO L93 Difference]: Finished difference Result 179851 states and 283176 transitions. [2019-09-08 12:58:31,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:58:31,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2019-09-08 12:58:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:31,835 INFO L225 Difference]: With dead ends: 179851 [2019-09-08 12:58:31,835 INFO L226 Difference]: Without dead ends: 130159 [2019-09-08 12:58:31,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:58:32,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130159 states. [2019-09-08 12:58:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130159 to 119391. [2019-09-08 12:58:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119391 states. [2019-09-08 12:58:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119391 states to 119391 states and 187434 transitions. [2019-09-08 12:58:41,930 INFO L78 Accepts]: Start accepts. Automaton has 119391 states and 187434 transitions. Word has length 107 [2019-09-08 12:58:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:41,931 INFO L475 AbstractCegarLoop]: Abstraction has 119391 states and 187434 transitions. [2019-09-08 12:58:41,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:58:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 119391 states and 187434 transitions. [2019-09-08 12:58:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:58:41,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:41,933 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:41,933 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:41,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:41,934 INFO L82 PathProgramCache]: Analyzing trace with hash 314392514, now seen corresponding path program 1 times [2019-09-08 12:58:41,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:41,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:41,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:41,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:41,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:41,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:41,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:41,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:41,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:41,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:41,999 INFO L87 Difference]: Start difference. First operand 119391 states and 187434 transitions. Second operand 3 states. [2019-09-08 12:58:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:53,367 INFO L93 Difference]: Finished difference Result 351156 states and 550711 transitions. [2019-09-08 12:58:53,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:53,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-08 12:58:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:53,898 INFO L225 Difference]: With dead ends: 351156 [2019-09-08 12:58:53,898 INFO L226 Difference]: Without dead ends: 231860 [2019-09-08 12:58:54,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231860 states. [2019-09-08 12:59:09,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231860 to 231858. [2019-09-08 12:59:09,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231858 states. [2019-09-08 12:59:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231858 states to 231858 states and 361248 transitions. [2019-09-08 12:59:09,781 INFO L78 Accepts]: Start accepts. Automaton has 231858 states and 361248 transitions. Word has length 108 [2019-09-08 12:59:09,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:09,781 INFO L475 AbstractCegarLoop]: Abstraction has 231858 states and 361248 transitions. [2019-09-08 12:59:09,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:59:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 231858 states and 361248 transitions. [2019-09-08 12:59:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:59:09,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:09,786 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:09,786 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:09,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:09,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1871113962, now seen corresponding path program 1 times [2019-09-08 12:59:09,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:09,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:09,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:09,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:09,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:59:09,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:09,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:59:09,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:59:09,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:59:09,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:09,866 INFO L87 Difference]: Start difference. First operand 231858 states and 361248 transitions. Second operand 3 states. [2019-09-08 12:59:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:24,033 INFO L93 Difference]: Finished difference Result 436803 states and 681425 transitions. [2019-09-08 12:59:24,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:59:24,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-08 12:59:24,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:24,361 INFO L225 Difference]: With dead ends: 436803 [2019-09-08 12:59:24,361 INFO L226 Difference]: Without dead ends: 205118 [2019-09-08 12:59:24,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205118 states. [2019-09-08 12:59:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205118 to 205116. [2019-09-08 12:59:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205116 states. [2019-09-08 12:59:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205116 states to 205116 states and 318436 transitions. [2019-09-08 12:59:41,197 INFO L78 Accepts]: Start accepts. Automaton has 205116 states and 318436 transitions. Word has length 108 [2019-09-08 12:59:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:41,197 INFO L475 AbstractCegarLoop]: Abstraction has 205116 states and 318436 transitions. [2019-09-08 12:59:41,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:59:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 205116 states and 318436 transitions. [2019-09-08 12:59:41,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:59:41,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:41,202 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:41,202 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:41,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:41,202 INFO L82 PathProgramCache]: Analyzing trace with hash -461997720, now seen corresponding path program 1 times [2019-09-08 12:59:41,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:41,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:41,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:41,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:41,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 12:59:41,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:41,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:59:41,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:59:41,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:59:41,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:41,273 INFO L87 Difference]: Start difference. First operand 205116 states and 318436 transitions. Second operand 3 states. [2019-09-08 13:00:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:04,065 INFO L93 Difference]: Finished difference Result 490414 states and 762816 transitions. [2019-09-08 13:00:04,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:00:04,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-08 13:00:04,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:05,050 INFO L225 Difference]: With dead ends: 490414 [2019-09-08 13:00:05,051 INFO L226 Difference]: Without dead ends: 372799 [2019-09-08 13:00:05,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:00:05,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372799 states. [2019-09-08 13:00:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372799 to 371773. [2019-09-08 13:00:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371773 states. [2019-09-08 13:00:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371773 states to 371773 states and 576443 transitions. [2019-09-08 13:00:31,678 INFO L78 Accepts]: Start accepts. Automaton has 371773 states and 576443 transitions. Word has length 110 [2019-09-08 13:00:31,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:31,679 INFO L475 AbstractCegarLoop]: Abstraction has 371773 states and 576443 transitions. [2019-09-08 13:00:31,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:00:31,679 INFO L276 IsEmpty]: Start isEmpty. Operand 371773 states and 576443 transitions. [2019-09-08 13:00:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 13:00:31,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:31,684 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:31,684 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:31,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:31,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1784640277, now seen corresponding path program 1 times [2019-09-08 13:00:31,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:31,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:31,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:31,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:31,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:00:31,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:00:31,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 13:00:31,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:31,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 13:00:31,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:00:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 13:00:32,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:00:32,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-09-08 13:00:32,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 13:00:32,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 13:00:32,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 13:00:32,009 INFO L87 Difference]: Start difference. First operand 371773 states and 576443 transitions. Second operand 10 states. [2019-09-08 13:04:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:09,603 INFO L93 Difference]: Finished difference Result 3423315 states and 5358457 transitions. [2019-09-08 13:04:09,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 13:04:09,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2019-09-08 13:04:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:18,141 INFO L225 Difference]: With dead ends: 3423315 [2019-09-08 13:04:18,142 INFO L226 Difference]: Without dead ends: 3157120 [2019-09-08 13:04:18,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=672, Invalid=2520, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 13:04:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3157120 states.