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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:09:44,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:09:44,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:09:44,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:09:44,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:09:44,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:09:44,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:09:44,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:09:44,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:09:44,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:09:44,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:09:44,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:09:44,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:09:44,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:09:44,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:09:44,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:09:44,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:09:44,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:09:44,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:09:44,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:09:44,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:09:44,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:09:44,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:09:44,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:09:44,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:09:44,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:09:44,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:09:44,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:09:44,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:09:44,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:09:44,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:09:44,286 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:09:44,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:09:44,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:09:44,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:09:44,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:09:44,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:09:44,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:09:44,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:09:44,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:09:44,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:09:44,296 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:09:44,311 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:09:44,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:09:44,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:09:44,313 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:09:44,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:09:44,314 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:09:44,314 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:09:44,315 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:09:44,315 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:09:44,315 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:09:44,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:09:44,316 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:09:44,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:09:44,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:09:44,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:09:44,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:09:44,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:09:44,318 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:09:44,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:09:44,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:09:44,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:09:44,319 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:09:44,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:09:44,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:09:44,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:09:44,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:09:44,320 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:09:44,321 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:09:44,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:09:44,321 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:09:44,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:09:44,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:09:44,397 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:09:44,399 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:09:44,399 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:09:44,400 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.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 07:09:44,464 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a83a2698/820ad32122d741fc9a53a39dfd97a601/FLAG477ae12ce [2019-09-10 07:09:45,223 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:09:45,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 07:09:45,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a83a2698/820ad32122d741fc9a53a39dfd97a601/FLAG477ae12ce [2019-09-10 07:09:45,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a83a2698/820ad32122d741fc9a53a39dfd97a601 [2019-09-10 07:09:45,318 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:09:45,320 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:09:45,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:09:45,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:09:45,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:09:45,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:09:45" (1/1) ... [2019-09-10 07:09:45,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c5f355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:45, skipping insertion in model container [2019-09-10 07:09:45,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:09:45" (1/1) ... [2019-09-10 07:09:45,336 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:09:45,539 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:09:47,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:09:47,054 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:09:47,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:09:47,791 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:09:47,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:47 WrapperNode [2019-09-10 07:09:47,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:09:47,792 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:09:47,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:09:47,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:09:47,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:47" (1/1) ... [2019-09-10 07:09:47,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:47" (1/1) ... [2019-09-10 07:09:47,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:47" (1/1) ... [2019-09-10 07:09:47,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:47" (1/1) ... [2019-09-10 07:09:47,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:47" (1/1) ... [2019-09-10 07:09:48,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:47" (1/1) ... [2019-09-10 07:09:48,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:47" (1/1) ... [2019-09-10 07:09:48,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:09:48,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:09:48,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:09:48,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:09:48,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:47" (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-10 07:09:48,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:09:48,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:09:48,186 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:09:48,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:09:48,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:09:48,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:09:48,188 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:09:48,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:09:48,188 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:09:48,188 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:09:48,189 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:09:48,191 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:09:48,191 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:09:48,193 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:09:48,193 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:09:48,194 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:09:48,194 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:09:48,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:09:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:09:48,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:09:53,816 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:09:53,817 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:09:53,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:09:53 BoogieIcfgContainer [2019-09-10 07:09:53,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:09:53,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:09:53,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:09:53,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:09:53,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:09:45" (1/3) ... [2019-09-10 07:09:53,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ee38f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:09:53, skipping insertion in model container [2019-09-10 07:09:53,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:09:47" (2/3) ... [2019-09-10 07:09:53,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ee38f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:09:53, skipping insertion in model container [2019-09-10 07:09:53,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:09:53" (3/3) ... [2019-09-10 07:09:53,837 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-10 07:09:53,850 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:09:53,865 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-09-10 07:09:53,886 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-09-10 07:09:53,922 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:09:53,922 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:09:53,922 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:09:53,922 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:09:53,923 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:09:53,923 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:09:53,923 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:09:53,923 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:09:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states. [2019-09-10 07:09:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:09:54,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:54,019 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-10 07:09:54,021 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:54,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:54,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1451255380, now seen corresponding path program 1 times [2019-09-10 07:09:54,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:54,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:54,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:54,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:54,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:54,752 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-10 07:09:54,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:54,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:54,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:54,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:54,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:54,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:54,779 INFO L87 Difference]: Start difference. First operand 1764 states. Second operand 3 states. [2019-09-10 07:09:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:54,928 INFO L93 Difference]: Finished difference Result 1999 states and 3526 transitions. [2019-09-10 07:09:54,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:54,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 07:09:54,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:54,968 INFO L225 Difference]: With dead ends: 1999 [2019-09-10 07:09:54,968 INFO L226 Difference]: Without dead ends: 1991 [2019-09-10 07:09:54,971 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-10 07:09:55,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-09-10 07:09:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1981. [2019-09-10 07:09:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2019-09-10 07:09:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 2665 transitions. [2019-09-10 07:09:55,095 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 2665 transitions. Word has length 80 [2019-09-10 07:09:55,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:55,096 INFO L475 AbstractCegarLoop]: Abstraction has 1981 states and 2665 transitions. [2019-09-10 07:09:55,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2665 transitions. [2019-09-10 07:09:55,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:09:55,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:55,104 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-10 07:09:55,104 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:55,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:55,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1767927859, now seen corresponding path program 1 times [2019-09-10 07:09:55,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:55,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:55,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:55,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:55,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:55,385 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-10 07:09:55,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:55,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:09:55,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:55,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:09:55,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:09:55,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:09:55,389 INFO L87 Difference]: Start difference. First operand 1981 states and 2665 transitions. Second operand 6 states. [2019-09-10 07:09:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:57,089 INFO L93 Difference]: Finished difference Result 2280 states and 3202 transitions. [2019-09-10 07:09:57,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:09:57,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-09-10 07:09:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:57,106 INFO L225 Difference]: With dead ends: 2280 [2019-09-10 07:09:57,106 INFO L226 Difference]: Without dead ends: 2280 [2019-09-10 07:09:57,107 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-10 07:09:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2019-09-10 07:09:57,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 2260. [2019-09-10 07:09:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2019-09-10 07:09:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3192 transitions. [2019-09-10 07:09:57,195 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3192 transitions. Word has length 80 [2019-09-10 07:09:57,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:57,198 INFO L475 AbstractCegarLoop]: Abstraction has 2260 states and 3192 transitions. [2019-09-10 07:09:57,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:09:57,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3192 transitions. [2019-09-10 07:09:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:09:57,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:57,206 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-10 07:09:57,207 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:57,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:57,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1294715305, now seen corresponding path program 1 times [2019-09-10 07:09:57,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:57,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:57,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:57,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:57,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:57,364 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-10 07:09:57,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:57,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:57,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:57,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:57,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:57,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:57,367 INFO L87 Difference]: Start difference. First operand 2260 states and 3192 transitions. Second operand 3 states. [2019-09-10 07:09:57,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:57,452 INFO L93 Difference]: Finished difference Result 3248 states and 4568 transitions. [2019-09-10 07:09:57,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:57,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:09:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:57,481 INFO L225 Difference]: With dead ends: 3248 [2019-09-10 07:09:57,481 INFO L226 Difference]: Without dead ends: 3248 [2019-09-10 07:09:57,482 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-10 07:09:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2019-09-10 07:09:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 3234. [2019-09-10 07:09:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3234 states. [2019-09-10 07:09:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 4559 transitions. [2019-09-10 07:09:57,560 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 4559 transitions. Word has length 81 [2019-09-10 07:09:57,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:57,560 INFO L475 AbstractCegarLoop]: Abstraction has 3234 states and 4559 transitions. [2019-09-10 07:09:57,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:57,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 4559 transitions. [2019-09-10 07:09:57,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:09:57,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:57,571 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-10 07:09:57,572 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:57,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:57,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2068721794, now seen corresponding path program 1 times [2019-09-10 07:09:57,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:57,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:57,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:57,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:57,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:57,772 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-10 07:09:57,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:57,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:09:57,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:57,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:09:57,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:09:57,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:09:57,774 INFO L87 Difference]: Start difference. First operand 3234 states and 4559 transitions. Second operand 5 states. [2019-09-10 07:09:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:59,000 INFO L93 Difference]: Finished difference Result 4111 states and 5951 transitions. [2019-09-10 07:09:59,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:09:59,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 07:09:59,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:59,021 INFO L225 Difference]: With dead ends: 4111 [2019-09-10 07:09:59,021 INFO L226 Difference]: Without dead ends: 4111 [2019-09-10 07:09:59,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:09:59,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4111 states. [2019-09-10 07:09:59,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4111 to 4101. [2019-09-10 07:09:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2019-09-10 07:09:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5946 transitions. [2019-09-10 07:09:59,121 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5946 transitions. Word has length 81 [2019-09-10 07:09:59,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:59,122 INFO L475 AbstractCegarLoop]: Abstraction has 4101 states and 5946 transitions. [2019-09-10 07:09:59,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:09:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5946 transitions. [2019-09-10 07:09:59,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:09:59,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:59,128 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] [2019-09-10 07:09:59,128 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:59,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:59,129 INFO L82 PathProgramCache]: Analyzing trace with hash 383916093, now seen corresponding path program 1 times [2019-09-10 07:09:59,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:59,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:59,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:59,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:59,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:59,309 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-10 07:09:59,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:59,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:59,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:59,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:59,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:59,312 INFO L87 Difference]: Start difference. First operand 4101 states and 5946 transitions. Second operand 3 states. [2019-09-10 07:09:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:59,401 INFO L93 Difference]: Finished difference Result 5795 states and 8317 transitions. [2019-09-10 07:09:59,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:59,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:09:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:59,429 INFO L225 Difference]: With dead ends: 5795 [2019-09-10 07:09:59,430 INFO L226 Difference]: Without dead ends: 5795 [2019-09-10 07:09:59,430 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-10 07:09:59,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5795 states. [2019-09-10 07:09:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5795 to 5775. [2019-09-10 07:09:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5775 states. [2019-09-10 07:09:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5775 states to 5775 states and 8302 transitions. [2019-09-10 07:09:59,571 INFO L78 Accepts]: Start accepts. Automaton has 5775 states and 8302 transitions. Word has length 82 [2019-09-10 07:09:59,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:59,573 INFO L475 AbstractCegarLoop]: Abstraction has 5775 states and 8302 transitions. [2019-09-10 07:09:59,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:09:59,573 INFO L276 IsEmpty]: Start isEmpty. Operand 5775 states and 8302 transitions. [2019-09-10 07:09:59,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:09:59,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:59,581 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] [2019-09-10 07:09:59,581 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:59,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:59,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1654858470, now seen corresponding path program 1 times [2019-09-10 07:09:59,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:59,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:59,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:59,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:59,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:59,795 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-10 07:09:59,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:59,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:09:59,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:59,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:09:59,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:09:59,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:09:59,797 INFO L87 Difference]: Start difference. First operand 5775 states and 8302 transitions. Second operand 5 states. [2019-09-10 07:10:00,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:00,766 INFO L93 Difference]: Finished difference Result 8628 states and 12512 transitions. [2019-09-10 07:10:00,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:10:00,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 07:10:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:00,804 INFO L225 Difference]: With dead ends: 8628 [2019-09-10 07:10:00,804 INFO L226 Difference]: Without dead ends: 8628 [2019-09-10 07:10:00,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8628 states. [2019-09-10 07:10:00,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8628 to 8618. [2019-09-10 07:10:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8618 states. [2019-09-10 07:10:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8618 states to 8618 states and 12507 transitions. [2019-09-10 07:10:00,958 INFO L78 Accepts]: Start accepts. Automaton has 8618 states and 12507 transitions. Word has length 82 [2019-09-10 07:10:00,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:00,958 INFO L475 AbstractCegarLoop]: Abstraction has 8618 states and 12507 transitions. [2019-09-10 07:10:00,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:10:00,958 INFO L276 IsEmpty]: Start isEmpty. Operand 8618 states and 12507 transitions. [2019-09-10 07:10:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:10:00,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:00,966 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] [2019-09-10 07:10:00,966 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:00,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:00,967 INFO L82 PathProgramCache]: Analyzing trace with hash 882516511, now seen corresponding path program 1 times [2019-09-10 07:10:00,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:00,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:00,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:00,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:00,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:01,076 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-10 07:10:01,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:01,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:10:01,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:01,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:10:01,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:10:01,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:10:01,078 INFO L87 Difference]: Start difference. First operand 8618 states and 12507 transitions. Second operand 3 states. [2019-09-10 07:10:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:01,200 INFO L93 Difference]: Finished difference Result 11753 states and 16902 transitions. [2019-09-10 07:10:01,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:10:01,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:10:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:01,225 INFO L225 Difference]: With dead ends: 11753 [2019-09-10 07:10:01,225 INFO L226 Difference]: Without dead ends: 11753 [2019-09-10 07:10:01,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-10 07:10:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11753 states. [2019-09-10 07:10:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11753 to 11713. [2019-09-10 07:10:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11713 states. [2019-09-10 07:10:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11713 states to 11713 states and 16867 transitions. [2019-09-10 07:10:01,459 INFO L78 Accepts]: Start accepts. Automaton has 11713 states and 16867 transitions. Word has length 82 [2019-09-10 07:10:01,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:01,460 INFO L475 AbstractCegarLoop]: Abstraction has 11713 states and 16867 transitions. [2019-09-10 07:10:01,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:10:01,460 INFO L276 IsEmpty]: Start isEmpty. Operand 11713 states and 16867 transitions. [2019-09-10 07:10:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:10:01,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:01,474 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] [2019-09-10 07:10:01,475 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:01,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:01,475 INFO L82 PathProgramCache]: Analyzing trace with hash 789996956, now seen corresponding path program 1 times [2019-09-10 07:10:01,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:01,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:01,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:01,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:01,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:01,589 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-10 07:10:01,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:01,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:10:01,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:01,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:10:01,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:10:01,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:10:01,592 INFO L87 Difference]: Start difference. First operand 11713 states and 16867 transitions. Second operand 3 states. [2019-09-10 07:10:01,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:01,834 INFO L93 Difference]: Finished difference Result 20494 states and 28934 transitions. [2019-09-10 07:10:01,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:10:01,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:10:01,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:01,872 INFO L225 Difference]: With dead ends: 20494 [2019-09-10 07:10:01,872 INFO L226 Difference]: Without dead ends: 20494 [2019-09-10 07:10:01,873 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-10 07:10:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20494 states. [2019-09-10 07:10:02,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20494 to 20484. [2019-09-10 07:10:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20484 states. [2019-09-10 07:10:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20484 states to 20484 states and 28929 transitions. [2019-09-10 07:10:02,238 INFO L78 Accepts]: Start accepts. Automaton has 20484 states and 28929 transitions. Word has length 82 [2019-09-10 07:10:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:02,239 INFO L475 AbstractCegarLoop]: Abstraction has 20484 states and 28929 transitions. [2019-09-10 07:10:02,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:10:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 20484 states and 28929 transitions. [2019-09-10 07:10:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:10:02,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:02,258 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] [2019-09-10 07:10:02,258 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:02,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:02,259 INFO L82 PathProgramCache]: Analyzing trace with hash 929120536, now seen corresponding path program 1 times [2019-09-10 07:10:02,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:02,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:02,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:02,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:02,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:02,454 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-10 07:10:02,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:02,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:10:02,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:02,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:10:02,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:10:02,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:02,456 INFO L87 Difference]: Start difference. First operand 20484 states and 28929 transitions. Second operand 7 states. [2019-09-10 07:10:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:04,565 INFO L93 Difference]: Finished difference Result 72751 states and 104239 transitions. [2019-09-10 07:10:04,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:10:04,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-09-10 07:10:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:04,703 INFO L225 Difference]: With dead ends: 72751 [2019-09-10 07:10:04,704 INFO L226 Difference]: Without dead ends: 72751 [2019-09-10 07:10:04,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:10:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72751 states. [2019-09-10 07:10:06,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72751 to 20532. [2019-09-10 07:10:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20532 states. [2019-09-10 07:10:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20532 states to 20532 states and 28993 transitions. [2019-09-10 07:10:06,407 INFO L78 Accepts]: Start accepts. Automaton has 20532 states and 28993 transitions. Word has length 83 [2019-09-10 07:10:06,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:06,408 INFO L475 AbstractCegarLoop]: Abstraction has 20532 states and 28993 transitions. [2019-09-10 07:10:06,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:10:06,408 INFO L276 IsEmpty]: Start isEmpty. Operand 20532 states and 28993 transitions. [2019-09-10 07:10:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:10:06,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:06,423 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] [2019-09-10 07:10:06,423 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:06,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:06,424 INFO L82 PathProgramCache]: Analyzing trace with hash 46675551, now seen corresponding path program 1 times [2019-09-10 07:10:06,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:06,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:06,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:06,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:06,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:06,595 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-10 07:10:06,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:06,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:10:06,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:06,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:10:06,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:10:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:06,597 INFO L87 Difference]: Start difference. First operand 20532 states and 28993 transitions. Second operand 7 states. [2019-09-10 07:10:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:08,753 INFO L93 Difference]: Finished difference Result 78104 states and 111650 transitions. [2019-09-10 07:10:08,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:10:08,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-09-10 07:10:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:08,823 INFO L225 Difference]: With dead ends: 78104 [2019-09-10 07:10:08,823 INFO L226 Difference]: Without dead ends: 78104 [2019-09-10 07:10:08,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:10:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78104 states. [2019-09-10 07:10:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78104 to 20712. [2019-09-10 07:10:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20712 states. [2019-09-10 07:10:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20712 states to 20712 states and 29233 transitions. [2019-09-10 07:10:09,434 INFO L78 Accepts]: Start accepts. Automaton has 20712 states and 29233 transitions. Word has length 83 [2019-09-10 07:10:09,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:09,434 INFO L475 AbstractCegarLoop]: Abstraction has 20712 states and 29233 transitions. [2019-09-10 07:10:09,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:10:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 20712 states and 29233 transitions. [2019-09-10 07:10:09,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:10:09,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:09,450 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] [2019-09-10 07:10:09,450 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:09,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:09,451 INFO L82 PathProgramCache]: Analyzing trace with hash 9887026, now seen corresponding path program 1 times [2019-09-10 07:10:09,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:09,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:09,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:09,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:09,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:09,604 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-10 07:10:09,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:09,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:10:09,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:09,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:10:09,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:10:09,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:09,606 INFO L87 Difference]: Start difference. First operand 20712 states and 29233 transitions. Second operand 7 states. [2019-09-10 07:10:12,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:12,010 INFO L93 Difference]: Finished difference Result 77078 states and 110009 transitions. [2019-09-10 07:10:12,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:10:12,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-09-10 07:10:12,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:12,083 INFO L225 Difference]: With dead ends: 77078 [2019-09-10 07:10:12,083 INFO L226 Difference]: Without dead ends: 77078 [2019-09-10 07:10:12,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:10:12,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77078 states. [2019-09-10 07:10:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77078 to 21080. [2019-09-10 07:10:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21080 states. [2019-09-10 07:10:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21080 states to 21080 states and 29725 transitions. [2019-09-10 07:10:12,833 INFO L78 Accepts]: Start accepts. Automaton has 21080 states and 29725 transitions. Word has length 83 [2019-09-10 07:10:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:12,833 INFO L475 AbstractCegarLoop]: Abstraction has 21080 states and 29725 transitions. [2019-09-10 07:10:12,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:10:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 21080 states and 29725 transitions. [2019-09-10 07:10:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:10:12,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:12,850 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] [2019-09-10 07:10:12,850 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:12,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:12,851 INFO L82 PathProgramCache]: Analyzing trace with hash -325737957, now seen corresponding path program 1 times [2019-09-10 07:10:12,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:12,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:12,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:12,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:12,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:12,973 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-10 07:10:12,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:12,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:10:12,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:12,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:10:12,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:10:12,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:10:12,975 INFO L87 Difference]: Start difference. First operand 21080 states and 29725 transitions. Second operand 4 states. [2019-09-10 07:10:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:13,122 INFO L93 Difference]: Finished difference Result 33374 states and 47581 transitions. [2019-09-10 07:10:13,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:10:13,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-10 07:10:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:13,153 INFO L225 Difference]: With dead ends: 33374 [2019-09-10 07:10:13,153 INFO L226 Difference]: Without dead ends: 33374 [2019-09-10 07:10:13,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:10:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33374 states. [2019-09-10 07:10:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33374 to 21078. [2019-09-10 07:10:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21078 states. [2019-09-10 07:10:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21078 states to 21078 states and 29676 transitions. [2019-09-10 07:10:13,404 INFO L78 Accepts]: Start accepts. Automaton has 21078 states and 29676 transitions. Word has length 84 [2019-09-10 07:10:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:13,404 INFO L475 AbstractCegarLoop]: Abstraction has 21078 states and 29676 transitions. [2019-09-10 07:10:13,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:10:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 21078 states and 29676 transitions. [2019-09-10 07:10:13,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:10:13,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:13,421 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] [2019-09-10 07:10:13,421 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:13,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:13,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1023360400, now seen corresponding path program 1 times [2019-09-10 07:10:13,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:13,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:13,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:13,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:13,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:13,564 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-10 07:10:13,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:13,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:10:13,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:13,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:10:13,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:10:13,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:10:13,566 INFO L87 Difference]: Start difference. First operand 21078 states and 29676 transitions. Second operand 4 states. [2019-09-10 07:10:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:13,731 INFO L93 Difference]: Finished difference Result 33372 states and 47532 transitions. [2019-09-10 07:10:13,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:10:13,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-10 07:10:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:13,774 INFO L225 Difference]: With dead ends: 33372 [2019-09-10 07:10:13,774 INFO L226 Difference]: Without dead ends: 33372 [2019-09-10 07:10:13,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:10:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33372 states. [2019-09-10 07:10:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33372 to 21076. [2019-09-10 07:10:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21076 states. [2019-09-10 07:10:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21076 states to 21076 states and 29627 transitions. [2019-09-10 07:10:14,904 INFO L78 Accepts]: Start accepts. Automaton has 21076 states and 29627 transitions. Word has length 84 [2019-09-10 07:10:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:14,905 INFO L475 AbstractCegarLoop]: Abstraction has 21076 states and 29627 transitions. [2019-09-10 07:10:14,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:10:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 21076 states and 29627 transitions. [2019-09-10 07:10:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:10:14,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:14,918 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] [2019-09-10 07:10:14,918 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:14,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:14,918 INFO L82 PathProgramCache]: Analyzing trace with hash 213831720, now seen corresponding path program 1 times [2019-09-10 07:10:14,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:14,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:14,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:14,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:14,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:15,038 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-10 07:10:15,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:15,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:10:15,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:15,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:10:15,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:10:15,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:10:15,040 INFO L87 Difference]: Start difference. First operand 21076 states and 29627 transitions. Second operand 5 states. [2019-09-10 07:10:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:16,089 INFO L93 Difference]: Finished difference Result 27990 states and 38974 transitions. [2019-09-10 07:10:16,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:10:16,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-10 07:10:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:16,113 INFO L225 Difference]: With dead ends: 27990 [2019-09-10 07:10:16,114 INFO L226 Difference]: Without dead ends: 27990 [2019-09-10 07:10:16,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27990 states. [2019-09-10 07:10:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27990 to 27894. [2019-09-10 07:10:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27894 states. [2019-09-10 07:10:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27894 states to 27894 states and 38881 transitions. [2019-09-10 07:10:16,334 INFO L78 Accepts]: Start accepts. Automaton has 27894 states and 38881 transitions. Word has length 84 [2019-09-10 07:10:16,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:16,334 INFO L475 AbstractCegarLoop]: Abstraction has 27894 states and 38881 transitions. [2019-09-10 07:10:16,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:10:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 27894 states and 38881 transitions. [2019-09-10 07:10:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:10:16,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:16,345 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] [2019-09-10 07:10:16,345 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:16,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:16,345 INFO L82 PathProgramCache]: Analyzing trace with hash 130103504, now seen corresponding path program 1 times [2019-09-10 07:10:16,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:16,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:16,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:16,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:16,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:16,449 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-10 07:10:16,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:16,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:10:16,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:16,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:10:16,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:10:16,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:10:16,451 INFO L87 Difference]: Start difference. First operand 27894 states and 38881 transitions. Second operand 5 states. [2019-09-10 07:10:17,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:17,345 INFO L93 Difference]: Finished difference Result 38454 states and 53474 transitions. [2019-09-10 07:10:17,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:10:17,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-10 07:10:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:17,378 INFO L225 Difference]: With dead ends: 38454 [2019-09-10 07:10:17,378 INFO L226 Difference]: Without dead ends: 38454 [2019-09-10 07:10:17,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:17,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38454 states. [2019-09-10 07:10:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38454 to 27894. [2019-09-10 07:10:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27894 states. [2019-09-10 07:10:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27894 states to 27894 states and 38745 transitions. [2019-09-10 07:10:17,825 INFO L78 Accepts]: Start accepts. Automaton has 27894 states and 38745 transitions. Word has length 84 [2019-09-10 07:10:17,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:17,825 INFO L475 AbstractCegarLoop]: Abstraction has 27894 states and 38745 transitions. [2019-09-10 07:10:17,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:10:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 27894 states and 38745 transitions. [2019-09-10 07:10:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:10:17,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:17,832 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] [2019-09-10 07:10:17,832 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:17,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:17,833 INFO L82 PathProgramCache]: Analyzing trace with hash 512159968, now seen corresponding path program 1 times [2019-09-10 07:10:17,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:17,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:17,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:17,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:17,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:17,982 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-10 07:10:17,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:17,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:10:17,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:17,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:10:17,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:10:17,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:17,986 INFO L87 Difference]: Start difference. First operand 27894 states and 38745 transitions. Second operand 7 states. [2019-09-10 07:10:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:20,014 INFO L93 Difference]: Finished difference Result 98196 states and 137091 transitions. [2019-09-10 07:10:20,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:10:20,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-09-10 07:10:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:20,110 INFO L225 Difference]: With dead ends: 98196 [2019-09-10 07:10:20,110 INFO L226 Difference]: Without dead ends: 98196 [2019-09-10 07:10:20,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:10:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98196 states. [2019-09-10 07:10:20,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98196 to 28523. [2019-09-10 07:10:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28523 states. [2019-09-10 07:10:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28523 states to 28523 states and 39593 transitions. [2019-09-10 07:10:20,976 INFO L78 Accepts]: Start accepts. Automaton has 28523 states and 39593 transitions. Word has length 85 [2019-09-10 07:10:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:20,976 INFO L475 AbstractCegarLoop]: Abstraction has 28523 states and 39593 transitions. [2019-09-10 07:10:20,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:10:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 28523 states and 39593 transitions. [2019-09-10 07:10:20,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:10:20,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:20,984 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] [2019-09-10 07:10:20,984 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:20,984 INFO L82 PathProgramCache]: Analyzing trace with hash 700402578, now seen corresponding path program 1 times [2019-09-10 07:10:20,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:20,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:20,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:20,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:20,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:21,134 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-10 07:10:21,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:21,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:10:21,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:21,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:10:21,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:10:21,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:21,136 INFO L87 Difference]: Start difference. First operand 28523 states and 39593 transitions. Second operand 7 states. [2019-09-10 07:10:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:22,963 INFO L93 Difference]: Finished difference Result 89585 states and 124932 transitions. [2019-09-10 07:10:22,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:10:22,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-09-10 07:10:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:23,050 INFO L225 Difference]: With dead ends: 89585 [2019-09-10 07:10:23,051 INFO L226 Difference]: Without dead ends: 89585 [2019-09-10 07:10:23,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:10:23,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89585 states. [2019-09-10 07:10:23,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89585 to 28607. [2019-09-10 07:10:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28607 states. [2019-09-10 07:10:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28607 states to 28607 states and 39701 transitions. [2019-09-10 07:10:23,842 INFO L78 Accepts]: Start accepts. Automaton has 28607 states and 39701 transitions. Word has length 85 [2019-09-10 07:10:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:23,843 INFO L475 AbstractCegarLoop]: Abstraction has 28607 states and 39701 transitions. [2019-09-10 07:10:23,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:10:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 28607 states and 39701 transitions. [2019-09-10 07:10:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:10:23,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:23,851 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] [2019-09-10 07:10:23,851 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:23,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:23,851 INFO L82 PathProgramCache]: Analyzing trace with hash 789182652, now seen corresponding path program 1 times [2019-09-10 07:10:23,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:23,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:23,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:23,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:23,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:23,964 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-10 07:10:23,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:23,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:10:23,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:23,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:10:23,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:10:23,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:10:23,966 INFO L87 Difference]: Start difference. First operand 28607 states and 39701 transitions. Second operand 4 states. [2019-09-10 07:10:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:24,169 INFO L93 Difference]: Finished difference Result 46913 states and 65900 transitions. [2019-09-10 07:10:24,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:10:24,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-10 07:10:24,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:24,224 INFO L225 Difference]: With dead ends: 46913 [2019-09-10 07:10:24,224 INFO L226 Difference]: Without dead ends: 46913 [2019-09-10 07:10:24,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:10:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46913 states. [2019-09-10 07:10:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46913 to 28605. [2019-09-10 07:10:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28605 states. [2019-09-10 07:10:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28605 states to 28605 states and 39628 transitions. [2019-09-10 07:10:24,774 INFO L78 Accepts]: Start accepts. Automaton has 28605 states and 39628 transitions. Word has length 86 [2019-09-10 07:10:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:24,775 INFO L475 AbstractCegarLoop]: Abstraction has 28605 states and 39628 transitions. [2019-09-10 07:10:24,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:10:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 28605 states and 39628 transitions. [2019-09-10 07:10:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:10:24,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:24,785 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] [2019-09-10 07:10:24,785 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:24,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:24,785 INFO L82 PathProgramCache]: Analyzing trace with hash -423507048, now seen corresponding path program 1 times [2019-09-10 07:10:24,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:24,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:24,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:24,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:24,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:24,921 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-10 07:10:24,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:24,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:10:24,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:24,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:10:24,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:10:24,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:10:24,924 INFO L87 Difference]: Start difference. First operand 28605 states and 39628 transitions. Second operand 4 states. [2019-09-10 07:10:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:25,205 INFO L93 Difference]: Finished difference Result 46911 states and 65845 transitions. [2019-09-10 07:10:25,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:10:25,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-10 07:10:25,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:25,266 INFO L225 Difference]: With dead ends: 46911 [2019-09-10 07:10:25,266 INFO L226 Difference]: Without dead ends: 46911 [2019-09-10 07:10:25,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:10:25,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46911 states. [2019-09-10 07:10:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46911 to 28603. [2019-09-10 07:10:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28603 states. [2019-09-10 07:10:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28603 states to 28603 states and 39573 transitions. [2019-09-10 07:10:25,825 INFO L78 Accepts]: Start accepts. Automaton has 28603 states and 39573 transitions. Word has length 86 [2019-09-10 07:10:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:25,826 INFO L475 AbstractCegarLoop]: Abstraction has 28603 states and 39573 transitions. [2019-09-10 07:10:25,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:10:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 28603 states and 39573 transitions. [2019-09-10 07:10:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:10:25,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:25,839 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] [2019-09-10 07:10:25,839 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:25,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:25,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2070513849, now seen corresponding path program 1 times [2019-09-10 07:10:25,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:25,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:25,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:25,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:25,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:26,157 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-09-10 07:10:26,162 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-10 07:10:26,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:26,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:10:26,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:26,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:10:26,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:10:26,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:10:26,164 INFO L87 Difference]: Start difference. First operand 28603 states and 39573 transitions. Second operand 4 states. [2019-09-10 07:10:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:26,333 INFO L93 Difference]: Finished difference Result 46909 states and 65736 transitions. [2019-09-10 07:10:26,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:10:26,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-10 07:10:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:26,378 INFO L225 Difference]: With dead ends: 46909 [2019-09-10 07:10:26,378 INFO L226 Difference]: Without dead ends: 46909 [2019-09-10 07:10:26,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:10:26,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46909 states. [2019-09-10 07:10:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46909 to 28601. [2019-09-10 07:10:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28601 states. [2019-09-10 07:10:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28601 states to 28601 states and 39464 transitions. [2019-09-10 07:10:26,735 INFO L78 Accepts]: Start accepts. Automaton has 28601 states and 39464 transitions. Word has length 88 [2019-09-10 07:10:26,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:26,735 INFO L475 AbstractCegarLoop]: Abstraction has 28601 states and 39464 transitions. [2019-09-10 07:10:26,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:10:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 28601 states and 39464 transitions. [2019-09-10 07:10:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:10:26,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:26,749 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] [2019-09-10 07:10:26,750 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:26,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:26,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1498257638, now seen corresponding path program 1 times [2019-09-10 07:10:26,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:26,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:26,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:26,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:26,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:26,977 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-10 07:10:26,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:26,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:10:26,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:26,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:10:26,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:10:26,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:10:26,979 INFO L87 Difference]: Start difference. First operand 28601 states and 39464 transitions. Second operand 9 states. [2019-09-10 07:10:30,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:30,072 INFO L93 Difference]: Finished difference Result 98962 states and 139075 transitions. [2019-09-10 07:10:30,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:10:30,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:10:30,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:30,174 INFO L225 Difference]: With dead ends: 98962 [2019-09-10 07:10:30,174 INFO L226 Difference]: Without dead ends: 98962 [2019-09-10 07:10:30,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:10:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98962 states. [2019-09-10 07:10:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98962 to 28593. [2019-09-10 07:10:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28593 states. [2019-09-10 07:10:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28593 states to 28593 states and 39440 transitions. [2019-09-10 07:10:31,220 INFO L78 Accepts]: Start accepts. Automaton has 28593 states and 39440 transitions. Word has length 89 [2019-09-10 07:10:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:31,221 INFO L475 AbstractCegarLoop]: Abstraction has 28593 states and 39440 transitions. [2019-09-10 07:10:31,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:10:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 28593 states and 39440 transitions. [2019-09-10 07:10:31,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:10:31,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:31,232 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] [2019-09-10 07:10:31,233 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:31,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:31,233 INFO L82 PathProgramCache]: Analyzing trace with hash -936806343, now seen corresponding path program 1 times [2019-09-10 07:10:31,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:31,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:31,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:31,369 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-10 07:10:31,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:31,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:10:31,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:31,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:10:31,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:10:31,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:31,370 INFO L87 Difference]: Start difference. First operand 28593 states and 39440 transitions. Second operand 7 states. [2019-09-10 07:10:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:33,511 INFO L93 Difference]: Finished difference Result 97949 states and 136631 transitions. [2019-09-10 07:10:33,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:10:33,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-10 07:10:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:33,602 INFO L225 Difference]: With dead ends: 97949 [2019-09-10 07:10:33,602 INFO L226 Difference]: Without dead ends: 97949 [2019-09-10 07:10:33,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:10:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97949 states. [2019-09-10 07:10:34,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97949 to 28713. [2019-09-10 07:10:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28713 states. [2019-09-10 07:10:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28713 states to 28713 states and 39600 transitions. [2019-09-10 07:10:34,212 INFO L78 Accepts]: Start accepts. Automaton has 28713 states and 39600 transitions. Word has length 89 [2019-09-10 07:10:34,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:34,212 INFO L475 AbstractCegarLoop]: Abstraction has 28713 states and 39600 transitions. [2019-09-10 07:10:34,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:10:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 28713 states and 39600 transitions. [2019-09-10 07:10:34,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:10:34,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:34,221 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] [2019-09-10 07:10:34,221 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:34,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:34,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1511138056, now seen corresponding path program 1 times [2019-09-10 07:10:34,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:34,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:34,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:34,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:34,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:34,493 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-10 07:10:34,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:34,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:10:34,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:34,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:10:34,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:10:34,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:10:34,495 INFO L87 Difference]: Start difference. First operand 28713 states and 39600 transitions. Second operand 10 states. [2019-09-10 07:10:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:39,847 INFO L93 Difference]: Finished difference Result 116846 states and 163100 transitions. [2019-09-10 07:10:39,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:10:39,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-10 07:10:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:39,963 INFO L225 Difference]: With dead ends: 116846 [2019-09-10 07:10:39,963 INFO L226 Difference]: Without dead ends: 116846 [2019-09-10 07:10:39,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:10:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116846 states. [2019-09-10 07:10:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116846 to 28717. [2019-09-10 07:10:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28717 states. [2019-09-10 07:10:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28717 states to 28717 states and 39603 transitions. [2019-09-10 07:10:40,709 INFO L78 Accepts]: Start accepts. Automaton has 28717 states and 39603 transitions. Word has length 89 [2019-09-10 07:10:40,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:40,710 INFO L475 AbstractCegarLoop]: Abstraction has 28717 states and 39603 transitions. [2019-09-10 07:10:40,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:10:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 28717 states and 39603 transitions. [2019-09-10 07:10:40,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:10:40,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:40,719 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] [2019-09-10 07:10:40,719 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:40,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:40,720 INFO L82 PathProgramCache]: Analyzing trace with hash -245468892, now seen corresponding path program 1 times [2019-09-10 07:10:40,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:40,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:40,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:40,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:40,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:40,917 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-10 07:10:40,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:40,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:10:40,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:40,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:10:40,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:10:40,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:10:40,919 INFO L87 Difference]: Start difference. First operand 28717 states and 39603 transitions. Second operand 9 states. [2019-09-10 07:10:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:44,166 INFO L93 Difference]: Finished difference Result 99793 states and 140253 transitions. [2019-09-10 07:10:44,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:10:44,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 07:10:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:44,258 INFO L225 Difference]: With dead ends: 99793 [2019-09-10 07:10:44,258 INFO L226 Difference]: Without dead ends: 99793 [2019-09-10 07:10:44,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:10:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99793 states. [2019-09-10 07:10:44,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99793 to 28683. [2019-09-10 07:10:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28683 states. [2019-09-10 07:10:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28683 states to 28683 states and 39551 transitions. [2019-09-10 07:10:44,902 INFO L78 Accepts]: Start accepts. Automaton has 28683 states and 39551 transitions. Word has length 89 [2019-09-10 07:10:44,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:44,902 INFO L475 AbstractCegarLoop]: Abstraction has 28683 states and 39551 transitions. [2019-09-10 07:10:44,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:10:44,903 INFO L276 IsEmpty]: Start isEmpty. Operand 28683 states and 39551 transitions. [2019-09-10 07:10:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:10:44,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:44,911 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] [2019-09-10 07:10:44,912 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:44,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:44,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1145017006, now seen corresponding path program 1 times [2019-09-10 07:10:44,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:44,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:44,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:44,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:44,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:45,043 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-10 07:10:45,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:45,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:10:45,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:45,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:10:45,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:10:45,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:10:45,045 INFO L87 Difference]: Start difference. First operand 28683 states and 39551 transitions. Second operand 7 states. [2019-09-10 07:10:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:47,015 INFO L93 Difference]: Finished difference Result 110449 states and 154785 transitions. [2019-09-10 07:10:47,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:10:47,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-10 07:10:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:47,119 INFO L225 Difference]: With dead ends: 110449 [2019-09-10 07:10:47,119 INFO L226 Difference]: Without dead ends: 110449 [2019-09-10 07:10:47,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:10:47,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110449 states. [2019-09-10 07:10:47,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110449 to 28743. [2019-09-10 07:10:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28743 states. [2019-09-10 07:10:47,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28743 states to 28743 states and 39631 transitions. [2019-09-10 07:10:47,998 INFO L78 Accepts]: Start accepts. Automaton has 28743 states and 39631 transitions. Word has length 89 [2019-09-10 07:10:47,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:47,999 INFO L475 AbstractCegarLoop]: Abstraction has 28743 states and 39631 transitions. [2019-09-10 07:10:47,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:10:47,999 INFO L276 IsEmpty]: Start isEmpty. Operand 28743 states and 39631 transitions. [2019-09-10 07:10:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:10:48,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:48,009 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] [2019-09-10 07:10:48,009 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:48,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1282236021, now seen corresponding path program 1 times [2019-09-10 07:10:48,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:48,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:48,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:48,488 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-10 07:10:48,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:48,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:10:48,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:48,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:10:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:10:48,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:10:48,490 INFO L87 Difference]: Start difference. First operand 28743 states and 39631 transitions. Second operand 12 states. [2019-09-10 07:10:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:51,398 INFO L93 Difference]: Finished difference Result 133299 states and 188482 transitions. [2019-09-10 07:10:51,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 07:10:51,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-10 07:10:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:51,533 INFO L225 Difference]: With dead ends: 133299 [2019-09-10 07:10:51,533 INFO L226 Difference]: Without dead ends: 133299 [2019-09-10 07:10:51,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:10:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133299 states. [2019-09-10 07:10:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133299 to 27795. [2019-09-10 07:10:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27795 states. [2019-09-10 07:10:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27795 states to 27795 states and 38379 transitions. [2019-09-10 07:10:52,268 INFO L78 Accepts]: Start accepts. Automaton has 27795 states and 38379 transitions. Word has length 90 [2019-09-10 07:10:52,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:52,268 INFO L475 AbstractCegarLoop]: Abstraction has 27795 states and 38379 transitions. [2019-09-10 07:10:52,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:10:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 27795 states and 38379 transitions. [2019-09-10 07:10:52,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:10:52,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:52,277 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] [2019-09-10 07:10:52,277 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:52,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:52,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1179261300, now seen corresponding path program 1 times [2019-09-10 07:10:52,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:52,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:52,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:52,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:52,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:52,564 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-10 07:10:52,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:52,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:10:52,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:52,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:10:52,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:10:52,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:10:52,566 INFO L87 Difference]: Start difference. First operand 27795 states and 38379 transitions. Second operand 10 states. [2019-09-10 07:10:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:10:57,840 INFO L93 Difference]: Finished difference Result 123285 states and 172550 transitions. [2019-09-10 07:10:57,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:10:57,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-09-10 07:10:57,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:10:57,953 INFO L225 Difference]: With dead ends: 123285 [2019-09-10 07:10:57,953 INFO L226 Difference]: Without dead ends: 123285 [2019-09-10 07:10:57,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:10:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123285 states. [2019-09-10 07:10:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123285 to 27791. [2019-09-10 07:10:58,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27791 states. [2019-09-10 07:10:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27791 states to 27791 states and 38371 transitions. [2019-09-10 07:10:58,694 INFO L78 Accepts]: Start accepts. Automaton has 27791 states and 38371 transitions. Word has length 90 [2019-09-10 07:10:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:58,694 INFO L475 AbstractCegarLoop]: Abstraction has 27791 states and 38371 transitions. [2019-09-10 07:10:58,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:10:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 27791 states and 38371 transitions. [2019-09-10 07:10:58,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:10:58,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:58,703 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] [2019-09-10 07:10:58,703 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:58,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:58,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1003906654, now seen corresponding path program 1 times [2019-09-10 07:10:58,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:58,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:58,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:58,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:58,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:59,426 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-10 07:10:59,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:10:59,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:10:59,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:59,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:10:59,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:10:59,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:10:59,427 INFO L87 Difference]: Start difference. First operand 27791 states and 38371 transitions. Second operand 15 states. [2019-09-10 07:11:00,274 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 07:11:00,605 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 07:11:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:05,909 INFO L93 Difference]: Finished difference Result 190328 states and 270043 transitions. [2019-09-10 07:11:05,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:11:05,909 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-09-10 07:11:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:06,115 INFO L225 Difference]: With dead ends: 190328 [2019-09-10 07:11:06,115 INFO L226 Difference]: Without dead ends: 190328 [2019-09-10 07:11:06,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=269, Invalid=921, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:11:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190328 states. [2019-09-10 07:11:07,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190328 to 27767. [2019-09-10 07:11:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27767 states. [2019-09-10 07:11:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27767 states to 27767 states and 38323 transitions. [2019-09-10 07:11:07,101 INFO L78 Accepts]: Start accepts. Automaton has 27767 states and 38323 transitions. Word has length 90 [2019-09-10 07:11:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:07,101 INFO L475 AbstractCegarLoop]: Abstraction has 27767 states and 38323 transitions. [2019-09-10 07:11:07,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:11:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 27767 states and 38323 transitions. [2019-09-10 07:11:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:11:07,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:07,111 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] [2019-09-10 07:11:07,111 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:07,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:07,111 INFO L82 PathProgramCache]: Analyzing trace with hash -11377139, now seen corresponding path program 1 times [2019-09-10 07:11:07,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:07,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:07,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:07,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:07,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:07,573 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-10 07:11:07,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:07,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:11:07,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:07,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:11:07,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:11:07,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:11:07,575 INFO L87 Difference]: Start difference. First operand 27767 states and 38323 transitions. Second operand 13 states. [2019-09-10 07:11:08,081 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-09-10 07:11:08,237 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:11:08,432 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:11:08,914 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:11:09,294 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-10 07:11:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:10,116 INFO L93 Difference]: Finished difference Result 160426 states and 226776 transitions. [2019-09-10 07:11:10,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:11:10,117 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2019-09-10 07:11:10,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:10,280 INFO L225 Difference]: With dead ends: 160426 [2019-09-10 07:11:10,280 INFO L226 Difference]: Without dead ends: 160426 [2019-09-10 07:11:10,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:11:10,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160426 states. [2019-09-10 07:11:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160426 to 26839. [2019-09-10 07:11:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26839 states. [2019-09-10 07:11:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26839 states to 26839 states and 37089 transitions. [2019-09-10 07:11:11,447 INFO L78 Accepts]: Start accepts. Automaton has 26839 states and 37089 transitions. Word has length 90 [2019-09-10 07:11:11,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:11,447 INFO L475 AbstractCegarLoop]: Abstraction has 26839 states and 37089 transitions. [2019-09-10 07:11:11,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:11:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 26839 states and 37089 transitions. [2019-09-10 07:11:11,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:11:11,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:11,456 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] [2019-09-10 07:11:11,456 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:11,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:11,457 INFO L82 PathProgramCache]: Analyzing trace with hash 410133443, now seen corresponding path program 1 times [2019-09-10 07:11:11,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:11,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:11,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:11,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:11,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:11,571 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-10 07:11:11,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:11,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:11:11,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:11,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:11:11,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:11:11,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:11:11,573 INFO L87 Difference]: Start difference. First operand 26839 states and 37089 transitions. Second operand 7 states. [2019-09-10 07:11:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:13,467 INFO L93 Difference]: Finished difference Result 96053 states and 134098 transitions. [2019-09-10 07:11:13,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:11:13,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:11:13,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:13,554 INFO L225 Difference]: With dead ends: 96053 [2019-09-10 07:11:13,554 INFO L226 Difference]: Without dead ends: 96053 [2019-09-10 07:11:13,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:11:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96053 states. [2019-09-10 07:11:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96053 to 27095. [2019-09-10 07:11:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27095 states. [2019-09-10 07:11:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27095 states to 27095 states and 37435 transitions. [2019-09-10 07:11:14,136 INFO L78 Accepts]: Start accepts. Automaton has 27095 states and 37435 transitions. Word has length 90 [2019-09-10 07:11:14,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:14,136 INFO L475 AbstractCegarLoop]: Abstraction has 27095 states and 37435 transitions. [2019-09-10 07:11:14,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:11:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 27095 states and 37435 transitions. [2019-09-10 07:11:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:11:14,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:14,146 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] [2019-09-10 07:11:14,147 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:14,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:14,147 INFO L82 PathProgramCache]: Analyzing trace with hash 777788464, now seen corresponding path program 1 times [2019-09-10 07:11:14,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:14,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:14,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:14,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:14,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:14,367 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-10 07:11:14,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:14,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:11:14,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:14,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:11:14,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:11:14,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:11:14,369 INFO L87 Difference]: Start difference. First operand 27095 states and 37435 transitions. Second operand 9 states. [2019-09-10 07:11:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:17,321 INFO L93 Difference]: Finished difference Result 97787 states and 138629 transitions. [2019-09-10 07:11:17,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:11:17,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-10 07:11:17,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:17,427 INFO L225 Difference]: With dead ends: 97787 [2019-09-10 07:11:17,427 INFO L226 Difference]: Without dead ends: 97787 [2019-09-10 07:11:17,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:11:17,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97787 states. [2019-09-10 07:11:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97787 to 27009. [2019-09-10 07:11:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27009 states. [2019-09-10 07:11:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27009 states to 27009 states and 37311 transitions. [2019-09-10 07:11:18,222 INFO L78 Accepts]: Start accepts. Automaton has 27009 states and 37311 transitions. Word has length 91 [2019-09-10 07:11:18,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:18,222 INFO L475 AbstractCegarLoop]: Abstraction has 27009 states and 37311 transitions. [2019-09-10 07:11:18,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:11:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 27009 states and 37311 transitions. [2019-09-10 07:11:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:11:18,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:18,232 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] [2019-09-10 07:11:18,232 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:18,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:18,233 INFO L82 PathProgramCache]: Analyzing trace with hash 339227022, now seen corresponding path program 1 times [2019-09-10 07:11:18,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:18,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:18,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:18,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:18,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:18,359 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-10 07:11:18,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:18,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:11:18,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:18,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:11:18,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:11:18,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:11:18,361 INFO L87 Difference]: Start difference. First operand 27009 states and 37311 transitions. Second operand 7 states. [2019-09-10 07:11:20,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:20,267 INFO L93 Difference]: Finished difference Result 111127 states and 156263 transitions. [2019-09-10 07:11:20,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:11:20,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-09-10 07:11:20,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:20,395 INFO L225 Difference]: With dead ends: 111127 [2019-09-10 07:11:20,395 INFO L226 Difference]: Without dead ends: 111127 [2019-09-10 07:11:20,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:11:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111127 states. [2019-09-10 07:11:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111127 to 27084. [2019-09-10 07:11:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27084 states. [2019-09-10 07:11:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27084 states to 27084 states and 37411 transitions. [2019-09-10 07:11:21,124 INFO L78 Accepts]: Start accepts. Automaton has 27084 states and 37411 transitions. Word has length 91 [2019-09-10 07:11:21,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:21,125 INFO L475 AbstractCegarLoop]: Abstraction has 27084 states and 37411 transitions. [2019-09-10 07:11:21,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:11:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 27084 states and 37411 transitions. [2019-09-10 07:11:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:11:21,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:21,135 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] [2019-09-10 07:11:21,135 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:21,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:21,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1108145253, now seen corresponding path program 1 times [2019-09-10 07:11:21,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:21,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:21,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:21,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:21,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:21,261 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-10 07:11:21,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:21,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:11:21,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:21,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:11:21,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:11:21,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:11:21,263 INFO L87 Difference]: Start difference. First operand 27084 states and 37411 transitions. Second operand 7 states. [2019-09-10 07:11:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:23,078 INFO L93 Difference]: Finished difference Result 109185 states and 153069 transitions. [2019-09-10 07:11:23,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:11:23,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-09-10 07:11:23,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:23,178 INFO L225 Difference]: With dead ends: 109185 [2019-09-10 07:11:23,179 INFO L226 Difference]: Without dead ends: 109185 [2019-09-10 07:11:23,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:11:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109185 states. [2019-09-10 07:11:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109185 to 27232. [2019-09-10 07:11:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27232 states. [2019-09-10 07:11:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27232 states to 27232 states and 37609 transitions. [2019-09-10 07:11:24,021 INFO L78 Accepts]: Start accepts. Automaton has 27232 states and 37609 transitions. Word has length 91 [2019-09-10 07:11:24,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:24,021 INFO L475 AbstractCegarLoop]: Abstraction has 27232 states and 37609 transitions. [2019-09-10 07:11:24,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:11:24,021 INFO L276 IsEmpty]: Start isEmpty. Operand 27232 states and 37609 transitions. [2019-09-10 07:11:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:11:24,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:24,030 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] [2019-09-10 07:11:24,031 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:24,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:24,031 INFO L82 PathProgramCache]: Analyzing trace with hash 170764348, now seen corresponding path program 1 times [2019-09-10 07:11:24,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:24,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:24,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:24,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:24,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:24,234 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-10 07:11:24,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:24,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:11:24,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:24,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:11:24,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:11:24,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:11:24,236 INFO L87 Difference]: Start difference. First operand 27232 states and 37609 transitions. Second operand 10 states. [2019-09-10 07:11:27,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:27,711 INFO L93 Difference]: Finished difference Result 104592 states and 147173 transitions. [2019-09-10 07:11:27,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:11:27,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2019-09-10 07:11:27,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:27,828 INFO L225 Difference]: With dead ends: 104592 [2019-09-10 07:11:27,828 INFO L226 Difference]: Without dead ends: 104592 [2019-09-10 07:11:27,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:11:27,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104592 states. [2019-09-10 07:11:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104592 to 26658. [2019-09-10 07:11:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26658 states. [2019-09-10 07:11:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26658 states to 26658 states and 36826 transitions. [2019-09-10 07:11:28,437 INFO L78 Accepts]: Start accepts. Automaton has 26658 states and 36826 transitions. Word has length 91 [2019-09-10 07:11:28,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:28,437 INFO L475 AbstractCegarLoop]: Abstraction has 26658 states and 36826 transitions. [2019-09-10 07:11:28,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:11:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 26658 states and 36826 transitions. [2019-09-10 07:11:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:11:28,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:28,451 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] [2019-09-10 07:11:28,451 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:28,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:28,451 INFO L82 PathProgramCache]: Analyzing trace with hash -832072873, now seen corresponding path program 1 times [2019-09-10 07:11:28,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:28,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:28,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:29,051 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-10 07:11:29,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:29,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:11:29,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:29,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:11:29,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:11:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:11:29,053 INFO L87 Difference]: Start difference. First operand 26658 states and 36826 transitions. Second operand 13 states. [2019-09-10 07:11:29,550 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-09-10 07:11:29,743 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 07:11:29,987 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-10 07:11:30,417 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-10 07:11:30,768 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 07:11:30,949 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-10 07:11:31,348 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 07:11:31,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:31,964 INFO L93 Difference]: Finished difference Result 140397 states and 198797 transitions. [2019-09-10 07:11:31,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:11:31,965 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 92 [2019-09-10 07:11:31,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:32,117 INFO L225 Difference]: With dead ends: 140397 [2019-09-10 07:11:32,117 INFO L226 Difference]: Without dead ends: 140397 [2019-09-10 07:11:32,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:11:32,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140397 states. [2019-09-10 07:11:33,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140397 to 26387. [2019-09-10 07:11:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26387 states. [2019-09-10 07:11:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26387 states to 26387 states and 36446 transitions. [2019-09-10 07:11:33,178 INFO L78 Accepts]: Start accepts. Automaton has 26387 states and 36446 transitions. Word has length 92 [2019-09-10 07:11:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:33,178 INFO L475 AbstractCegarLoop]: Abstraction has 26387 states and 36446 transitions. [2019-09-10 07:11:33,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:11:33,178 INFO L276 IsEmpty]: Start isEmpty. Operand 26387 states and 36446 transitions. [2019-09-10 07:11:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:11:33,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:33,188 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] [2019-09-10 07:11:33,188 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:33,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:33,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1799124670, now seen corresponding path program 1 times [2019-09-10 07:11:33,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:33,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:33,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:33,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:33,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:34,464 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-10 07:11:34,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:34,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:11:34,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:34,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:11:34,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:11:34,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:11:34,466 INFO L87 Difference]: Start difference. First operand 26387 states and 36446 transitions. Second operand 18 states. [2019-09-10 07:11:34,655 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 07:11:35,125 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 07:11:35,284 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-10 07:11:35,592 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 07:11:35,991 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 07:11:36,701 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-09-10 07:11:37,841 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-10 07:11:39,050 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 07:11:39,675 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 07:11:39,988 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-10 07:11:40,317 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-09-10 07:11:40,913 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 07:11:41,283 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 07:11:41,553 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 07:11:43,886 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:11:44,119 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 07:11:44,474 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 07:11:45,286 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:11:45,570 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:11:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:45,752 INFO L93 Difference]: Finished difference Result 156633 states and 221668 transitions. [2019-09-10 07:11:45,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 07:11:45,753 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 92 [2019-09-10 07:11:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:45,916 INFO L225 Difference]: With dead ends: 156633 [2019-09-10 07:11:45,917 INFO L226 Difference]: Without dead ends: 156633 [2019-09-10 07:11:45,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=385, Invalid=1337, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 07:11:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156633 states. [2019-09-10 07:11:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156633 to 26437. [2019-09-10 07:11:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26437 states. [2019-09-10 07:11:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26437 states to 26437 states and 36517 transitions. [2019-09-10 07:11:47,004 INFO L78 Accepts]: Start accepts. Automaton has 26437 states and 36517 transitions. Word has length 92 [2019-09-10 07:11:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:47,005 INFO L475 AbstractCegarLoop]: Abstraction has 26437 states and 36517 transitions. [2019-09-10 07:11:47,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:11:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 26437 states and 36517 transitions. [2019-09-10 07:11:47,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:11:47,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:47,016 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] [2019-09-10 07:11:47,016 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:47,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:47,017 INFO L82 PathProgramCache]: Analyzing trace with hash 154996530, now seen corresponding path program 1 times [2019-09-10 07:11:47,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:47,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:47,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:47,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:47,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:47,099 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-10 07:11:47,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:47,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:47,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:47,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:47,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:47,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:47,101 INFO L87 Difference]: Start difference. First operand 26437 states and 36517 transitions. Second operand 3 states. [2019-09-10 07:11:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:47,197 INFO L93 Difference]: Finished difference Result 26439 states and 36254 transitions. [2019-09-10 07:11:47,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:11:47,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 07:11:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:47,229 INFO L225 Difference]: With dead ends: 26439 [2019-09-10 07:11:47,229 INFO L226 Difference]: Without dead ends: 26439 [2019-09-10 07:11:47,230 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-10 07:11:47,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26439 states. [2019-09-10 07:11:47,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26439 to 26437. [2019-09-10 07:11:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26437 states. [2019-09-10 07:11:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26437 states to 26437 states and 36253 transitions. [2019-09-10 07:11:47,565 INFO L78 Accepts]: Start accepts. Automaton has 26437 states and 36253 transitions. Word has length 93 [2019-09-10 07:11:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:47,565 INFO L475 AbstractCegarLoop]: Abstraction has 26437 states and 36253 transitions. [2019-09-10 07:11:47,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:11:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 26437 states and 36253 transitions. [2019-09-10 07:11:47,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:11:47,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:47,579 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] [2019-09-10 07:11:47,580 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:47,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:47,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1011174453, now seen corresponding path program 1 times [2019-09-10 07:11:47,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:47,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:47,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:47,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:47,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:47,808 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-10 07:11:47,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:47,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:11:47,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:47,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:11:47,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:11:47,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:11:47,810 INFO L87 Difference]: Start difference. First operand 26437 states and 36253 transitions. Second operand 9 states. [2019-09-10 07:11:50,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:50,413 INFO L93 Difference]: Finished difference Result 96098 states and 134244 transitions. [2019-09-10 07:11:50,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:11:50,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 07:11:50,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:50,519 INFO L225 Difference]: With dead ends: 96098 [2019-09-10 07:11:50,519 INFO L226 Difference]: Without dead ends: 96098 [2019-09-10 07:11:50,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:11:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96098 states. [2019-09-10 07:11:51,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96098 to 26419. [2019-09-10 07:11:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26419 states. [2019-09-10 07:11:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26419 states to 26419 states and 36217 transitions. [2019-09-10 07:11:51,196 INFO L78 Accepts]: Start accepts. Automaton has 26419 states and 36217 transitions. Word has length 93 [2019-09-10 07:11:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:51,196 INFO L475 AbstractCegarLoop]: Abstraction has 26419 states and 36217 transitions. [2019-09-10 07:11:51,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:11:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 26419 states and 36217 transitions. [2019-09-10 07:11:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:11:51,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:51,207 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] [2019-09-10 07:11:51,208 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:51,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2004883242, now seen corresponding path program 1 times [2019-09-10 07:11:51,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:51,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:51,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:51,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:51,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:51,377 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-10 07:11:51,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:51,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:11:51,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:51,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:11:51,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:11:51,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:11:51,379 INFO L87 Difference]: Start difference. First operand 26419 states and 36217 transitions. Second operand 9 states. [2019-09-10 07:11:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:54,151 INFO L93 Difference]: Finished difference Result 96978 states and 135358 transitions. [2019-09-10 07:11:54,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:11:54,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 07:11:54,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:54,250 INFO L225 Difference]: With dead ends: 96978 [2019-09-10 07:11:54,251 INFO L226 Difference]: Without dead ends: 96978 [2019-09-10 07:11:54,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:11:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96978 states. [2019-09-10 07:11:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96978 to 26491. [2019-09-10 07:11:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26491 states. [2019-09-10 07:11:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26491 states to 26491 states and 36277 transitions. [2019-09-10 07:11:55,039 INFO L78 Accepts]: Start accepts. Automaton has 26491 states and 36277 transitions. Word has length 93 [2019-09-10 07:11:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:55,040 INFO L475 AbstractCegarLoop]: Abstraction has 26491 states and 36277 transitions. [2019-09-10 07:11:55,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:11:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 26491 states and 36277 transitions. [2019-09-10 07:11:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:11:55,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:55,051 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] [2019-09-10 07:11:55,051 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:55,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1852395688, now seen corresponding path program 1 times [2019-09-10 07:11:55,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:55,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:55,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:55,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:55,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:55,113 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-10 07:11:55,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:55,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:55,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:55,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:55,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:55,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:55,114 INFO L87 Difference]: Start difference. First operand 26491 states and 36277 transitions. Second operand 3 states. [2019-09-10 07:11:55,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:55,206 INFO L93 Difference]: Finished difference Result 26483 states and 35964 transitions. [2019-09-10 07:11:55,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:11:55,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 07:11:55,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:55,229 INFO L225 Difference]: With dead ends: 26483 [2019-09-10 07:11:55,229 INFO L226 Difference]: Without dead ends: 26483 [2019-09-10 07:11:55,230 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-10 07:11:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26483 states. [2019-09-10 07:11:55,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26483 to 26481. [2019-09-10 07:11:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26481 states. [2019-09-10 07:11:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26481 states to 26481 states and 35963 transitions. [2019-09-10 07:11:55,436 INFO L78 Accepts]: Start accepts. Automaton has 26481 states and 35963 transitions. Word has length 94 [2019-09-10 07:11:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:55,436 INFO L475 AbstractCegarLoop]: Abstraction has 26481 states and 35963 transitions. [2019-09-10 07:11:55,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:11:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 26481 states and 35963 transitions. [2019-09-10 07:11:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:11:55,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:55,446 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] [2019-09-10 07:11:55,446 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:55,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:55,447 INFO L82 PathProgramCache]: Analyzing trace with hash 961851978, now seen corresponding path program 1 times [2019-09-10 07:11:55,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:55,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:55,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:55,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:55,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:55,526 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-10 07:11:55,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:55,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:55,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:55,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:55,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:55,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:55,528 INFO L87 Difference]: Start difference. First operand 26481 states and 35963 transitions. Second operand 3 states. [2019-09-10 07:11:55,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:55,673 INFO L93 Difference]: Finished difference Result 26483 states and 35578 transitions. [2019-09-10 07:11:55,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:11:55,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 07:11:55,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:55,695 INFO L225 Difference]: With dead ends: 26483 [2019-09-10 07:11:55,695 INFO L226 Difference]: Without dead ends: 26483 [2019-09-10 07:11:55,695 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-10 07:11:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26483 states. [2019-09-10 07:11:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26483 to 26481. [2019-09-10 07:11:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26481 states. [2019-09-10 07:11:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26481 states to 26481 states and 35577 transitions. [2019-09-10 07:11:55,900 INFO L78 Accepts]: Start accepts. Automaton has 26481 states and 35577 transitions. Word has length 94 [2019-09-10 07:11:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:55,900 INFO L475 AbstractCegarLoop]: Abstraction has 26481 states and 35577 transitions. [2019-09-10 07:11:55,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:11:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 26481 states and 35577 transitions. [2019-09-10 07:11:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:11:55,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:55,911 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] [2019-09-10 07:11:55,912 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:55,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:55,912 INFO L82 PathProgramCache]: Analyzing trace with hash 263760805, now seen corresponding path program 1 times [2019-09-10 07:11:55,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:55,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:55,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:55,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:55,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:55,968 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-10 07:11:55,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:55,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:55,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:55,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:55,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:55,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:55,970 INFO L87 Difference]: Start difference. First operand 26481 states and 35577 transitions. Second operand 3 states. [2019-09-10 07:11:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:56,115 INFO L93 Difference]: Finished difference Result 31930 states and 43097 transitions. [2019-09-10 07:11:56,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:11:56,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 07:11:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:56,143 INFO L225 Difference]: With dead ends: 31930 [2019-09-10 07:11:56,143 INFO L226 Difference]: Without dead ends: 31930 [2019-09-10 07:11:56,143 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-10 07:11:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31930 states. [2019-09-10 07:11:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31930 to 24683. [2019-09-10 07:11:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24683 states. [2019-09-10 07:11:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24683 states to 24683 states and 33214 transitions. [2019-09-10 07:11:56,360 INFO L78 Accepts]: Start accepts. Automaton has 24683 states and 33214 transitions. Word has length 94 [2019-09-10 07:11:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:56,360 INFO L475 AbstractCegarLoop]: Abstraction has 24683 states and 33214 transitions. [2019-09-10 07:11:56,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:11:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 24683 states and 33214 transitions. [2019-09-10 07:11:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:11:56,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:56,370 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] [2019-09-10 07:11:56,370 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:56,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:56,370 INFO L82 PathProgramCache]: Analyzing trace with hash 484433187, now seen corresponding path program 1 times [2019-09-10 07:11:56,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:56,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:56,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:56,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:56,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:56,425 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-10 07:11:56,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:56,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:11:56,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:56,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:11:56,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:11:56,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:11:56,427 INFO L87 Difference]: Start difference. First operand 24683 states and 33214 transitions. Second operand 3 states. [2019-09-10 07:11:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:56,539 INFO L93 Difference]: Finished difference Result 34543 states and 47042 transitions. [2019-09-10 07:11:56,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:11:56,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 07:11:56,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:56,573 INFO L225 Difference]: With dead ends: 34543 [2019-09-10 07:11:56,573 INFO L226 Difference]: Without dead ends: 34543 [2019-09-10 07:11:56,573 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-10 07:11:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34543 states. [2019-09-10 07:11:56,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34543 to 24065. [2019-09-10 07:11:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24065 states. [2019-09-10 07:11:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24065 states to 24065 states and 32380 transitions. [2019-09-10 07:11:56,808 INFO L78 Accepts]: Start accepts. Automaton has 24065 states and 32380 transitions. Word has length 94 [2019-09-10 07:11:56,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:56,808 INFO L475 AbstractCegarLoop]: Abstraction has 24065 states and 32380 transitions. [2019-09-10 07:11:56,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:11:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 24065 states and 32380 transitions. [2019-09-10 07:11:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:11:56,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:56,818 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] [2019-09-10 07:11:56,819 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:56,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:56,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1741768858, now seen corresponding path program 1 times [2019-09-10 07:11:56,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:56,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:56,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:56,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:56,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:11:56,974 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-10 07:11:56,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:11:56,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:11:56,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:11:56,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:11:56,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:11:56,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:11:56,976 INFO L87 Difference]: Start difference. First operand 24065 states and 32380 transitions. Second operand 9 states. [2019-09-10 07:11:59,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:11:59,192 INFO L93 Difference]: Finished difference Result 67027 states and 91761 transitions. [2019-09-10 07:11:59,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:11:59,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 07:11:59,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:11:59,259 INFO L225 Difference]: With dead ends: 67027 [2019-09-10 07:11:59,259 INFO L226 Difference]: Without dead ends: 67027 [2019-09-10 07:11:59,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:11:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67027 states. [2019-09-10 07:11:59,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67027 to 24031. [2019-09-10 07:11:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24031 states. [2019-09-10 07:11:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24031 states to 24031 states and 32330 transitions. [2019-09-10 07:11:59,849 INFO L78 Accepts]: Start accepts. Automaton has 24031 states and 32330 transitions. Word has length 95 [2019-09-10 07:11:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:11:59,849 INFO L475 AbstractCegarLoop]: Abstraction has 24031 states and 32330 transitions. [2019-09-10 07:11:59,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:11:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 24031 states and 32330 transitions. [2019-09-10 07:11:59,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:11:59,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:11:59,860 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] [2019-09-10 07:11:59,861 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:11:59,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:11:59,861 INFO L82 PathProgramCache]: Analyzing trace with hash 423335165, now seen corresponding path program 1 times [2019-09-10 07:11:59,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:11:59,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:59,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:11:59,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:11:59,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:11:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:00,030 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-10 07:12:00,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:00,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:12:00,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:00,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:12:00,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:12:00,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:12:00,033 INFO L87 Difference]: Start difference. First operand 24031 states and 32330 transitions. Second operand 9 states. [2019-09-10 07:12:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:02,380 INFO L93 Difference]: Finished difference Result 63207 states and 86978 transitions. [2019-09-10 07:12:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:12:02,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-10 07:12:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:02,440 INFO L225 Difference]: With dead ends: 63207 [2019-09-10 07:12:02,441 INFO L226 Difference]: Without dead ends: 63207 [2019-09-10 07:12:02,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:12:02,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63207 states. [2019-09-10 07:12:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63207 to 23785. [2019-09-10 07:12:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23785 states. [2019-09-10 07:12:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23785 states to 23785 states and 32024 transitions. [2019-09-10 07:12:02,787 INFO L78 Accepts]: Start accepts. Automaton has 23785 states and 32024 transitions. Word has length 95 [2019-09-10 07:12:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:02,787 INFO L475 AbstractCegarLoop]: Abstraction has 23785 states and 32024 transitions. [2019-09-10 07:12:02,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:12:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 23785 states and 32024 transitions. [2019-09-10 07:12:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:12:02,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:02,796 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] [2019-09-10 07:12:02,797 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:02,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:02,797 INFO L82 PathProgramCache]: Analyzing trace with hash -783861334, now seen corresponding path program 1 times [2019-09-10 07:12:02,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:02,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:02,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:02,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:02,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:02,851 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-10 07:12:02,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:02,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:12:02,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:02,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:12:02,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:12:02,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:12:02,852 INFO L87 Difference]: Start difference. First operand 23785 states and 32024 transitions. Second operand 3 states. [2019-09-10 07:12:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:03,050 INFO L93 Difference]: Finished difference Result 29073 states and 39398 transitions. [2019-09-10 07:12:03,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:12:03,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 07:12:03,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:03,075 INFO L225 Difference]: With dead ends: 29073 [2019-09-10 07:12:03,075 INFO L226 Difference]: Without dead ends: 29073 [2019-09-10 07:12:03,076 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-10 07:12:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29073 states. [2019-09-10 07:12:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29073 to 22597. [2019-09-10 07:12:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22597 states. [2019-09-10 07:12:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22597 states to 22597 states and 30508 transitions. [2019-09-10 07:12:03,268 INFO L78 Accepts]: Start accepts. Automaton has 22597 states and 30508 transitions. Word has length 95 [2019-09-10 07:12:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:03,268 INFO L475 AbstractCegarLoop]: Abstraction has 22597 states and 30508 transitions. [2019-09-10 07:12:03,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:12:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 22597 states and 30508 transitions. [2019-09-10 07:12:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 07:12:03,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:03,276 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] [2019-09-10 07:12:03,277 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:03,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:03,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1470898717, now seen corresponding path program 1 times [2019-09-10 07:12:03,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:03,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:03,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:03,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:03,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:04,045 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-10 07:12:04,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:04,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:12:04,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:04,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:12:04,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:12:04,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:12:04,047 INFO L87 Difference]: Start difference. First operand 22597 states and 30508 transitions. Second operand 19 states. [2019-09-10 07:12:04,789 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-09-10 07:12:05,428 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2019-09-10 07:12:05,686 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-09-10 07:12:05,886 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-09-10 07:12:06,108 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-09-10 07:12:06,389 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:12:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:08,119 INFO L93 Difference]: Finished difference Result 59434 states and 80946 transitions. [2019-09-10 07:12:08,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:12:08,119 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2019-09-10 07:12:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:08,179 INFO L225 Difference]: With dead ends: 59434 [2019-09-10 07:12:08,179 INFO L226 Difference]: Without dead ends: 59434 [2019-09-10 07:12:08,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:12:08,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59434 states. [2019-09-10 07:12:08,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59434 to 22554. [2019-09-10 07:12:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22554 states. [2019-09-10 07:12:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22554 states to 22554 states and 30456 transitions. [2019-09-10 07:12:08,494 INFO L78 Accepts]: Start accepts. Automaton has 22554 states and 30456 transitions. Word has length 96 [2019-09-10 07:12:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:08,494 INFO L475 AbstractCegarLoop]: Abstraction has 22554 states and 30456 transitions. [2019-09-10 07:12:08,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:12:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 22554 states and 30456 transitions. [2019-09-10 07:12:08,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 07:12:08,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:08,504 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] [2019-09-10 07:12:08,504 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:08,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:08,504 INFO L82 PathProgramCache]: Analyzing trace with hash 51678833, now seen corresponding path program 1 times [2019-09-10 07:12:08,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:08,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:08,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:08,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:08,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:09,101 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-09-10 07:12:09,507 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-10 07:12:09,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:09,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:12:09,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:09,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:12:09,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:12:09,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:12:09,508 INFO L87 Difference]: Start difference. First operand 22554 states and 30456 transitions. Second operand 18 states. [2019-09-10 07:12:10,152 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-10 07:12:10,338 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 07:12:11,102 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 07:12:11,450 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-09-10 07:12:11,689 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:12:11,953 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:12:12,246 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:12:12,444 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 07:12:12,585 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 07:12:14,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:14,205 INFO L93 Difference]: Finished difference Result 56194 states and 76410 transitions. [2019-09-10 07:12:14,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:12:14,206 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-09-10 07:12:14,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:14,255 INFO L225 Difference]: With dead ends: 56194 [2019-09-10 07:12:14,255 INFO L226 Difference]: Without dead ends: 56194 [2019-09-10 07:12:14,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:12:14,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56194 states. [2019-09-10 07:12:14,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56194 to 22543. [2019-09-10 07:12:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22543 states. [2019-09-10 07:12:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22543 states to 22543 states and 30443 transitions. [2019-09-10 07:12:14,560 INFO L78 Accepts]: Start accepts. Automaton has 22543 states and 30443 transitions. Word has length 96 [2019-09-10 07:12:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:14,560 INFO L475 AbstractCegarLoop]: Abstraction has 22543 states and 30443 transitions. [2019-09-10 07:12:14,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:12:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 22543 states and 30443 transitions. [2019-09-10 07:12:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 07:12:14,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:14,569 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] [2019-09-10 07:12:14,569 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:14,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:14,569 INFO L82 PathProgramCache]: Analyzing trace with hash -328069764, now seen corresponding path program 1 times [2019-09-10 07:12:14,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:14,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:14,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:14,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:14,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:15,003 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-10 07:12:15,304 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-10 07:12:15,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:15,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:12:15,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:15,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:12:15,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:12:15,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:12:15,307 INFO L87 Difference]: Start difference. First operand 22543 states and 30443 transitions. Second operand 13 states. [2019-09-10 07:12:16,443 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 07:12:16,639 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:12:16,830 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:12:17,029 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 07:12:17,204 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 07:12:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:18,128 INFO L93 Difference]: Finished difference Result 39596 states and 53917 transitions. [2019-09-10 07:12:18,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:12:18,129 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-09-10 07:12:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:18,169 INFO L225 Difference]: With dead ends: 39596 [2019-09-10 07:12:18,169 INFO L226 Difference]: Without dead ends: 39596 [2019-09-10 07:12:18,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:12:18,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39596 states. [2019-09-10 07:12:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39596 to 22455. [2019-09-10 07:12:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22455 states. [2019-09-10 07:12:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22455 states to 22455 states and 30329 transitions. [2019-09-10 07:12:18,420 INFO L78 Accepts]: Start accepts. Automaton has 22455 states and 30329 transitions. Word has length 96 [2019-09-10 07:12:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:18,420 INFO L475 AbstractCegarLoop]: Abstraction has 22455 states and 30329 transitions. [2019-09-10 07:12:18,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:12:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 22455 states and 30329 transitions. [2019-09-10 07:12:18,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:12:18,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:18,431 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] [2019-09-10 07:12:18,431 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:18,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash 365118902, now seen corresponding path program 1 times [2019-09-10 07:12:18,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:18,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:18,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:18,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:18,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:18,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-10 07:12:18,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:18,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:12:18,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:18,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:12:18,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:12:18,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:12:18,843 INFO L87 Difference]: Start difference. First operand 22455 states and 30329 transitions. Second operand 11 states. [2019-09-10 07:12:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:20,236 INFO L93 Difference]: Finished difference Result 47530 states and 65279 transitions. [2019-09-10 07:12:20,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:12:20,241 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-09-10 07:12:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:20,284 INFO L225 Difference]: With dead ends: 47530 [2019-09-10 07:12:20,284 INFO L226 Difference]: Without dead ends: 47530 [2019-09-10 07:12:20,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:12:20,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47530 states. [2019-09-10 07:12:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47530 to 22399. [2019-09-10 07:12:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22399 states. [2019-09-10 07:12:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22399 states to 22399 states and 30251 transitions. [2019-09-10 07:12:20,547 INFO L78 Accepts]: Start accepts. Automaton has 22399 states and 30251 transitions. Word has length 97 [2019-09-10 07:12:20,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:20,547 INFO L475 AbstractCegarLoop]: Abstraction has 22399 states and 30251 transitions. [2019-09-10 07:12:20,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:12:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 22399 states and 30251 transitions. [2019-09-10 07:12:20,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:12:20,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:20,557 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] [2019-09-10 07:12:20,557 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:20,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:20,558 INFO L82 PathProgramCache]: Analyzing trace with hash -141201520, now seen corresponding path program 1 times [2019-09-10 07:12:20,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:20,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:20,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:20,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:20,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:20,832 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-09-10 07:12:21,395 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-10 07:12:21,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:21,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:12:21,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:21,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:12:21,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:12:21,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:12:21,396 INFO L87 Difference]: Start difference. First operand 22399 states and 30251 transitions. Second operand 13 states. [2019-09-10 07:12:22,312 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 07:12:22,528 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:12:22,737 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:12:22,954 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:12:23,145 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:12:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:24,088 INFO L93 Difference]: Finished difference Result 36940 states and 50288 transitions. [2019-09-10 07:12:24,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:12:24,089 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-09-10 07:12:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:24,122 INFO L225 Difference]: With dead ends: 36940 [2019-09-10 07:12:24,122 INFO L226 Difference]: Without dead ends: 36940 [2019-09-10 07:12:24,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:12:24,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36940 states. [2019-09-10 07:12:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36940 to 22383. [2019-09-10 07:12:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22383 states. [2019-09-10 07:12:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22383 states to 22383 states and 30233 transitions. [2019-09-10 07:12:24,348 INFO L78 Accepts]: Start accepts. Automaton has 22383 states and 30233 transitions. Word has length 97 [2019-09-10 07:12:24,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:24,348 INFO L475 AbstractCegarLoop]: Abstraction has 22383 states and 30233 transitions. [2019-09-10 07:12:24,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:12:24,348 INFO L276 IsEmpty]: Start isEmpty. Operand 22383 states and 30233 transitions. [2019-09-10 07:12:24,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:12:24,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:24,361 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] [2019-09-10 07:12:24,362 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:24,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:24,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2096992809, now seen corresponding path program 1 times [2019-09-10 07:12:24,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:24,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:24,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:24,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:24,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:24,444 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-10 07:12:24,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:24,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:12:24,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:24,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:12:24,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:12:24,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:12:24,446 INFO L87 Difference]: Start difference. First operand 22383 states and 30233 transitions. Second operand 3 states. [2019-09-10 07:12:24,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:24,535 INFO L93 Difference]: Finished difference Result 22385 states and 30018 transitions. [2019-09-10 07:12:24,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:12:24,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:12:24,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:24,557 INFO L225 Difference]: With dead ends: 22385 [2019-09-10 07:12:24,557 INFO L226 Difference]: Without dead ends: 22385 [2019-09-10 07:12:24,558 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-10 07:12:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22385 states. [2019-09-10 07:12:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22385 to 22383. [2019-09-10 07:12:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22383 states. [2019-09-10 07:12:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22383 states to 22383 states and 30017 transitions. [2019-09-10 07:12:24,740 INFO L78 Accepts]: Start accepts. Automaton has 22383 states and 30017 transitions. Word has length 100 [2019-09-10 07:12:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:24,740 INFO L475 AbstractCegarLoop]: Abstraction has 22383 states and 30017 transitions. [2019-09-10 07:12:24,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:12:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand 22383 states and 30017 transitions. [2019-09-10 07:12:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:12:24,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:24,754 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] [2019-09-10 07:12:24,754 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:24,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:24,754 INFO L82 PathProgramCache]: Analyzing trace with hash -744637315, now seen corresponding path program 1 times [2019-09-10 07:12:24,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:24,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:24,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:24,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:24,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:24,826 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-10 07:12:24,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:24,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:12:24,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:24,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:12:24,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:12:24,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:12:24,827 INFO L87 Difference]: Start difference. First operand 22383 states and 30017 transitions. Second operand 3 states. [2019-09-10 07:12:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:24,984 INFO L93 Difference]: Finished difference Result 27668 states and 37280 transitions. [2019-09-10 07:12:24,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:12:24,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 07:12:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:25,023 INFO L225 Difference]: With dead ends: 27668 [2019-09-10 07:12:25,023 INFO L226 Difference]: Without dead ends: 27668 [2019-09-10 07:12:25,024 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-10 07:12:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27668 states. [2019-09-10 07:12:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27668 to 21076. [2019-09-10 07:12:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21076 states. [2019-09-10 07:12:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21076 states to 21076 states and 28303 transitions. [2019-09-10 07:12:25,330 INFO L78 Accepts]: Start accepts. Automaton has 21076 states and 28303 transitions. Word has length 101 [2019-09-10 07:12:25,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:25,331 INFO L475 AbstractCegarLoop]: Abstraction has 21076 states and 28303 transitions. [2019-09-10 07:12:25,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:12:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 21076 states and 28303 transitions. [2019-09-10 07:12:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:12:25,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:25,349 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] [2019-09-10 07:12:25,349 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2048477593, now seen corresponding path program 1 times [2019-09-10 07:12:25,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:25,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:25,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:25,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:25,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:26,222 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 07:12:27,558 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-10 07:12:27,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:27,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 07:12:27,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:27,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 07:12:27,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 07:12:27,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:12:27,559 INFO L87 Difference]: Start difference. First operand 21076 states and 28303 transitions. Second operand 28 states. [2019-09-10 07:12:27,753 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 07:12:28,814 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-10 07:12:29,097 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 07:12:29,517 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 07:12:29,911 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2019-09-10 07:12:30,417 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2019-09-10 07:12:31,132 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 107 [2019-09-10 07:12:32,890 WARN L188 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 121 [2019-09-10 07:12:33,777 WARN L188 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 132 [2019-09-10 07:12:34,212 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-09-10 07:12:34,780 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2019-09-10 07:12:35,549 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-09-10 07:12:35,987 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-09-10 07:12:36,446 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-09-10 07:12:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:42,456 INFO L93 Difference]: Finished difference Result 33501 states and 44951 transitions. [2019-09-10 07:12:42,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 07:12:42,457 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 102 [2019-09-10 07:12:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:42,489 INFO L225 Difference]: With dead ends: 33501 [2019-09-10 07:12:42,490 INFO L226 Difference]: Without dead ends: 33501 [2019-09-10 07:12:42,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=527, Invalid=2023, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 07:12:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33501 states. [2019-09-10 07:12:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33501 to 21083. [2019-09-10 07:12:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21083 states. [2019-09-10 07:12:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21083 states to 21083 states and 28310 transitions. [2019-09-10 07:12:42,696 INFO L78 Accepts]: Start accepts. Automaton has 21083 states and 28310 transitions. Word has length 102 [2019-09-10 07:12:42,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:42,696 INFO L475 AbstractCegarLoop]: Abstraction has 21083 states and 28310 transitions. [2019-09-10 07:12:42,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 07:12:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 21083 states and 28310 transitions. [2019-09-10 07:12:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:12:42,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:42,710 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] [2019-09-10 07:12:42,710 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:42,710 INFO L82 PathProgramCache]: Analyzing trace with hash 425114390, now seen corresponding path program 1 times [2019-09-10 07:12:42,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:42,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:42,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:42,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:42,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:43,369 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-10 07:12:43,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:43,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:12:43,369 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:43,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:12:43,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:12:43,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:12:43,370 INFO L87 Difference]: Start difference. First operand 21083 states and 28310 transitions. Second operand 13 states. [2019-09-10 07:12:45,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:45,950 INFO L93 Difference]: Finished difference Result 76827 states and 104821 transitions. [2019-09-10 07:12:45,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-10 07:12:45,950 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2019-09-10 07:12:45,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:46,029 INFO L225 Difference]: With dead ends: 76827 [2019-09-10 07:12:46,029 INFO L226 Difference]: Without dead ends: 76827 [2019-09-10 07:12:46,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:12:46,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76827 states. [2019-09-10 07:12:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76827 to 21081. [2019-09-10 07:12:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21081 states. [2019-09-10 07:12:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21081 states to 21081 states and 28306 transitions. [2019-09-10 07:12:46,409 INFO L78 Accepts]: Start accepts. Automaton has 21081 states and 28306 transitions. Word has length 103 [2019-09-10 07:12:46,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:46,409 INFO L475 AbstractCegarLoop]: Abstraction has 21081 states and 28306 transitions. [2019-09-10 07:12:46,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:12:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 21081 states and 28306 transitions. [2019-09-10 07:12:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:12:46,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:46,422 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] [2019-09-10 07:12:46,422 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:46,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:46,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1929430946, now seen corresponding path program 1 times [2019-09-10 07:12:46,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:46,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:46,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:46,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:46,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:47,475 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-10 07:12:47,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:47,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:12:47,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:47,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:12:47,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:12:47,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:12:47,478 INFO L87 Difference]: Start difference. First operand 21081 states and 28306 transitions. Second operand 16 states. [2019-09-10 07:12:49,205 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-09-10 07:12:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:50,587 INFO L93 Difference]: Finished difference Result 35930 states and 48669 transitions. [2019-09-10 07:12:50,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:12:50,587 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2019-09-10 07:12:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:50,618 INFO L225 Difference]: With dead ends: 35930 [2019-09-10 07:12:50,619 INFO L226 Difference]: Without dead ends: 35930 [2019-09-10 07:12:50,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:12:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35930 states. [2019-09-10 07:12:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35930 to 21079. [2019-09-10 07:12:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21079 states. [2019-09-10 07:12:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21079 states to 21079 states and 28302 transitions. [2019-09-10 07:12:50,818 INFO L78 Accepts]: Start accepts. Automaton has 21079 states and 28302 transitions. Word has length 103 [2019-09-10 07:12:50,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:50,818 INFO L475 AbstractCegarLoop]: Abstraction has 21079 states and 28302 transitions. [2019-09-10 07:12:50,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:12:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 21079 states and 28302 transitions. [2019-09-10 07:12:50,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:12:50,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:50,831 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] [2019-09-10 07:12:50,831 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:50,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:50,831 INFO L82 PathProgramCache]: Analyzing trace with hash 762770378, now seen corresponding path program 1 times [2019-09-10 07:12:50,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:50,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:50,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:50,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:50,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:51,640 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-10 07:12:51,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:51,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:12:51,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:51,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:12:51,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:12:51,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:12:51,641 INFO L87 Difference]: Start difference. First operand 21079 states and 28302 transitions. Second operand 17 states. [2019-09-10 07:12:52,302 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-10 07:12:52,684 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 07:12:54,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:54,529 INFO L93 Difference]: Finished difference Result 41279 states and 55867 transitions. [2019-09-10 07:12:54,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:12:54,529 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-10 07:12:54,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:54,569 INFO L225 Difference]: With dead ends: 41279 [2019-09-10 07:12:54,569 INFO L226 Difference]: Without dead ends: 41279 [2019-09-10 07:12:54,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:12:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41279 states. [2019-09-10 07:12:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41279 to 21079. [2019-09-10 07:12:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21079 states. [2019-09-10 07:12:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21079 states to 21079 states and 28300 transitions. [2019-09-10 07:12:54,800 INFO L78 Accepts]: Start accepts. Automaton has 21079 states and 28300 transitions. Word has length 103 [2019-09-10 07:12:54,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:54,800 INFO L475 AbstractCegarLoop]: Abstraction has 21079 states and 28300 transitions. [2019-09-10 07:12:54,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:12:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 21079 states and 28300 transitions. [2019-09-10 07:12:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:12:54,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:54,814 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] [2019-09-10 07:12:54,814 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:54,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:54,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1035458656, now seen corresponding path program 1 times [2019-09-10 07:12:54,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:54,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:54,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:54,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:54,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:55,669 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-10 07:12:55,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:55,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 07:12:55,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:55,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:12:55,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:12:55,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-10 07:12:55,670 INFO L87 Difference]: Start difference. First operand 21079 states and 28300 transitions. Second operand 17 states. [2019-09-10 07:12:57,215 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 07:12:57,451 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-09-10 07:12:58,010 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-10 07:12:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:58,843 INFO L93 Difference]: Finished difference Result 29110 states and 39202 transitions. [2019-09-10 07:12:58,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 07:12:58,844 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 07:12:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:58,894 INFO L225 Difference]: With dead ends: 29110 [2019-09-10 07:12:58,894 INFO L226 Difference]: Without dead ends: 29106 [2019-09-10 07:12:58,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:12:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29106 states. [2019-09-10 07:12:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29106 to 21064. [2019-09-10 07:12:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21064 states. [2019-09-10 07:12:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21064 states to 21064 states and 28283 transitions. [2019-09-10 07:12:59,179 INFO L78 Accepts]: Start accepts. Automaton has 21064 states and 28283 transitions. Word has length 104 [2019-09-10 07:12:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:59,179 INFO L475 AbstractCegarLoop]: Abstraction has 21064 states and 28283 transitions. [2019-09-10 07:12:59,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:12:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 21064 states and 28283 transitions. [2019-09-10 07:12:59,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:12:59,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:59,193 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] [2019-09-10 07:12:59,193 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:59,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:59,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1826192824, now seen corresponding path program 1 times [2019-09-10 07:12:59,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:59,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:59,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:59,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:59,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:12:59,268 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-10 07:12:59,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:12:59,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:12:59,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:12:59,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:12:59,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:12:59,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:12:59,269 INFO L87 Difference]: Start difference. First operand 21064 states and 28283 transitions. Second operand 3 states. [2019-09-10 07:12:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:59,410 INFO L93 Difference]: Finished difference Result 37752 states and 50775 transitions. [2019-09-10 07:12:59,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:12:59,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 07:12:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:59,470 INFO L225 Difference]: With dead ends: 37752 [2019-09-10 07:12:59,471 INFO L226 Difference]: Without dead ends: 37752 [2019-09-10 07:12:59,471 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-10 07:12:59,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37752 states. [2019-09-10 07:12:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37752 to 37750. [2019-09-10 07:12:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37750 states. [2019-09-10 07:12:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37750 states to 37750 states and 50774 transitions. [2019-09-10 07:12:59,892 INFO L78 Accepts]: Start accepts. Automaton has 37750 states and 50774 transitions. Word has length 108 [2019-09-10 07:12:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:12:59,892 INFO L475 AbstractCegarLoop]: Abstraction has 37750 states and 50774 transitions. [2019-09-10 07:12:59,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:12:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 37750 states and 50774 transitions. [2019-09-10 07:12:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:12:59,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:12:59,914 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] [2019-09-10 07:12:59,914 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:12:59,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:12:59,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1466411473, now seen corresponding path program 1 times [2019-09-10 07:12:59,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:12:59,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:59,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:12:59,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:12:59,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:12:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:00,030 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-10 07:13:00,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:00,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:13:00,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:00,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:13:00,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:13:00,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:00,032 INFO L87 Difference]: Start difference. First operand 37750 states and 50774 transitions. Second operand 7 states. [2019-09-10 07:13:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:00,442 INFO L93 Difference]: Finished difference Result 44905 states and 60210 transitions. [2019-09-10 07:13:00,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:13:00,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2019-09-10 07:13:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:00,482 INFO L225 Difference]: With dead ends: 44905 [2019-09-10 07:13:00,483 INFO L226 Difference]: Without dead ends: 44832 [2019-09-10 07:13:00,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:00,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44832 states. [2019-09-10 07:13:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44832 to 43424. [2019-09-10 07:13:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43424 states. [2019-09-10 07:13:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43424 states to 43424 states and 58353 transitions. [2019-09-10 07:13:00,878 INFO L78 Accepts]: Start accepts. Automaton has 43424 states and 58353 transitions. Word has length 109 [2019-09-10 07:13:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:00,879 INFO L475 AbstractCegarLoop]: Abstraction has 43424 states and 58353 transitions. [2019-09-10 07:13:00,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:13:00,879 INFO L276 IsEmpty]: Start isEmpty. Operand 43424 states and 58353 transitions. [2019-09-10 07:13:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:13:00,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:00,902 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] [2019-09-10 07:13:00,902 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:00,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:00,902 INFO L82 PathProgramCache]: Analyzing trace with hash -633188140, now seen corresponding path program 1 times [2019-09-10 07:13:00,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:00,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:00,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:00,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:00,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:01,014 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-10 07:13:01,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:01,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:13:01,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:01,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:13:01,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:13:01,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:13:01,016 INFO L87 Difference]: Start difference. First operand 43424 states and 58353 transitions. Second operand 6 states. [2019-09-10 07:13:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:01,358 INFO L93 Difference]: Finished difference Result 101623 states and 136306 transitions. [2019-09-10 07:13:01,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:13:01,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2019-09-10 07:13:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:01,464 INFO L225 Difference]: With dead ends: 101623 [2019-09-10 07:13:01,464 INFO L226 Difference]: Without dead ends: 101623 [2019-09-10 07:13:01,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:13:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101623 states. [2019-09-10 07:13:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101623 to 44414. [2019-09-10 07:13:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44414 states. [2019-09-10 07:13:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44414 states to 44414 states and 59343 transitions. [2019-09-10 07:13:02,107 INFO L78 Accepts]: Start accepts. Automaton has 44414 states and 59343 transitions. Word has length 110 [2019-09-10 07:13:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:02,107 INFO L475 AbstractCegarLoop]: Abstraction has 44414 states and 59343 transitions. [2019-09-10 07:13:02,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:13:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 44414 states and 59343 transitions. [2019-09-10 07:13:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:13:02,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:02,136 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] [2019-09-10 07:13:02,136 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:02,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2032517296, now seen corresponding path program 1 times [2019-09-10 07:13:02,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:02,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:02,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:02,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:02,217 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-10 07:13:02,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:02,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:02,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:02,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:02,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:02,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:02,218 INFO L87 Difference]: Start difference. First operand 44414 states and 59343 transitions. Second operand 3 states. [2019-09-10 07:13:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:02,401 INFO L93 Difference]: Finished difference Result 80954 states and 107882 transitions. [2019-09-10 07:13:02,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:02,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 07:13:02,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:02,487 INFO L225 Difference]: With dead ends: 80954 [2019-09-10 07:13:02,487 INFO L226 Difference]: Without dead ends: 80954 [2019-09-10 07:13:02,487 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-10 07:13:02,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80954 states. [2019-09-10 07:13:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80954 to 75760. [2019-09-10 07:13:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75760 states. [2019-09-10 07:13:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75760 states to 75760 states and 101317 transitions. [2019-09-10 07:13:03,121 INFO L78 Accepts]: Start accepts. Automaton has 75760 states and 101317 transitions. Word has length 111 [2019-09-10 07:13:03,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:03,121 INFO L475 AbstractCegarLoop]: Abstraction has 75760 states and 101317 transitions. [2019-09-10 07:13:03,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 75760 states and 101317 transitions. [2019-09-10 07:13:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:13:03,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:03,140 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] [2019-09-10 07:13:03,141 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:03,141 INFO L82 PathProgramCache]: Analyzing trace with hash 888304002, now seen corresponding path program 1 times [2019-09-10 07:13:03,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:03,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:03,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:03,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:03,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:03,198 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-10 07:13:03,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:03,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:03,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:03,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:03,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:03,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:03,199 INFO L87 Difference]: Start difference. First operand 75760 states and 101317 transitions. Second operand 3 states. [2019-09-10 07:13:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:03,543 INFO L93 Difference]: Finished difference Result 142014 states and 188850 transitions. [2019-09-10 07:13:03,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:03,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-10 07:13:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:04,028 INFO L225 Difference]: With dead ends: 142014 [2019-09-10 07:13:04,028 INFO L226 Difference]: Without dead ends: 140162 [2019-09-10 07:13:04,028 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-10 07:13:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140162 states. [2019-09-10 07:13:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140162 to 133099. [2019-09-10 07:13:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133099 states. [2019-09-10 07:13:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133099 states to 133099 states and 177514 transitions. [2019-09-10 07:13:05,067 INFO L78 Accepts]: Start accepts. Automaton has 133099 states and 177514 transitions. Word has length 112 [2019-09-10 07:13:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:05,067 INFO L475 AbstractCegarLoop]: Abstraction has 133099 states and 177514 transitions. [2019-09-10 07:13:05,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 133099 states and 177514 transitions. [2019-09-10 07:13:05,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 07:13:05,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:05,087 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] [2019-09-10 07:13:05,088 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:05,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:05,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1002831134, now seen corresponding path program 1 times [2019-09-10 07:13:05,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:05,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:05,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:05,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:05,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:05,152 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-10 07:13:05,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:05,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:05,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:05,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:05,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:05,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:05,153 INFO L87 Difference]: Start difference. First operand 133099 states and 177514 transitions. Second operand 3 states. [2019-09-10 07:13:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:05,726 INFO L93 Difference]: Finished difference Result 250916 states and 331745 transitions. [2019-09-10 07:13:05,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:05,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-10 07:13:05,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:06,023 INFO L225 Difference]: With dead ends: 250916 [2019-09-10 07:13:06,023 INFO L226 Difference]: Without dead ends: 248188 [2019-09-10 07:13:06,024 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-10 07:13:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248188 states. [2019-09-10 07:13:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248188 to 233103. [2019-09-10 07:13:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233103 states. [2019-09-10 07:13:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233103 states to 233103 states and 309234 transitions. [2019-09-10 07:13:11,225 INFO L78 Accepts]: Start accepts. Automaton has 233103 states and 309234 transitions. Word has length 113 [2019-09-10 07:13:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:11,225 INFO L475 AbstractCegarLoop]: Abstraction has 233103 states and 309234 transitions. [2019-09-10 07:13:11,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 233103 states and 309234 transitions. [2019-09-10 07:13:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 07:13:11,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:11,241 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] [2019-09-10 07:13:11,241 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:11,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:11,242 INFO L82 PathProgramCache]: Analyzing trace with hash -996980157, now seen corresponding path program 1 times [2019-09-10 07:13:11,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:11,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:11,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:11,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:11,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:11,335 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-10 07:13:11,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:11,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:11,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:11,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:11,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:11,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:11,337 INFO L87 Difference]: Start difference. First operand 233103 states and 309234 transitions. Second operand 3 states. [2019-09-10 07:13:12,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:12,467 INFO L93 Difference]: Finished difference Result 430784 states and 565403 transitions. [2019-09-10 07:13:12,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:12,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 07:13:12,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:12,960 INFO L225 Difference]: With dead ends: 430784 [2019-09-10 07:13:12,961 INFO L226 Difference]: Without dead ends: 430121 [2019-09-10 07:13:12,961 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-10 07:13:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430121 states. [2019-09-10 07:13:21,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430121 to 404432. [2019-09-10 07:13:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404432 states. [2019-09-10 07:13:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404432 states to 404432 states and 533083 transitions. [2019-09-10 07:13:21,855 INFO L78 Accepts]: Start accepts. Automaton has 404432 states and 533083 transitions. Word has length 114 [2019-09-10 07:13:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:21,855 INFO L475 AbstractCegarLoop]: Abstraction has 404432 states and 533083 transitions. [2019-09-10 07:13:21,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 404432 states and 533083 transitions. [2019-09-10 07:13:21,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 07:13:21,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:21,869 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] [2019-09-10 07:13:21,869 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:21,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:21,870 INFO L82 PathProgramCache]: Analyzing trace with hash 280753438, now seen corresponding path program 1 times [2019-09-10 07:13:21,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:21,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:21,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:21,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:21,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:21,928 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-10 07:13:21,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:21,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:21,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:21,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:21,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:21,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:21,929 INFO L87 Difference]: Start difference. First operand 404432 states and 533083 transitions. Second operand 3 states. [2019-09-10 07:13:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:23,341 INFO L93 Difference]: Finished difference Result 771081 states and 998180 transitions. [2019-09-10 07:13:23,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:23,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 07:13:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:32,276 INFO L225 Difference]: With dead ends: 771081 [2019-09-10 07:13:32,276 INFO L226 Difference]: Without dead ends: 771081 [2019-09-10 07:13:32,276 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-10 07:13:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771081 states. [2019-09-10 07:13:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771081 to 736144. [2019-09-10 07:13:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736144 states. [2019-09-10 07:13:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736144 states to 736144 states and 954491 transitions. [2019-09-10 07:13:50,638 INFO L78 Accepts]: Start accepts. Automaton has 736144 states and 954491 transitions. Word has length 117 [2019-09-10 07:13:50,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:50,638 INFO L475 AbstractCegarLoop]: Abstraction has 736144 states and 954491 transitions. [2019-09-10 07:13:50,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:50,638 INFO L276 IsEmpty]: Start isEmpty. Operand 736144 states and 954491 transitions. [2019-09-10 07:13:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 07:13:50,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:50,648 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] [2019-09-10 07:13:50,648 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:50,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:50,649 INFO L82 PathProgramCache]: Analyzing trace with hash 64423747, now seen corresponding path program 1 times [2019-09-10 07:13:50,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:50,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:50,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:50,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:50,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:50,725 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-10 07:13:50,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:50,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:50,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:50,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:50,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:50,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:50,727 INFO L87 Difference]: Start difference. First operand 736144 states and 954491 transitions. Second operand 3 states. [2019-09-10 07:14:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:02,306 INFO L93 Difference]: Finished difference Result 1087716 states and 1392477 transitions. [2019-09-10 07:14:02,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:14:02,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 07:14:02,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:03,581 INFO L225 Difference]: With dead ends: 1087716 [2019-09-10 07:14:03,581 INFO L226 Difference]: Without dead ends: 1087002 [2019-09-10 07:14:03,582 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-10 07:14:04,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087002 states. [2019-09-10 07:14:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087002 to 1085272. [2019-09-10 07:14:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1085272 states. [2019-09-10 07:14:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085272 states to 1085272 states and 1389299 transitions. [2019-09-10 07:14:37,235 INFO L78 Accepts]: Start accepts. Automaton has 1085272 states and 1389299 transitions. Word has length 117 [2019-09-10 07:14:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:37,235 INFO L475 AbstractCegarLoop]: Abstraction has 1085272 states and 1389299 transitions. [2019-09-10 07:14:37,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:37,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1085272 states and 1389299 transitions. [2019-09-10 07:14:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 07:14:37,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:37,304 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:14:37,305 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:37,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:37,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1558340344, now seen corresponding path program 1 times [2019-09-10 07:14:37,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:37,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:37,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:37,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:37,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 07:14:37,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:14:37,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:14:37,447 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-09-10 07:14:37,449 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [106], [189], [192], [195], [208], [211], [224], [227], [240], [243], [256], [259], [272], [275], [278], [282], [284], [287], [290], [301], [303], [306], [317], [319], [322], [333], [335], [338], [349], [351], [353], [356], [367], [369], [371], [374], [377], [379], [381], [384], [385], [387], [389], [391], [396], [409], [411], [424], [432], [451], [462], [464], [477], [485], [504], [515], [517], [530], [538], [557], [568], [570], [573], [576], [579], [581], [583], [621], [623], [636], [644], [672], [730], [844], [1078], [1512], [4131], [4135], [4138], [4141], [4144], [4146], [4150], [4730], [4744], [4748], [4886], [4964], [4968], [4998], [5014], [5017], [5020], [5024], [5028], [6850], [6851], [6855], [6856], [6857] [2019-09-10 07:14:37,494 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:14:37,495 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:14:37,802 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:14:48,855 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:14:48,858 INFO L272 AbstractInterpreter]: Visited 135 different actions 824 times. Merged at 55 different actions 607 times. Widened at 21 different actions 103 times. Performed 3205 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3205 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 86 fixpoints after 17 different actions. Largest state had 495 variables. [2019-09-10 07:14:48,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:48,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:14:48,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:14:48,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10 07:14:48,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:48,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:14:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:49,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 2666 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:14:49,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:14:49,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:14:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:49,749 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:14:49,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:14:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:50,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:14:50,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 21 [2019-09-10 07:14:50,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:14:50,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:14:50,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:14:50,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:14:50,162 INFO L87 Difference]: Start difference. First operand 1085272 states and 1389299 transitions. Second operand 13 states. [2019-09-10 07:15:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:30,153 INFO L93 Difference]: Finished difference Result 3764145 states and 4783619 transitions. [2019-09-10 07:15:30,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 07:15:30,153 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 147 [2019-09-10 07:15:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:37,698 INFO L225 Difference]: With dead ends: 3764145 [2019-09-10 07:15:37,698 INFO L226 Difference]: Without dead ends: 3753461 [2019-09-10 07:15:37,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1524, Invalid=5118, Unknown=0, NotChecked=0, Total=6642 [2019-09-10 07:15:39,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753461 states.