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_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:21:04,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:21:04,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:21:04,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:21:04,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:21:04,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:21:04,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:21:04,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:21:04,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:21:04,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:21:04,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:21:04,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:21:04,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:21:04,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:21:04,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:21:04,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:21:04,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:21:04,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:21:04,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:21:04,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:21:04,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:21:04,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:21:04,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:21:04,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:21:04,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:21:04,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:21:04,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:21:04,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:21:04,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:21:04,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:21:04,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:21:04,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:21:04,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:21:04,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:21:04,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:21:04,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:21:04,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:21:04,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:21:04,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:21:04,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:21:04,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:21:04,192 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 11:21:04,216 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:21:04,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:21:04,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:21:04,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:21:04,218 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:21:04,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:21:04,218 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:21:04,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:21:04,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:21:04,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:21:04,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:21:04,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:21:04,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:21:04,219 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:21:04,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:21:04,220 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:21:04,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:21:04,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:21:04,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:21:04,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:21:04,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:21:04,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:21:04,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:21:04,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:21:04,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:21:04,222 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:21:04,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:21:04,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:21:04,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:21:04,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:21:04,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:21:04,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:21:04,269 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:21:04,269 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:21:04,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-08 11:21:04,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8c8f1857/88e1175334d448c4ac521893d62eb0a6/FLAG204a8d4e7 [2019-09-08 11:21:04,914 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:21:04,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-08 11:21:04,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8c8f1857/88e1175334d448c4ac521893d62eb0a6/FLAG204a8d4e7 [2019-09-08 11:21:05,173 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8c8f1857/88e1175334d448c4ac521893d62eb0a6 [2019-09-08 11:21:05,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:21:05,184 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:21:05,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:21:05,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:21:05,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:21:05,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:21:05" (1/1) ... [2019-09-08 11:21:05,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e83ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:05, skipping insertion in model container [2019-09-08 11:21:05,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:21:05" (1/1) ... [2019-09-08 11:21:05,203 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:21:05,283 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:21:05,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:21:05,918 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:21:06,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:21:06,345 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:21:06,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:06 WrapperNode [2019-09-08 11:21:06,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:21:06,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:21:06,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:21:06,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:21:06,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:06" (1/1) ... [2019-09-08 11:21:06,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:06" (1/1) ... [2019-09-08 11:21:06,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:06" (1/1) ... [2019-09-08 11:21:06,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:06" (1/1) ... [2019-09-08 11:21:06,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:06" (1/1) ... [2019-09-08 11:21:06,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:06" (1/1) ... [2019-09-08 11:21:06,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:06" (1/1) ... [2019-09-08 11:21:06,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:21:06,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:21:06,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:21:06,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:21:06,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:06" (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 11:21:06,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:21:06,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:21:06,545 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:21:06,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:21:06,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:21:06,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:21:06,546 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:21:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:21:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:21:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:21:06,548 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:21:06,548 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:21:06,549 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:21:06,549 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:21:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:21:06,551 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 11:21:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:21:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:21:06,554 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:21:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:21:06,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:21:08,358 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:21:08,359 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:21:08,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:21:08 BoogieIcfgContainer [2019-09-08 11:21:08,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:21:08,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:21:08,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:21:08,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:21:08,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:21:05" (1/3) ... [2019-09-08 11:21:08,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbbabc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:21:08, skipping insertion in model container [2019-09-08 11:21:08,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:21:06" (2/3) ... [2019-09-08 11:21:08,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbbabc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:21:08, skipping insertion in model container [2019-09-08 11:21:08,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:21:08" (3/3) ... [2019-09-08 11:21:08,368 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-08 11:21:08,378 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:21:08,388 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:21:08,407 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:21:08,452 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:21:08,453 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:21:08,453 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:21:08,453 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:21:08,453 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:21:08,453 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:21:08,454 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:21:08,454 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:21:08,454 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:21:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states. [2019-09-08 11:21:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 11:21:08,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:08,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:08,519 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:08,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:08,524 INFO L82 PathProgramCache]: Analyzing trace with hash 58728648, now seen corresponding path program 1 times [2019-09-08 11:21:08,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:08,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:08,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:08,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:08,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:09,036 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 11:21:09,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:09,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:21:09,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:21:09,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:21:09,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:21:09,063 INFO L87 Difference]: Start difference. First operand 492 states. Second operand 4 states. [2019-09-08 11:21:09,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:09,360 INFO L93 Difference]: Finished difference Result 941 states and 1526 transitions. [2019-09-08 11:21:09,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:21:09,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-08 11:21:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:09,393 INFO L225 Difference]: With dead ends: 941 [2019-09-08 11:21:09,393 INFO L226 Difference]: Without dead ends: 488 [2019-09-08 11:21:09,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:21:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-08 11:21:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2019-09-08 11:21:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-08 11:21:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 752 transitions. [2019-09-08 11:21:09,489 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 752 transitions. Word has length 123 [2019-09-08 11:21:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:09,489 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 752 transitions. [2019-09-08 11:21:09,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:21:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 752 transitions. [2019-09-08 11:21:09,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 11:21:09,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:09,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:09,503 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:09,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:09,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1001904736, now seen corresponding path program 1 times [2019-09-08 11:21:09,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:09,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:09,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:09,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:09,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:09,783 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 11:21:09,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:09,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:09,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:09,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:09,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:09,787 INFO L87 Difference]: Start difference. First operand 488 states and 752 transitions. Second operand 3 states. [2019-09-08 11:21:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:09,888 INFO L93 Difference]: Finished difference Result 1209 states and 1905 transitions. [2019-09-08 11:21:09,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:09,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-08 11:21:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:09,896 INFO L225 Difference]: With dead ends: 1209 [2019-09-08 11:21:09,896 INFO L226 Difference]: Without dead ends: 778 [2019-09-08 11:21:09,899 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 11:21:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-08 11:21:09,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2019-09-08 11:21:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-09-08 11:21:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1210 transitions. [2019-09-08 11:21:09,964 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1210 transitions. Word has length 163 [2019-09-08 11:21:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:09,966 INFO L475 AbstractCegarLoop]: Abstraction has 776 states and 1210 transitions. [2019-09-08 11:21:09,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1210 transitions. [2019-09-08 11:21:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 11:21:09,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:09,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:09,973 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:09,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:09,975 INFO L82 PathProgramCache]: Analyzing trace with hash -103162106, now seen corresponding path program 1 times [2019-09-08 11:21:09,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:09,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:09,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:09,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:09,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:10,185 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 11:21:10,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:10,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:10,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:10,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:10,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:10,189 INFO L87 Difference]: Start difference. First operand 776 states and 1210 transitions. Second operand 3 states. [2019-09-08 11:21:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:10,341 INFO L93 Difference]: Finished difference Result 1987 states and 3144 transitions. [2019-09-08 11:21:10,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:10,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-08 11:21:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:10,356 INFO L225 Difference]: With dead ends: 1987 [2019-09-08 11:21:10,366 INFO L226 Difference]: Without dead ends: 1281 [2019-09-08 11:21:10,370 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 11:21:10,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-09-08 11:21:10,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1279. [2019-09-08 11:21:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-09-08 11:21:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 2008 transitions. [2019-09-08 11:21:10,435 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 2008 transitions. Word has length 163 [2019-09-08 11:21:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:10,436 INFO L475 AbstractCegarLoop]: Abstraction has 1279 states and 2008 transitions. [2019-09-08 11:21:10,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 2008 transitions. [2019-09-08 11:21:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 11:21:10,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:10,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:10,443 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:10,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:10,443 INFO L82 PathProgramCache]: Analyzing trace with hash 9213278, now seen corresponding path program 1 times [2019-09-08 11:21:10,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:10,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:10,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:10,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:10,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:10,578 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 11:21:10,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:10,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:10,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:10,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:10,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:10,580 INFO L87 Difference]: Start difference. First operand 1279 states and 2008 transitions. Second operand 3 states. [2019-09-08 11:21:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:10,706 INFO L93 Difference]: Finished difference Result 3352 states and 5309 transitions. [2019-09-08 11:21:10,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:10,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-08 11:21:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:10,723 INFO L225 Difference]: With dead ends: 3352 [2019-09-08 11:21:10,724 INFO L226 Difference]: Without dead ends: 2156 [2019-09-08 11:21:10,729 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 11:21:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2019-09-08 11:21:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2154. [2019-09-08 11:21:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2019-09-08 11:21:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 3390 transitions. [2019-09-08 11:21:10,824 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 3390 transitions. Word has length 165 [2019-09-08 11:21:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:10,825 INFO L475 AbstractCegarLoop]: Abstraction has 2154 states and 3390 transitions. [2019-09-08 11:21:10,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3390 transitions. [2019-09-08 11:21:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 11:21:10,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:10,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:10,833 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:10,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1951784104, now seen corresponding path program 1 times [2019-09-08 11:21:10,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:10,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:10,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:10,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:10,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:10,988 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 11:21:10,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:10,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:10,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:10,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:10,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:10,991 INFO L87 Difference]: Start difference. First operand 2154 states and 3390 transitions. Second operand 3 states. [2019-09-08 11:21:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:11,191 INFO L93 Difference]: Finished difference Result 5697 states and 9006 transitions. [2019-09-08 11:21:11,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:11,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-08 11:21:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:11,217 INFO L225 Difference]: With dead ends: 5697 [2019-09-08 11:21:11,218 INFO L226 Difference]: Without dead ends: 3639 [2019-09-08 11:21:11,225 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 11:21:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2019-09-08 11:21:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3637. [2019-09-08 11:21:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3637 states. [2019-09-08 11:21:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3637 states to 3637 states and 5716 transitions. [2019-09-08 11:21:11,438 INFO L78 Accepts]: Start accepts. Automaton has 3637 states and 5716 transitions. Word has length 167 [2019-09-08 11:21:11,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:11,439 INFO L475 AbstractCegarLoop]: Abstraction has 3637 states and 5716 transitions. [2019-09-08 11:21:11,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 5716 transitions. [2019-09-08 11:21:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 11:21:11,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:11,454 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:11,454 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:11,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:11,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1864971758, now seen corresponding path program 1 times [2019-09-08 11:21:11,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:11,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:11,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:11,580 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 11:21:11,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:11,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:11,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:11,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:11,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:11,583 INFO L87 Difference]: Start difference. First operand 3637 states and 5716 transitions. Second operand 3 states. [2019-09-08 11:21:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:11,955 INFO L93 Difference]: Finished difference Result 9594 states and 15095 transitions. [2019-09-08 11:21:11,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:11,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-08 11:21:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:11,986 INFO L225 Difference]: With dead ends: 9594 [2019-09-08 11:21:11,986 INFO L226 Difference]: Without dead ends: 6066 [2019-09-08 11:21:11,993 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 11:21:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2019-09-08 11:21:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 6064. [2019-09-08 11:21:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6064 states. [2019-09-08 11:21:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6064 states to 6064 states and 9482 transitions. [2019-09-08 11:21:12,261 INFO L78 Accepts]: Start accepts. Automaton has 6064 states and 9482 transitions. Word has length 169 [2019-09-08 11:21:12,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:12,262 INFO L475 AbstractCegarLoop]: Abstraction has 6064 states and 9482 transitions. [2019-09-08 11:21:12,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 6064 states and 9482 transitions. [2019-09-08 11:21:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 11:21:12,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:12,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:12,282 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:12,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1410615810, now seen corresponding path program 1 times [2019-09-08 11:21:12,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:12,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:12,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:12,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:12,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:12,391 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 11:21:12,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:12,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:12,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:12,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:12,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:12,394 INFO L87 Difference]: Start difference. First operand 6064 states and 9482 transitions. Second operand 3 states. [2019-09-08 11:21:12,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:12,921 INFO L93 Difference]: Finished difference Result 15779 states and 24624 transitions. [2019-09-08 11:21:12,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:12,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-08 11:21:12,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:12,999 INFO L225 Difference]: With dead ends: 15779 [2019-09-08 11:21:13,000 INFO L226 Difference]: Without dead ends: 9837 [2019-09-08 11:21:13,014 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 11:21:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9837 states. [2019-09-08 11:21:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9837 to 9835. [2019-09-08 11:21:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9835 states. [2019-09-08 11:21:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9835 states to 9835 states and 15232 transitions. [2019-09-08 11:21:13,474 INFO L78 Accepts]: Start accepts. Automaton has 9835 states and 15232 transitions. Word has length 171 [2019-09-08 11:21:13,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:13,474 INFO L475 AbstractCegarLoop]: Abstraction has 9835 states and 15232 transitions. [2019-09-08 11:21:13,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 9835 states and 15232 transitions. [2019-09-08 11:21:13,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 11:21:13,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:13,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:13,503 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:13,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:13,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1514862974, now seen corresponding path program 1 times [2019-09-08 11:21:13,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:13,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:13,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:13,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:13,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:14,245 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 11:21:14,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:14,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:21:14,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:21:14,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:21:14,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:21:14,248 INFO L87 Difference]: Start difference. First operand 9835 states and 15232 transitions. Second operand 8 states. [2019-09-08 11:21:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:17,312 INFO L93 Difference]: Finished difference Result 59640 states and 91661 transitions. [2019-09-08 11:21:17,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:21:17,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 173 [2019-09-08 11:21:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:17,440 INFO L225 Difference]: With dead ends: 59640 [2019-09-08 11:21:17,440 INFO L226 Difference]: Without dead ends: 49921 [2019-09-08 11:21:17,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:21:17,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49921 states. [2019-09-08 11:21:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49921 to 49911. [2019-09-08 11:21:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49911 states. [2019-09-08 11:21:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49911 states to 49911 states and 75441 transitions. [2019-09-08 11:21:20,558 INFO L78 Accepts]: Start accepts. Automaton has 49911 states and 75441 transitions. Word has length 173 [2019-09-08 11:21:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:20,558 INFO L475 AbstractCegarLoop]: Abstraction has 49911 states and 75441 transitions. [2019-09-08 11:21:20,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:21:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 49911 states and 75441 transitions. [2019-09-08 11:21:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 11:21:20,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:20,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:20,681 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:20,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:20,681 INFO L82 PathProgramCache]: Analyzing trace with hash -518428648, now seen corresponding path program 1 times [2019-09-08 11:21:20,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:20,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:20,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:20,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:20,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:20,811 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 11:21:20,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:20,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:20,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:20,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:20,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:20,812 INFO L87 Difference]: Start difference. First operand 49911 states and 75441 transitions. Second operand 3 states. [2019-09-08 11:21:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:23,172 INFO L93 Difference]: Finished difference Result 90616 states and 136847 transitions. [2019-09-08 11:21:23,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:23,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 11:21:23,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:23,332 INFO L225 Difference]: With dead ends: 90616 [2019-09-08 11:21:23,333 INFO L226 Difference]: Without dead ends: 58472 [2019-09-08 11:21:23,410 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 11:21:23,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58472 states. [2019-09-08 11:21:27,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58472 to 58470. [2019-09-08 11:21:27,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58470 states. [2019-09-08 11:21:27,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58470 states to 58470 states and 88553 transitions. [2019-09-08 11:21:27,167 INFO L78 Accepts]: Start accepts. Automaton has 58470 states and 88553 transitions. Word has length 176 [2019-09-08 11:21:27,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:27,167 INFO L475 AbstractCegarLoop]: Abstraction has 58470 states and 88553 transitions. [2019-09-08 11:21:27,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 58470 states and 88553 transitions. [2019-09-08 11:21:27,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 11:21:27,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:27,245 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:27,246 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:27,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:27,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2078310394, now seen corresponding path program 1 times [2019-09-08 11:21:27,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:27,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:27,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:27,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:27,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:27,368 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 11:21:27,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:27,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:27,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:27,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:27,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:27,370 INFO L87 Difference]: Start difference. First operand 58470 states and 88553 transitions. Second operand 3 states. [2019-09-08 11:21:29,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:29,386 INFO L93 Difference]: Finished difference Result 121147 states and 183518 transitions. [2019-09-08 11:21:29,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:29,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 11:21:29,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:29,583 INFO L225 Difference]: With dead ends: 121147 [2019-09-08 11:21:29,584 INFO L226 Difference]: Without dead ends: 79355 [2019-09-08 11:21:29,669 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 11:21:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79355 states. [2019-09-08 11:21:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79355 to 79353. [2019-09-08 11:21:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79353 states. [2019-09-08 11:21:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79353 states to 79353 states and 120200 transitions. [2019-09-08 11:21:33,646 INFO L78 Accepts]: Start accepts. Automaton has 79353 states and 120200 transitions. Word has length 176 [2019-09-08 11:21:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:33,646 INFO L475 AbstractCegarLoop]: Abstraction has 79353 states and 120200 transitions. [2019-09-08 11:21:33,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 79353 states and 120200 transitions. [2019-09-08 11:21:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 11:21:33,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:33,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:33,727 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:33,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1898062312, now seen corresponding path program 1 times [2019-09-08 11:21:33,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:33,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:33,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:33,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:33,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:21:33,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:33,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:33,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:33,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:33,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:33,848 INFO L87 Difference]: Start difference. First operand 79353 states and 120200 transitions. Second operand 3 states. [2019-09-08 11:21:39,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:39,095 INFO L93 Difference]: Finished difference Result 198619 states and 299911 transitions. [2019-09-08 11:21:39,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:39,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 11:21:39,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:39,331 INFO L225 Difference]: With dead ends: 198619 [2019-09-08 11:21:39,332 INFO L226 Difference]: Without dead ends: 140709 [2019-09-08 11:21:39,431 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 11:21:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140709 states. [2019-09-08 11:21:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140709 to 140707. [2019-09-08 11:21:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140707 states. [2019-09-08 11:21:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140707 states to 140707 states and 211429 transitions. [2019-09-08 11:21:43,816 INFO L78 Accepts]: Start accepts. Automaton has 140707 states and 211429 transitions. Word has length 176 [2019-09-08 11:21:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:43,816 INFO L475 AbstractCegarLoop]: Abstraction has 140707 states and 211429 transitions. [2019-09-08 11:21:43,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 140707 states and 211429 transitions. [2019-09-08 11:21:43,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 11:21:43,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:43,957 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:43,957 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:43,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:43,957 INFO L82 PathProgramCache]: Analyzing trace with hash 205320917, now seen corresponding path program 1 times [2019-09-08 11:21:43,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:43,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:43,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:43,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:43,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:44,080 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 11:21:44,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:44,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:21:44,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:21:44,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:21:44,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:44,086 INFO L87 Difference]: Start difference. First operand 140707 states and 211429 transitions. Second operand 3 states. [2019-09-08 11:21:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:52,858 INFO L93 Difference]: Finished difference Result 345968 states and 517482 transitions. [2019-09-08 11:21:52,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:52,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-08 11:21:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:53,309 INFO L225 Difference]: With dead ends: 345968 [2019-09-08 11:21:53,309 INFO L226 Difference]: Without dead ends: 226718 [2019-09-08 11:21:53,477 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 11:21:53,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226718 states. [2019-09-08 11:22:06,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226718 to 226716. [2019-09-08 11:22:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226716 states. [2019-09-08 11:22:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226716 states to 226716 states and 336806 transitions. [2019-09-08 11:22:06,808 INFO L78 Accepts]: Start accepts. Automaton has 226716 states and 336806 transitions. Word has length 177 [2019-09-08 11:22:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:22:06,809 INFO L475 AbstractCegarLoop]: Abstraction has 226716 states and 336806 transitions. [2019-09-08 11:22:06,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:22:06,809 INFO L276 IsEmpty]: Start isEmpty. Operand 226716 states and 336806 transitions. [2019-09-08 11:22:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 11:22:07,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:22:07,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:07,074 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:22:07,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:22:07,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1304183970, now seen corresponding path program 1 times [2019-09-08 11:22:07,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:22:07,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:22:07,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:07,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:22:07,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:22:07,242 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 11:22:07,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:22:07,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:22:07,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:22:07,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:22:07,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:22:07,244 INFO L87 Difference]: Start difference. First operand 226716 states and 336806 transitions. Second operand 6 states. [2019-09-08 11:22:28,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:22:28,550 INFO L93 Difference]: Finished difference Result 748712 states and 1108837 transitions. [2019-09-08 11:22:28,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:22:28,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 177 [2019-09-08 11:22:28,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:22:29,382 INFO L225 Difference]: With dead ends: 748712 [2019-09-08 11:22:29,382 INFO L226 Difference]: Without dead ends: 522070 [2019-09-08 11:22:29,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:22:29,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522070 states. [2019-09-08 11:23:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522070 to 500882. [2019-09-08 11:23:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500882 states. [2019-09-08 11:23:04,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500882 states to 500882 states and 739424 transitions. [2019-09-08 11:23:04,414 INFO L78 Accepts]: Start accepts. Automaton has 500882 states and 739424 transitions. Word has length 177 [2019-09-08 11:23:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:04,414 INFO L475 AbstractCegarLoop]: Abstraction has 500882 states and 739424 transitions. [2019-09-08 11:23:04,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:23:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 500882 states and 739424 transitions. [2019-09-08 11:23:11,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 11:23:11,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:11,507 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:23:11,508 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:11,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:11,508 INFO L82 PathProgramCache]: Analyzing trace with hash 621077182, now seen corresponding path program 1 times [2019-09-08 11:23:11,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:11,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:11,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:11,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:11,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:11,720 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 11:23:11,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:11,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:23:11,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:23:11,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:23:11,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:23:11,722 INFO L87 Difference]: Start difference. First operand 500882 states and 739424 transitions. Second operand 8 states. [2019-09-08 11:25:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:08,867 INFO L93 Difference]: Finished difference Result 2369054 states and 3485313 transitions. [2019-09-08 11:25:08,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:25:08,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 177 [2019-09-08 11:25:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:12,274 INFO L225 Difference]: With dead ends: 2369054 [2019-09-08 11:25:12,274 INFO L226 Difference]: Without dead ends: 1868948 [2019-09-08 11:25:12,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:25:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868948 states. [2019-09-08 11:27:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868948 to 977991. [2019-09-08 11:27:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977991 states. [2019-09-08 11:27:08,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977991 states to 977991 states and 1418633 transitions. [2019-09-08 11:27:08,429 INFO L78 Accepts]: Start accepts. Automaton has 977991 states and 1418633 transitions. Word has length 177 [2019-09-08 11:27:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:08,430 INFO L475 AbstractCegarLoop]: Abstraction has 977991 states and 1418633 transitions. [2019-09-08 11:27:08,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:27:08,430 INFO L276 IsEmpty]: Start isEmpty. Operand 977991 states and 1418633 transitions. [2019-09-08 11:27:09,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 11:27:09,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:09,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:27:09,716 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:09,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:09,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1208547835, now seen corresponding path program 1 times [2019-09-08 11:27:09,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:09,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:09,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:09,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:09,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:09,816 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 11:27:09,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:09,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:27:09,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:27:09,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:27:09,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:09,818 INFO L87 Difference]: Start difference. First operand 977991 states and 1418633 transitions. Second operand 3 states. [2019-09-08 11:28:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:59,359 INFO L93 Difference]: Finished difference Result 2206662 states and 3182370 transitions. [2019-09-08 11:28:59,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:28:59,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-08 11:28:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:01,722 INFO L225 Difference]: With dead ends: 2206662 [2019-09-08 11:29:01,722 INFO L226 Difference]: Without dead ends: 1402015 [2019-09-08 11:29:02,386 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 11:29:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402015 states.