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/product-lines/elevator_spec2_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:42:05,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:42:05,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:42:05,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:42:05,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:42:05,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:42:05,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:42:05,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:42:05,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:42:05,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:42:05,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:42:05,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:42:05,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:42:05,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:42:05,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:42:05,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:42:05,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:42:05,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:42:05,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:42:05,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:42:05,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:42:05,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:42:05,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:42:05,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:42:05,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:42:05,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:42:05,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:42:05,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:42:05,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:42:05,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:42:05,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:42:05,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:42:05,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:42:05,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:42:05,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:42:05,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:42:05,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:42:05,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:42:05,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:42:05,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:42:05,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:42:05,772 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-10-03 02:42:05,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:42:05,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:42:05,788 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:42:05,789 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:42:05,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:42:05,790 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:42:05,790 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:42:05,790 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:42:05,790 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:42:05,791 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:42:05,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:42:05,792 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:42:05,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:42:05,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:42:05,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:42:05,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:42:05,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:42:05,793 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:42:05,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:42:05,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:42:05,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:42:05,794 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:42:05,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:42:05,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:42:05,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:42:05,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:42:05,795 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:42:05,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:42:05,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:42:05,796 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:42:05,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:42:05,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:42:05,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:42:05,846 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:42:05,847 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:42:05,847 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product25.cil.c [2019-10-03 02:42:05,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a45ee2b85/ad1f701fce184a659e4b404a8c3ced77/FLAG800e9b629 [2019-10-03 02:42:06,664 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:42:06,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product25.cil.c [2019-10-03 02:42:06,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a45ee2b85/ad1f701fce184a659e4b404a8c3ced77/FLAG800e9b629 [2019-10-03 02:42:06,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a45ee2b85/ad1f701fce184a659e4b404a8c3ced77 [2019-10-03 02:42:06,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:42:06,888 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:42:06,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:42:06,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:42:06,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:42:06,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:42:06" (1/1) ... [2019-10-03 02:42:06,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709a20b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:42:06, skipping insertion in model container [2019-10-03 02:42:06,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:42:06" (1/1) ... [2019-10-03 02:42:06,910 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:42:07,010 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:42:07,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:42:07,860 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:42:07,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:42:08,055 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:42:08,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:42:08 WrapperNode [2019-10-03 02:42:08,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:42:08,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:42:08,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:42:08,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:42:08,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:42:08" (1/1) ... [2019-10-03 02:42:08,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:42:08" (1/1) ... [2019-10-03 02:42:08,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:42:08" (1/1) ... [2019-10-03 02:42:08,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:42:08" (1/1) ... [2019-10-03 02:42:08,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:42:08" (1/1) ... [2019-10-03 02:42:08,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:42:08" (1/1) ... [2019-10-03 02:42:08,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:42:08" (1/1) ... [2019-10-03 02:42:08,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:42:08,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:42:08,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:42:08,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:42:08,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:42:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:42:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:42:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:42:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:42:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:42:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:42:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:42:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:42:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:42:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:42:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:42:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:42:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:42:08,351 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:42:08,351 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:42:08,351 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:42:08,351 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:42:08,352 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:42:08,352 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:42:08,352 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-03 02:42:08,352 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:42:08,352 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:42:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:42:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:42:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:42:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:42:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:42:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:42:08,354 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:42:08,354 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:42:08,354 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:42:08,354 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:42:08,354 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:42:08,354 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:42:08,355 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:42:08,355 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:42:08,355 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:42:08,355 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:42:08,355 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:42:08,355 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:42:08,356 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:42:08,356 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:42:08,356 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:42:08,356 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:42:08,356 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:42:08,357 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:42:08,357 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:42:08,357 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:42:08,357 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:42:08,357 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:42:08,357 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:42:08,357 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:42:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:42:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:42:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:42:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:42:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:42:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:42:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:42:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:42:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:42:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:42:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:42:08,359 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:42:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:42:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:42:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:42:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:42:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:42:08,360 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:42:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:42:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:42:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:42:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:42:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:42:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:42:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:42:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:42:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:42:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:42:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:42:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:42:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:42:08,362 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:42:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:42:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:42:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:42:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:42:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:42:08,363 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:42:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:42:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:42:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:42:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:42:08,364 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:42:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:42:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:42:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:42:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:42:08,365 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:42:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:42:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:42:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:42:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:42:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:42:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:42:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:42:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:42:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:42:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:42:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:42:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:42:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:42:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-03 02:42:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:42:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:42:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:42:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:42:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:42:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:42:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:42:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:42:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:42:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:42:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:42:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:42:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:42:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:42:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:42:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:42:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:42:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:42:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:42:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:42:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:42:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:42:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:42:08,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:42:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:42:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:42:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:42:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:42:08,373 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:42:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:42:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:42:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:42:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:42:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:42:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:42:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:42:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:42:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:42:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:42:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:42:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:42:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:42:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:42:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:42:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:42:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:42:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:42:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:42:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:42:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:42:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:42:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:42:10,951 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:42:10,951 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:42:10,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:42:10 BoogieIcfgContainer [2019-10-03 02:42:10,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:42:10,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:42:10,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:42:10,959 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:42:10,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:42:06" (1/3) ... [2019-10-03 02:42:10,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3cdf7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:42:10, skipping insertion in model container [2019-10-03 02:42:10,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:42:08" (2/3) ... [2019-10-03 02:42:10,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3cdf7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:42:10, skipping insertion in model container [2019-10-03 02:42:10,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:42:10" (3/3) ... [2019-10-03 02:42:10,964 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product25.cil.c [2019-10-03 02:42:10,977 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:42:10,991 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:42:11,012 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:42:11,050 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:42:11,050 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:42:11,050 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:42:11,051 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:42:11,051 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:42:11,051 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:42:11,051 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:42:11,051 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:42:11,101 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2019-10-03 02:42:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-03 02:42:11,151 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:11,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:11,157 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:11,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:11,166 INFO L82 PathProgramCache]: Analyzing trace with hash -517241816, now seen corresponding path program 1 times [2019-10-03 02:42:11,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:11,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:11,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:11,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:11,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:11,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:11,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:11,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:42:11,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:11,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:42:11,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:42:11,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:42:11,892 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 4 states. [2019-10-03 02:42:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:12,137 INFO L93 Difference]: Finished difference Result 609 states and 972 transitions. [2019-10-03 02:42:12,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:42:12,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-03 02:42:12,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:12,179 INFO L225 Difference]: With dead ends: 609 [2019-10-03 02:42:12,179 INFO L226 Difference]: Without dead ends: 598 [2019-10-03 02:42:12,183 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:42:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-03 02:42:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-03 02:42:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-03 02:42:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 960 transitions. [2019-10-03 02:42:12,373 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 960 transitions. Word has length 107 [2019-10-03 02:42:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:12,373 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 960 transitions. [2019-10-03 02:42:12,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:42:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 960 transitions. [2019-10-03 02:42:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-03 02:42:12,380 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:12,380 INFO L411 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-10-03 02:42:12,381 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:12,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:12,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1593007226, now seen corresponding path program 1 times [2019-10-03 02:42:12,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:12,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:12,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:12,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:12,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:12,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:12,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:42:12,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:12,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:42:12,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:42:12,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:42:12,652 INFO L87 Difference]: Start difference. First operand 598 states and 960 transitions. Second operand 4 states. [2019-10-03 02:42:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:12,748 INFO L93 Difference]: Finished difference Result 600 states and 961 transitions. [2019-10-03 02:42:12,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:42:12,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-03 02:42:12,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:12,759 INFO L225 Difference]: With dead ends: 600 [2019-10-03 02:42:12,759 INFO L226 Difference]: Without dead ends: 598 [2019-10-03 02:42:12,761 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:42:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-03 02:42:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-03 02:42:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-03 02:42:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 959 transitions. [2019-10-03 02:42:12,816 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 959 transitions. Word has length 110 [2019-10-03 02:42:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:12,818 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 959 transitions. [2019-10-03 02:42:12,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:42:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 959 transitions. [2019-10-03 02:42:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 02:42:12,832 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:12,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:12,835 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:12,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:12,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2107821335, now seen corresponding path program 1 times [2019-10-03 02:42:12,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:12,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:12,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:12,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:13,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:13,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:42:13,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:13,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:42:13,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:42:13,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:42:13,109 INFO L87 Difference]: Start difference. First operand 598 states and 959 transitions. Second operand 4 states. [2019-10-03 02:42:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:13,183 INFO L93 Difference]: Finished difference Result 600 states and 960 transitions. [2019-10-03 02:42:13,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:42:13,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-03 02:42:13,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:13,192 INFO L225 Difference]: With dead ends: 600 [2019-10-03 02:42:13,193 INFO L226 Difference]: Without dead ends: 598 [2019-10-03 02:42:13,193 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:42:13,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-03 02:42:13,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-03 02:42:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-03 02:42:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 958 transitions. [2019-10-03 02:42:13,232 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 958 transitions. Word has length 111 [2019-10-03 02:42:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:13,232 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 958 transitions. [2019-10-03 02:42:13,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:42:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 958 transitions. [2019-10-03 02:42:13,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 02:42:13,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:13,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:13,239 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:13,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:13,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1729710442, now seen corresponding path program 1 times [2019-10-03 02:42:13,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:13,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:13,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:13,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:13,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:13,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-10-03 02:42:13,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:13,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:42:13,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:13,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:42:13,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:42:13,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:42:13,451 INFO L87 Difference]: Start difference. First operand 598 states and 958 transitions. Second operand 4 states. [2019-10-03 02:42:13,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:13,521 INFO L93 Difference]: Finished difference Result 600 states and 959 transitions. [2019-10-03 02:42:13,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:42:13,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-03 02:42:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:13,531 INFO L225 Difference]: With dead ends: 600 [2019-10-03 02:42:13,532 INFO L226 Difference]: Without dead ends: 598 [2019-10-03 02:42:13,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:42:13,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-03 02:42:13,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-03 02:42:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-03 02:42:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 957 transitions. [2019-10-03 02:42:13,562 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 957 transitions. Word has length 112 [2019-10-03 02:42:13,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:13,564 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 957 transitions. [2019-10-03 02:42:13,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:42:13,564 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 957 transitions. [2019-10-03 02:42:13,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 02:42:13,568 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:13,568 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:13,569 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:13,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:13,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1243956083, now seen corresponding path program 1 times [2019-10-03 02:42:13,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:13,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:13,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:13,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:13,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:13,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:13,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:42:13,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:13,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:42:13,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:42:13,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:42:13,729 INFO L87 Difference]: Start difference. First operand 598 states and 957 transitions. Second operand 4 states. [2019-10-03 02:42:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:13,784 INFO L93 Difference]: Finished difference Result 600 states and 958 transitions. [2019-10-03 02:42:13,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:42:13,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-03 02:42:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:13,797 INFO L225 Difference]: With dead ends: 600 [2019-10-03 02:42:13,798 INFO L226 Difference]: Without dead ends: 598 [2019-10-03 02:42:13,798 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:42:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-03 02:42:13,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-03 02:42:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-03 02:42:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 956 transitions. [2019-10-03 02:42:13,821 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 956 transitions. Word has length 113 [2019-10-03 02:42:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:13,821 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 956 transitions. [2019-10-03 02:42:13,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:42:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 956 transitions. [2019-10-03 02:42:13,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 02:42:13,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:13,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:13,828 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:13,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:13,828 INFO L82 PathProgramCache]: Analyzing trace with hash 616405170, now seen corresponding path program 1 times [2019-10-03 02:42:13,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:13,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:13,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:13,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:13,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:14,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:14,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:42:14,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:14,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:42:14,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:42:14,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:42:14,059 INFO L87 Difference]: Start difference. First operand 598 states and 956 transitions. Second operand 10 states. [2019-10-03 02:42:14,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:14,231 INFO L93 Difference]: Finished difference Result 607 states and 967 transitions. [2019-10-03 02:42:14,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:42:14,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-03 02:42:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:14,243 INFO L225 Difference]: With dead ends: 607 [2019-10-03 02:42:14,244 INFO L226 Difference]: Without dead ends: 607 [2019-10-03 02:42:14,245 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:42:14,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-03 02:42:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 605. [2019-10-03 02:42:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-03 02:42:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 965 transitions. [2019-10-03 02:42:14,290 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 965 transitions. Word has length 114 [2019-10-03 02:42:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:14,291 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 965 transitions. [2019-10-03 02:42:14,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:42:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 965 transitions. [2019-10-03 02:42:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 02:42:14,299 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:14,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:14,300 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:14,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1035922001, now seen corresponding path program 1 times [2019-10-03 02:42:14,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:14,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:14,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:14,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:14,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:14,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:14,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:42:14,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:14,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:42:14,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:42:14,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:42:14,432 INFO L87 Difference]: Start difference. First operand 605 states and 965 transitions. Second operand 4 states. [2019-10-03 02:42:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:14,497 INFO L93 Difference]: Finished difference Result 603 states and 960 transitions. [2019-10-03 02:42:14,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:42:14,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-03 02:42:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:14,505 INFO L225 Difference]: With dead ends: 603 [2019-10-03 02:42:14,506 INFO L226 Difference]: Without dead ends: 592 [2019-10-03 02:42:14,506 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:42:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-03 02:42:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-03 02:42:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-03 02:42:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 942 transitions. [2019-10-03 02:42:14,533 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 942 transitions. Word has length 114 [2019-10-03 02:42:14,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:14,534 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 942 transitions. [2019-10-03 02:42:14,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:42:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 942 transitions. [2019-10-03 02:42:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-03 02:42:14,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:14,539 INFO L411 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] [2019-10-03 02:42:14,539 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:14,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1806095573, now seen corresponding path program 1 times [2019-10-03 02:42:14,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:14,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:14,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:14,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:14,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:14,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:14,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:42:14,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:14,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:42:14,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:42:14,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:42:14,719 INFO L87 Difference]: Start difference. First operand 592 states and 942 transitions. Second operand 6 states. [2019-10-03 02:42:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:14,967 INFO L93 Difference]: Finished difference Result 595 states and 945 transitions. [2019-10-03 02:42:14,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:42:14,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-03 02:42:14,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:14,973 INFO L225 Difference]: With dead ends: 595 [2019-10-03 02:42:14,974 INFO L226 Difference]: Without dead ends: 592 [2019-10-03 02:42:14,974 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:42:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-03 02:42:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-03 02:42:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-03 02:42:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 938 transitions. [2019-10-03 02:42:14,998 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 938 transitions. Word has length 115 [2019-10-03 02:42:14,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:14,999 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 938 transitions. [2019-10-03 02:42:14,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:42:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 938 transitions. [2019-10-03 02:42:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 02:42:15,004 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:15,004 INFO L411 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] [2019-10-03 02:42:15,004 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:15,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:15,005 INFO L82 PathProgramCache]: Analyzing trace with hash 36368181, now seen corresponding path program 1 times [2019-10-03 02:42:15,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:15,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:15,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:15,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:15,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:15,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:15,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:42:15,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:15,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:42:15,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:42:15,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:42:15,151 INFO L87 Difference]: Start difference. First operand 592 states and 938 transitions. Second operand 6 states. [2019-10-03 02:42:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:15,364 INFO L93 Difference]: Finished difference Result 595 states and 941 transitions. [2019-10-03 02:42:15,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:42:15,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-10-03 02:42:15,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:15,370 INFO L225 Difference]: With dead ends: 595 [2019-10-03 02:42:15,370 INFO L226 Difference]: Without dead ends: 592 [2019-10-03 02:42:15,371 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:42:15,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-03 02:42:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-03 02:42:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-03 02:42:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 934 transitions. [2019-10-03 02:42:15,391 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 934 transitions. Word has length 116 [2019-10-03 02:42:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:15,392 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 934 transitions. [2019-10-03 02:42:15,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:42:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 934 transitions. [2019-10-03 02:42:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-03 02:42:15,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:15,396 INFO L411 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-10-03 02:42:15,396 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:15,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:15,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1408982758, now seen corresponding path program 1 times [2019-10-03 02:42:15,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:15,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:15,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:15,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:15,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:15,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:42:15,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:15,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:42:15,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:42:15,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:42:15,536 INFO L87 Difference]: Start difference. First operand 592 states and 934 transitions. Second operand 6 states. [2019-10-03 02:42:15,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:15,837 INFO L93 Difference]: Finished difference Result 595 states and 937 transitions. [2019-10-03 02:42:15,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:42:15,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-03 02:42:15,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:15,846 INFO L225 Difference]: With dead ends: 595 [2019-10-03 02:42:15,846 INFO L226 Difference]: Without dead ends: 592 [2019-10-03 02:42:15,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:42:15,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-03 02:42:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-03 02:42:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-03 02:42:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 930 transitions. [2019-10-03 02:42:15,869 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 930 transitions. Word has length 117 [2019-10-03 02:42:15,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:15,870 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 930 transitions. [2019-10-03 02:42:15,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:42:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 930 transitions. [2019-10-03 02:42:15,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-03 02:42:15,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:15,874 INFO L411 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-10-03 02:42:15,874 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:15,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:15,875 INFO L82 PathProgramCache]: Analyzing trace with hash -954122854, now seen corresponding path program 1 times [2019-10-03 02:42:15,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:15,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:15,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:15,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:15,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:16,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:16,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:42:16,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:16,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:42:16,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:42:16,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:42:16,043 INFO L87 Difference]: Start difference. First operand 592 states and 930 transitions. Second operand 7 states. [2019-10-03 02:42:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:16,117 INFO L93 Difference]: Finished difference Result 595 states and 933 transitions. [2019-10-03 02:42:16,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:42:16,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-03 02:42:16,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:16,123 INFO L225 Difference]: With dead ends: 595 [2019-10-03 02:42:16,123 INFO L226 Difference]: Without dead ends: 571 [2019-10-03 02:42:16,124 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:42:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-03 02:42:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-03 02:42:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-03 02:42:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 896 transitions. [2019-10-03 02:42:16,149 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 896 transitions. Word has length 117 [2019-10-03 02:42:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:16,150 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 896 transitions. [2019-10-03 02:42:16,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:42:16,150 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 896 transitions. [2019-10-03 02:42:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-03 02:42:16,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:16,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:16,154 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:16,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:16,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1388598246, now seen corresponding path program 1 times [2019-10-03 02:42:16,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:16,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:16,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:16,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:16,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:16,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:16,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:42:16,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:16,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:42:16,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:42:16,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:42:16,293 INFO L87 Difference]: Start difference. First operand 571 states and 896 transitions. Second operand 6 states. [2019-10-03 02:42:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:16,408 INFO L93 Difference]: Finished difference Result 574 states and 899 transitions. [2019-10-03 02:42:16,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:42:16,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-03 02:42:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:16,414 INFO L225 Difference]: With dead ends: 574 [2019-10-03 02:42:16,414 INFO L226 Difference]: Without dead ends: 571 [2019-10-03 02:42:16,414 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:42:16,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-03 02:42:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-03 02:42:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-03 02:42:16,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 895 transitions. [2019-10-03 02:42:16,446 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 895 transitions. Word has length 118 [2019-10-03 02:42:16,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:16,448 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 895 transitions. [2019-10-03 02:42:16,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:42:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 895 transitions. [2019-10-03 02:42:16,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-03 02:42:16,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:16,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:16,452 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:16,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:16,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1119912287, now seen corresponding path program 1 times [2019-10-03 02:42:16,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:16,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:16,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:16,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:16,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:16,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:16,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:42:16,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:16,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:42:16,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:42:16,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:42:16,584 INFO L87 Difference]: Start difference. First operand 571 states and 895 transitions. Second operand 6 states. [2019-10-03 02:42:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:16,681 INFO L93 Difference]: Finished difference Result 574 states and 898 transitions. [2019-10-03 02:42:16,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:42:16,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-03 02:42:16,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:16,687 INFO L225 Difference]: With dead ends: 574 [2019-10-03 02:42:16,687 INFO L226 Difference]: Without dead ends: 571 [2019-10-03 02:42:16,688 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:42:16,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-03 02:42:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-03 02:42:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-03 02:42:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 894 transitions. [2019-10-03 02:42:16,708 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 894 transitions. Word has length 119 [2019-10-03 02:42:16,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:16,709 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 894 transitions. [2019-10-03 02:42:16,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:42:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 894 transitions. [2019-10-03 02:42:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-03 02:42:16,713 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:16,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:16,713 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:16,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:16,714 INFO L82 PathProgramCache]: Analyzing trace with hash -844049153, now seen corresponding path program 1 times [2019-10-03 02:42:16,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:16,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:16,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:16,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:16,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:16,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-10-03 02:42:16,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:16,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:42:16,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:16,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:42:16,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:42:16,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:42:16,971 INFO L87 Difference]: Start difference. First operand 571 states and 894 transitions. Second operand 12 states. [2019-10-03 02:42:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:17,153 INFO L93 Difference]: Finished difference Result 575 states and 897 transitions. [2019-10-03 02:42:17,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:42:17,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-10-03 02:42:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:17,158 INFO L225 Difference]: With dead ends: 575 [2019-10-03 02:42:17,159 INFO L226 Difference]: Without dead ends: 571 [2019-10-03 02:42:17,159 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:42:17,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-03 02:42:17,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-03 02:42:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-03 02:42:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 893 transitions. [2019-10-03 02:42:17,180 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 893 transitions. Word has length 120 [2019-10-03 02:42:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:17,180 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 893 transitions. [2019-10-03 02:42:17,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:42:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 893 transitions. [2019-10-03 02:42:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-03 02:42:17,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:17,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:17,185 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:17,185 INFO L82 PathProgramCache]: Analyzing trace with hash 704955672, now seen corresponding path program 1 times [2019-10-03 02:42:17,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:17,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:17,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:17,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:17,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:17,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:17,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:42:17,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:17,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:42:17,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:42:17,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:42:17,359 INFO L87 Difference]: Start difference. First operand 571 states and 893 transitions. Second operand 9 states. [2019-10-03 02:42:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:21,602 INFO L93 Difference]: Finished difference Result 577 states and 914 transitions. [2019-10-03 02:42:21,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:42:21,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-10-03 02:42:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:21,608 INFO L225 Difference]: With dead ends: 577 [2019-10-03 02:42:21,608 INFO L226 Difference]: Without dead ends: 577 [2019-10-03 02:42:21,609 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:42:21,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-03 02:42:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2019-10-03 02:42:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-03 02:42:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 912 transitions. [2019-10-03 02:42:21,632 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 912 transitions. Word has length 121 [2019-10-03 02:42:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:21,633 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 912 transitions. [2019-10-03 02:42:21,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:42:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 912 transitions. [2019-10-03 02:42:21,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-03 02:42:21,637 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:21,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:21,637 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:21,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:21,638 INFO L82 PathProgramCache]: Analyzing trace with hash 949783563, now seen corresponding path program 1 times [2019-10-03 02:42:21,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:21,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:21,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:21,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:21,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:21,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:21,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:42:21,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:21,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:42:21,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:42:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:42:21,829 INFO L87 Difference]: Start difference. First operand 575 states and 912 transitions. Second operand 8 states. [2019-10-03 02:42:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:28,834 INFO L93 Difference]: Finished difference Result 1517 states and 2418 transitions. [2019-10-03 02:42:28,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 02:42:28,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-03 02:42:28,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:28,869 INFO L225 Difference]: With dead ends: 1517 [2019-10-03 02:42:28,869 INFO L226 Difference]: Without dead ends: 1517 [2019-10-03 02:42:28,870 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:42:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-10-03 02:42:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1478. [2019-10-03 02:42:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2019-10-03 02:42:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2365 transitions. [2019-10-03 02:42:28,969 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2365 transitions. Word has length 122 [2019-10-03 02:42:28,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:28,970 INFO L475 AbstractCegarLoop]: Abstraction has 1478 states and 2365 transitions. [2019-10-03 02:42:28,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:42:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2365 transitions. [2019-10-03 02:42:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 02:42:28,977 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:28,978 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:28,978 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:28,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:28,979 INFO L82 PathProgramCache]: Analyzing trace with hash 360253614, now seen corresponding path program 1 times [2019-10-03 02:42:28,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:28,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:28,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:28,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:28,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:29,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:29,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:42:29,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:29,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:42:29,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:42:29,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:42:29,221 INFO L87 Difference]: Start difference. First operand 1478 states and 2365 transitions. Second operand 9 states. [2019-10-03 02:42:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:37,891 INFO L93 Difference]: Finished difference Result 3323 states and 5435 transitions. [2019-10-03 02:42:37,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:42:37,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-10-03 02:42:37,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:37,930 INFO L225 Difference]: With dead ends: 3323 [2019-10-03 02:42:37,931 INFO L226 Difference]: Without dead ends: 3323 [2019-10-03 02:42:37,932 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:42:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2019-10-03 02:42:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3100. [2019-10-03 02:42:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3100 states. [2019-10-03 02:42:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 5020 transitions. [2019-10-03 02:42:38,159 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 5020 transitions. Word has length 128 [2019-10-03 02:42:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:38,159 INFO L475 AbstractCegarLoop]: Abstraction has 3100 states and 5020 transitions. [2019-10-03 02:42:38,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:42:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 5020 transitions. [2019-10-03 02:42:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 02:42:38,165 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:38,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:38,166 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:38,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:38,167 INFO L82 PathProgramCache]: Analyzing trace with hash 352494255, now seen corresponding path program 1 times [2019-10-03 02:42:38,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:38,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:38,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:38,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:38,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:38,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:38,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:42:38,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:38,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:42:38,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:42:38,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:42:38,419 INFO L87 Difference]: Start difference. First operand 3100 states and 5020 transitions. Second operand 7 states. [2019-10-03 02:42:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:43,753 INFO L93 Difference]: Finished difference Result 5720 states and 9352 transitions. [2019-10-03 02:42:43,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:42:43,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-10-03 02:42:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:43,820 INFO L225 Difference]: With dead ends: 5720 [2019-10-03 02:42:43,821 INFO L226 Difference]: Without dead ends: 5720 [2019-10-03 02:42:43,821 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:42:43,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5720 states. [2019-10-03 02:42:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5720 to 5627. [2019-10-03 02:42:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5627 states. [2019-10-03 02:42:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5627 states to 5627 states and 9190 transitions. [2019-10-03 02:42:44,088 INFO L78 Accepts]: Start accepts. Automaton has 5627 states and 9190 transitions. Word has length 128 [2019-10-03 02:42:44,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:44,089 INFO L475 AbstractCegarLoop]: Abstraction has 5627 states and 9190 transitions. [2019-10-03 02:42:44,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:42:44,089 INFO L276 IsEmpty]: Start isEmpty. Operand 5627 states and 9190 transitions. [2019-10-03 02:42:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-03 02:42:44,093 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:44,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:44,094 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:44,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:44,094 INFO L82 PathProgramCache]: Analyzing trace with hash 219395717, now seen corresponding path program 1 times [2019-10-03 02:42:44,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:44,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:44,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:44,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:44,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:44,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:44,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:42:44,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:44,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:42:44,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:42:44,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:42:44,259 INFO L87 Difference]: Start difference. First operand 5627 states and 9190 transitions. Second operand 5 states. [2019-10-03 02:42:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:44,371 INFO L93 Difference]: Finished difference Result 5745 states and 9366 transitions. [2019-10-03 02:42:44,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:42:44,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-03 02:42:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:44,432 INFO L225 Difference]: With dead ends: 5745 [2019-10-03 02:42:44,432 INFO L226 Difference]: Without dead ends: 5745 [2019-10-03 02:42:44,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:42:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5745 states. [2019-10-03 02:42:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5745 to 5679. [2019-10-03 02:42:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5679 states. [2019-10-03 02:42:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 9263 transitions. [2019-10-03 02:42:44,835 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 9263 transitions. Word has length 133 [2019-10-03 02:42:44,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:44,836 INFO L475 AbstractCegarLoop]: Abstraction has 5679 states and 9263 transitions. [2019-10-03 02:42:44,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:42:44,836 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 9263 transitions. [2019-10-03 02:42:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:42:44,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:44,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:44,841 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:44,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:44,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1503957235, now seen corresponding path program 1 times [2019-10-03 02:42:44,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:44,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:44,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:44,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:44,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:42:45,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:45,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:42:45,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:45,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:42:45,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:42:45,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:42:45,002 INFO L87 Difference]: Start difference. First operand 5679 states and 9263 transitions. Second operand 7 states. [2019-10-03 02:42:45,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:45,287 INFO L93 Difference]: Finished difference Result 6159 states and 10021 transitions. [2019-10-03 02:42:45,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:42:45,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-10-03 02:42:45,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:45,349 INFO L225 Difference]: With dead ends: 6159 [2019-10-03 02:42:45,349 INFO L226 Difference]: Without dead ends: 5679 [2019-10-03 02:42:45,350 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:42:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5679 states. [2019-10-03 02:42:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5679 to 5679. [2019-10-03 02:42:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5679 states. [2019-10-03 02:42:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 9171 transitions. [2019-10-03 02:42:45,586 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 9171 transitions. Word has length 140 [2019-10-03 02:42:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:45,588 INFO L475 AbstractCegarLoop]: Abstraction has 5679 states and 9171 transitions. [2019-10-03 02:42:45,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:42:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 9171 transitions. [2019-10-03 02:42:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 02:42:45,593 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:45,593 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:45,593 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:45,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:45,594 INFO L82 PathProgramCache]: Analyzing trace with hash 712750592, now seen corresponding path program 1 times [2019-10-03 02:42:45,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:45,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:45,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:45,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:45,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:42:45,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:45,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:42:45,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:45,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:42:45,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:42:45,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:42:45,820 INFO L87 Difference]: Start difference. First operand 5679 states and 9171 transitions. Second operand 7 states. [2019-10-03 02:42:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:50,745 INFO L93 Difference]: Finished difference Result 6026 states and 9665 transitions. [2019-10-03 02:42:50,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:42:50,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-03 02:42:50,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:50,787 INFO L225 Difference]: With dead ends: 6026 [2019-10-03 02:42:50,788 INFO L226 Difference]: Without dead ends: 6026 [2019-10-03 02:42:50,788 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:42:50,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2019-10-03 02:42:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 5911. [2019-10-03 02:42:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5911 states. [2019-10-03 02:42:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5911 states to 5911 states and 9485 transitions. [2019-10-03 02:42:51,007 INFO L78 Accepts]: Start accepts. Automaton has 5911 states and 9485 transitions. Word has length 145 [2019-10-03 02:42:51,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:51,008 INFO L475 AbstractCegarLoop]: Abstraction has 5911 states and 9485 transitions. [2019-10-03 02:42:51,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:42:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 5911 states and 9485 transitions. [2019-10-03 02:42:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 02:42:51,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:51,013 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:51,014 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:51,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1523468860, now seen corresponding path program 1 times [2019-10-03 02:42:51,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:51,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:51,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:51,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:51,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:42:51,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:51,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:42:51,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:51,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:42:51,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:42:51,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:42:51,162 INFO L87 Difference]: Start difference. First operand 5911 states and 9485 transitions. Second operand 6 states. [2019-10-03 02:42:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:51,406 INFO L93 Difference]: Finished difference Result 8366 states and 13487 transitions. [2019-10-03 02:42:51,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:42:51,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-03 02:42:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:51,481 INFO L225 Difference]: With dead ends: 8366 [2019-10-03 02:42:51,482 INFO L226 Difference]: Without dead ends: 8366 [2019-10-03 02:42:51,485 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:42:51,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8366 states. [2019-10-03 02:42:51,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8366 to 7915. [2019-10-03 02:42:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7915 states. [2019-10-03 02:42:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7915 states to 7915 states and 12767 transitions. [2019-10-03 02:42:51,874 INFO L78 Accepts]: Start accepts. Automaton has 7915 states and 12767 transitions. Word has length 150 [2019-10-03 02:42:51,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:51,875 INFO L475 AbstractCegarLoop]: Abstraction has 7915 states and 12767 transitions. [2019-10-03 02:42:51,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:42:51,876 INFO L276 IsEmpty]: Start isEmpty. Operand 7915 states and 12767 transitions. [2019-10-03 02:42:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-03 02:42:51,884 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:51,885 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:51,885 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:51,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:51,886 INFO L82 PathProgramCache]: Analyzing trace with hash 776052654, now seen corresponding path program 1 times [2019-10-03 02:42:51,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:51,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:51,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:51,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:51,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:42:52,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:52,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:42:52,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:52,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:42:52,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:42:52,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:42:52,898 INFO L87 Difference]: Start difference. First operand 7915 states and 12767 transitions. Second operand 11 states. [2019-10-03 02:43:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:01,546 INFO L93 Difference]: Finished difference Result 9620 states and 15365 transitions. [2019-10-03 02:43:01,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 02:43:01,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-10-03 02:43:01,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:01,615 INFO L225 Difference]: With dead ends: 9620 [2019-10-03 02:43:01,615 INFO L226 Difference]: Without dead ends: 9608 [2019-10-03 02:43:01,616 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-10-03 02:43:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9608 states. [2019-10-03 02:43:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9608 to 9087. [2019-10-03 02:43:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9087 states. [2019-10-03 02:43:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9087 states to 9087 states and 14477 transitions. [2019-10-03 02:43:01,947 INFO L78 Accepts]: Start accepts. Automaton has 9087 states and 14477 transitions. Word has length 152 [2019-10-03 02:43:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:01,948 INFO L475 AbstractCegarLoop]: Abstraction has 9087 states and 14477 transitions. [2019-10-03 02:43:01,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:43:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 9087 states and 14477 transitions. [2019-10-03 02:43:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 02:43:01,953 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:01,953 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:01,954 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:01,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:01,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2069898562, now seen corresponding path program 1 times [2019-10-03 02:43:01,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:01,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:01,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:01,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:01,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:43:02,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:02,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:02,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:02,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:02,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:02,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:02,088 INFO L87 Difference]: Start difference. First operand 9087 states and 14477 transitions. Second operand 4 states. [2019-10-03 02:43:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:04,392 INFO L93 Difference]: Finished difference Result 19521 states and 32312 transitions. [2019-10-03 02:43:04,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:43:04,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-03 02:43:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:04,566 INFO L225 Difference]: With dead ends: 19521 [2019-10-03 02:43:04,566 INFO L226 Difference]: Without dead ends: 19521 [2019-10-03 02:43:04,578 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19521 states. [2019-10-03 02:43:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19521 to 19307. [2019-10-03 02:43:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19307 states. [2019-10-03 02:43:05,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19307 states to 19307 states and 31767 transitions. [2019-10-03 02:43:05,338 INFO L78 Accepts]: Start accepts. Automaton has 19307 states and 31767 transitions. Word has length 150 [2019-10-03 02:43:05,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:05,339 INFO L475 AbstractCegarLoop]: Abstraction has 19307 states and 31767 transitions. [2019-10-03 02:43:05,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 19307 states and 31767 transitions. [2019-10-03 02:43:05,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-03 02:43:05,347 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:05,347 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:05,348 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:05,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:05,348 INFO L82 PathProgramCache]: Analyzing trace with hash 256364515, now seen corresponding path program 1 times [2019-10-03 02:43:05,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:05,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:05,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:05,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:05,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:43:05,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:05,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:05,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:05,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:05,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:05,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:05,477 INFO L87 Difference]: Start difference. First operand 19307 states and 31767 transitions. Second operand 4 states. [2019-10-03 02:43:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:08,034 INFO L93 Difference]: Finished difference Result 42311 states and 74585 transitions. [2019-10-03 02:43:08,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:43:08,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-03 02:43:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:08,441 INFO L225 Difference]: With dead ends: 42311 [2019-10-03 02:43:08,442 INFO L226 Difference]: Without dead ends: 42311 [2019-10-03 02:43:08,442 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:08,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42311 states. [2019-10-03 02:43:10,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42311 to 41828. [2019-10-03 02:43:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41828 states. [2019-10-03 02:43:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41828 states to 41828 states and 72691 transitions. [2019-10-03 02:43:11,332 INFO L78 Accepts]: Start accepts. Automaton has 41828 states and 72691 transitions. Word has length 151 [2019-10-03 02:43:11,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:11,332 INFO L475 AbstractCegarLoop]: Abstraction has 41828 states and 72691 transitions. [2019-10-03 02:43:11,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 41828 states and 72691 transitions. [2019-10-03 02:43:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-03 02:43:11,342 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:11,342 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:11,342 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:11,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:11,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1140959697, now seen corresponding path program 1 times [2019-10-03 02:43:11,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:11,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:11,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:11,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:11,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:43:11,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:11,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:11,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:11,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:11,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:11,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:11,469 INFO L87 Difference]: Start difference. First operand 41828 states and 72691 transitions. Second operand 4 states. [2019-10-03 02:43:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:16,256 INFO L93 Difference]: Finished difference Result 93731 states and 183209 transitions. [2019-10-03 02:43:16,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:43:16,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-03 02:43:16,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:16,900 INFO L225 Difference]: With dead ends: 93731 [2019-10-03 02:43:16,901 INFO L226 Difference]: Without dead ends: 93731 [2019-10-03 02:43:16,901 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93731 states. [2019-10-03 02:43:19,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93731 to 92599. [2019-10-03 02:43:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92599 states. [2019-10-03 02:43:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92599 states to 92599 states and 175810 transitions. [2019-10-03 02:43:20,079 INFO L78 Accepts]: Start accepts. Automaton has 92599 states and 175810 transitions. Word has length 154 [2019-10-03 02:43:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:20,079 INFO L475 AbstractCegarLoop]: Abstraction has 92599 states and 175810 transitions. [2019-10-03 02:43:20,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 92599 states and 175810 transitions. [2019-10-03 02:43:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-03 02:43:20,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:20,088 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:20,089 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:20,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:20,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1011293930, now seen corresponding path program 1 times [2019-10-03 02:43:20,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:20,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:20,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:20,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:20,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:43:20,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:20,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:20,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:20,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:20,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:20,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:20,208 INFO L87 Difference]: Start difference. First operand 92599 states and 175810 transitions. Second operand 4 states. [2019-10-03 02:43:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:27,730 INFO L93 Difference]: Finished difference Result 212731 states and 488817 transitions. [2019-10-03 02:43:27,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:43:27,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-10-03 02:43:27,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:29,442 INFO L225 Difference]: With dead ends: 212731 [2019-10-03 02:43:29,442 INFO L226 Difference]: Without dead ends: 212731 [2019-10-03 02:43:29,443 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:29,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212731 states. [2019-10-03 02:43:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212731 to 209966. [2019-10-03 02:43:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209966 states. [2019-10-03 02:43:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209966 states to 209966 states and 457185 transitions. [2019-10-03 02:43:46,207 INFO L78 Accepts]: Start accepts. Automaton has 209966 states and 457185 transitions. Word has length 155 [2019-10-03 02:43:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:46,207 INFO L475 AbstractCegarLoop]: Abstraction has 209966 states and 457185 transitions. [2019-10-03 02:43:46,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:46,207 INFO L276 IsEmpty]: Start isEmpty. Operand 209966 states and 457185 transitions. [2019-10-03 02:43:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-03 02:43:46,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:46,215 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:46,215 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:46,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:46,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1286618543, now seen corresponding path program 1 times [2019-10-03 02:43:46,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:46,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:46,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:46,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:46,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:43:46,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:46,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:46,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:46,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:46,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:46,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:46,339 INFO L87 Difference]: Start difference. First operand 209966 states and 457185 transitions. Second operand 4 states. [2019-10-03 02:44:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:07,567 INFO L93 Difference]: Finished difference Result 495423 states and 1446160 transitions. [2019-10-03 02:44:07,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:44:07,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-03 02:44:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:13,700 INFO L225 Difference]: With dead ends: 495423 [2019-10-03 02:44:13,701 INFO L226 Difference]: Without dead ends: 495411 [2019-10-03 02:44:13,701 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:44:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495411 states. [2019-10-03 02:45:03,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495411 to 488375. [2019-10-03 02:45:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488375 states. [2019-10-03 02:45:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488375 states to 488375 states and 1302336 transitions. [2019-10-03 02:45:25,034 INFO L78 Accepts]: Start accepts. Automaton has 488375 states and 1302336 transitions. Word has length 156 [2019-10-03 02:45:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:45:25,034 INFO L475 AbstractCegarLoop]: Abstraction has 488375 states and 1302336 transitions. [2019-10-03 02:45:25,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:45:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 488375 states and 1302336 transitions. [2019-10-03 02:45:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-03 02:45:25,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:45:25,076 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:45:25,077 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:45:25,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:45:25,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1738368413, now seen corresponding path program 1 times [2019-10-03 02:45:25,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:45:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:25,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:45:25,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:45:25,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:45:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:45:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-03 02:45:25,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:45:25,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:45:25,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:45:25,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:45:25,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:45:25,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:45:25,237 INFO L87 Difference]: Start difference. First operand 488375 states and 1302336 transitions. Second operand 5 states. [2019-10-03 02:45:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:55,094 INFO L93 Difference]: Finished difference Result 490359 states and 1305842 transitions. [2019-10-03 02:45:55,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:45:55,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2019-10-03 02:45:55,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:00,056 INFO L225 Difference]: With dead ends: 490359 [2019-10-03 02:46:00,056 INFO L226 Difference]: Without dead ends: 490359 [2019-10-03 02:46:00,056 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490359 states. [2019-10-03 02:46:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490359 to 490167. [2019-10-03 02:46:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490167 states.