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_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:41:26,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:41:26,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:41:26,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:41:26,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:41:26,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:41:26,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:41:26,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:41:26,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:41:26,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:41:26,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:41:26,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:41:26,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:41:26,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:41:26,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:41:26,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:41:26,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:41:26,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:41:26,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:41:26,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:41:26,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:41:26,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:41:26,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:41:26,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:41:26,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:41:26,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:41:26,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:41:26,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:41:26,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:41:26,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:41:26,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:41:26,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:41:26,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:41:26,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:41:26,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:41:26,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:41:26,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:41:26,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:41:26,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:41:26,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:41:26,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:41:26,812 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:41:26,832 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:41:26,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:41:26,833 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:41:26,833 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:41:26,836 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:41:26,836 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:41:26,837 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:41:26,837 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:41:26,837 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:41:26,837 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:41:26,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:41:26,838 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:41:26,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:41:26,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:41:26,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:41:26,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:41:26,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:41:26,841 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:41:26,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:41:26,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:41:26,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:41:26,841 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:41:26,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:41:26,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:41:26,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:41:26,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:41:26,843 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:41:26,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:41:26,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:41:26,844 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:41:26,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:41:26,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:41:26,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:41:26,897 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:41:26,898 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:41:26,899 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product21.cil.c [2019-10-03 02:41:26,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686d37ad0/843b54578e874871a8780973b3b66b58/FLAG4ebe20c98 [2019-10-03 02:41:27,608 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:41:27,608 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product21.cil.c [2019-10-03 02:41:27,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686d37ad0/843b54578e874871a8780973b3b66b58/FLAG4ebe20c98 [2019-10-03 02:41:27,804 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686d37ad0/843b54578e874871a8780973b3b66b58 [2019-10-03 02:41:27,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:41:27,816 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:41:27,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:41:27,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:41:27,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:41:27,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:41:27" (1/1) ... [2019-10-03 02:41:27,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5baf383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:27, skipping insertion in model container [2019-10-03 02:41:27,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:41:27" (1/1) ... [2019-10-03 02:41:27,835 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:41:27,917 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:41:28,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:41:28,647 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:41:28,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:41:28,875 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:41:28,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:28 WrapperNode [2019-10-03 02:41:28,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:41:28,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:41:28,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:41:28,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:41:28,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:28" (1/1) ... [2019-10-03 02:41:28,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:28" (1/1) ... [2019-10-03 02:41:28,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:28" (1/1) ... [2019-10-03 02:41:28,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:28" (1/1) ... [2019-10-03 02:41:29,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:28" (1/1) ... [2019-10-03 02:41:29,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:28" (1/1) ... [2019-10-03 02:41:29,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:28" (1/1) ... [2019-10-03 02:41:29,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:41:29,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:41:29,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:41:29,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:41:29,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:28" (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:41:29,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:41:29,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:41:29,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:41:29,188 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:41:29,188 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:41:29,188 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:41:29,188 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:41:29,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:41:29,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:41:29,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:41:29,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:41:29,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:41:29,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:41:29,191 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:41:29,191 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:41:29,192 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:41:29,193 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:41:29,193 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:41:29,193 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:41:29,193 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:41:29,193 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:41:29,193 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:41:29,194 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:41:29,194 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:41:29,194 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:41:29,195 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:41:29,195 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:41:29,196 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:41:29,196 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:41:29,196 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:41:29,196 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:41:29,196 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:41:29,197 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:41:29,197 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:41:29,197 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:41:29,197 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:41:29,197 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:41:29,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:41:29,198 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:41:29,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:41:29,198 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:41:29,198 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:41:29,199 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:41:29,199 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:41:29,199 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:41:29,199 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:41:29,199 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:41:29,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:41:29,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:41:29,200 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:41:29,200 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:41:29,200 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:41:29,200 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:41:29,201 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:41:29,201 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:41:29,201 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:41:29,201 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:41:29,201 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:41:29,201 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:41:29,201 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:41:29,202 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:41:29,202 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:41:29,202 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:41:29,202 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:41:29,203 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:41:29,203 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-03 02:41:29,203 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:41:29,203 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:41:29,203 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:41:29,203 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-03 02:41:29,203 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:41:29,204 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:41:29,204 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:41:29,205 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:41:29,205 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:41:29,205 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:41:29,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:41:29,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:41:29,205 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:41:29,206 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:41:29,206 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:41:29,206 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:41:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:41:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:41:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:41:29,208 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:41:29,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:41:29,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:41:29,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:41:29,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:41:29,209 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:41:29,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:41:29,209 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:41:29,209 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:41:29,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:41:29,210 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:41:29,210 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:41:29,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:41:29,210 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:41:29,210 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:41:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:41:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:41:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:41:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:41:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:41:29,212 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:41:29,212 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:41:29,212 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:41:29,212 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:41:29,212 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:41:29,212 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:41:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:41:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:41:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:41:29,213 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:41:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:41:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:41:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:41:29,215 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:41:29,215 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:41:29,215 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:41:29,216 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:41:29,216 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:41:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:41:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:41:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:41:29,217 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:41:29,218 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:41:29,218 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:41:29,218 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:41:29,218 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:41:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:41:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:41:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:41:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:41:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:41:29,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:41:29,220 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:41:29,221 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:41:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:41:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:41:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:41:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:41:29,232 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:41:29,232 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:41:29,232 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:41:29,233 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:41:29,233 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:41:29,233 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:41:29,233 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:41:29,234 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:41:29,234 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:41:29,234 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:41:29,234 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:41:29,234 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:41:29,234 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:41:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-03 02:41:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:41:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:41:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-03 02:41:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:41:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:41:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:41:29,235 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:41:29,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:41:29,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:41:29,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:41:31,585 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:41:31,586 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:41:31,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:41:31 BoogieIcfgContainer [2019-10-03 02:41:31,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:41:31,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:41:31,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:41:31,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:41:31,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:41:27" (1/3) ... [2019-10-03 02:41:31,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115babab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:41:31, skipping insertion in model container [2019-10-03 02:41:31,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:41:28" (2/3) ... [2019-10-03 02:41:31,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115babab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:41:31, skipping insertion in model container [2019-10-03 02:41:31,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:41:31" (3/3) ... [2019-10-03 02:41:31,596 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product21.cil.c [2019-10-03 02:41:31,608 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:41:31,617 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:41:31,639 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:41:31,671 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:41:31,671 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:41:31,671 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:41:31,671 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:41:31,671 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:41:31,672 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:41:31,672 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:41:31,672 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:41:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states. [2019-10-03 02:41:31,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-03 02:41:31,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:31,739 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] [2019-10-03 02:41:31,742 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:31,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:31,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1453471950, now seen corresponding path program 1 times [2019-10-03 02:41:31,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:31,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:31,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:31,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:31,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:32,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:32,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:32,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:32,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:32,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:32,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:32,444 INFO L87 Difference]: Start difference. First operand 773 states. Second operand 4 states. [2019-10-03 02:41:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:32,653 INFO L93 Difference]: Finished difference Result 624 states and 992 transitions. [2019-10-03 02:41:32,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:32,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-03 02:41:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:32,698 INFO L225 Difference]: With dead ends: 624 [2019-10-03 02:41:32,698 INFO L226 Difference]: Without dead ends: 613 [2019-10-03 02:41:32,702 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:41:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-03 02:41:32,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-03 02:41:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-03 02:41:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 980 transitions. [2019-10-03 02:41:32,857 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 980 transitions. Word has length 124 [2019-10-03 02:41:32,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:32,857 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 980 transitions. [2019-10-03 02:41:32,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:32,857 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 980 transitions. [2019-10-03 02:41:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-03 02:41:32,872 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:32,872 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] [2019-10-03 02:41:32,872 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:32,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash -491101009, now seen corresponding path program 1 times [2019-10-03 02:41:32,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:32,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:32,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:32,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:32,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:33,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:33,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:33,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:33,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:33,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:33,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:33,179 INFO L87 Difference]: Start difference. First operand 613 states and 980 transitions. Second operand 4 states. [2019-10-03 02:41:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:33,264 INFO L93 Difference]: Finished difference Result 615 states and 981 transitions. [2019-10-03 02:41:33,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:33,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-10-03 02:41:33,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:33,274 INFO L225 Difference]: With dead ends: 615 [2019-10-03 02:41:33,274 INFO L226 Difference]: Without dead ends: 613 [2019-10-03 02:41:33,276 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:41:33,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-03 02:41:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-03 02:41:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-03 02:41:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 979 transitions. [2019-10-03 02:41:33,325 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 979 transitions. Word has length 127 [2019-10-03 02:41:33,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:33,327 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 979 transitions. [2019-10-03 02:41:33,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:33,328 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 979 transitions. [2019-10-03 02:41:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 02:41:33,340 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:33,341 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] [2019-10-03 02:41:33,341 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:33,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2141971607, now seen corresponding path program 1 times [2019-10-03 02:41:33,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:33,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:33,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:33,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:33,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:33,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:33,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:33,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:33,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:33,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:33,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:33,553 INFO L87 Difference]: Start difference. First operand 613 states and 979 transitions. Second operand 4 states. [2019-10-03 02:41:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:33,666 INFO L93 Difference]: Finished difference Result 615 states and 980 transitions. [2019-10-03 02:41:33,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:33,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-10-03 02:41:33,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:33,674 INFO L225 Difference]: With dead ends: 615 [2019-10-03 02:41:33,674 INFO L226 Difference]: Without dead ends: 613 [2019-10-03 02:41:33,675 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:41:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-03 02:41:33,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-03 02:41:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-03 02:41:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 978 transitions. [2019-10-03 02:41:33,711 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 978 transitions. Word has length 128 [2019-10-03 02:41:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:33,712 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 978 transitions. [2019-10-03 02:41:33,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 978 transitions. [2019-10-03 02:41:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-03 02:41:33,718 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:33,718 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] [2019-10-03 02:41:33,719 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:33,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:33,719 INFO L82 PathProgramCache]: Analyzing trace with hash 923417843, now seen corresponding path program 1 times [2019-10-03 02:41:33,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:33,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:33,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:33,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:33,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:33,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:33,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:33,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:33,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:33,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:33,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:33,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:33,886 INFO L87 Difference]: Start difference. First operand 613 states and 978 transitions. Second operand 4 states. [2019-10-03 02:41:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:33,948 INFO L93 Difference]: Finished difference Result 615 states and 979 transitions. [2019-10-03 02:41:33,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:33,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-03 02:41:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:33,954 INFO L225 Difference]: With dead ends: 615 [2019-10-03 02:41:33,954 INFO L226 Difference]: Without dead ends: 613 [2019-10-03 02:41:33,955 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:41:33,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-03 02:41:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-03 02:41:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-03 02:41:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 977 transitions. [2019-10-03 02:41:33,981 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 977 transitions. Word has length 129 [2019-10-03 02:41:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:33,982 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 977 transitions. [2019-10-03 02:41:33,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:33,982 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 977 transitions. [2019-10-03 02:41:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-03 02:41:33,987 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:33,987 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] [2019-10-03 02:41:33,987 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:33,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:33,988 INFO L82 PathProgramCache]: Analyzing trace with hash -130986579, now seen corresponding path program 1 times [2019-10-03 02:41:33,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:33,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:33,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:33,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:33,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:34,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:34,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:34,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:34,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:34,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:34,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:34,123 INFO L87 Difference]: Start difference. First operand 613 states and 977 transitions. Second operand 4 states. [2019-10-03 02:41:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:34,186 INFO L93 Difference]: Finished difference Result 615 states and 978 transitions. [2019-10-03 02:41:34,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:34,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-10-03 02:41:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:34,194 INFO L225 Difference]: With dead ends: 615 [2019-10-03 02:41:34,194 INFO L226 Difference]: Without dead ends: 613 [2019-10-03 02:41:34,195 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:41:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-03 02:41:34,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-03 02:41:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-03 02:41:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 976 transitions. [2019-10-03 02:41:34,229 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 976 transitions. Word has length 130 [2019-10-03 02:41:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:34,230 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 976 transitions. [2019-10-03 02:41:34,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 976 transitions. [2019-10-03 02:41:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-03 02:41:34,236 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:34,236 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] [2019-10-03 02:41:34,237 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:34,237 INFO L82 PathProgramCache]: Analyzing trace with hash -49982153, now seen corresponding path program 1 times [2019-10-03 02:41:34,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:34,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:34,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:34,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:34,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:34,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:34,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:41:34,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:34,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:41:34,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:41:34,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:41:34,482 INFO L87 Difference]: Start difference. First operand 613 states and 976 transitions. Second operand 10 states. [2019-10-03 02:41:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:34,744 INFO L93 Difference]: Finished difference Result 622 states and 987 transitions. [2019-10-03 02:41:34,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:41:34,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-10-03 02:41:34,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:34,750 INFO L225 Difference]: With dead ends: 622 [2019-10-03 02:41:34,750 INFO L226 Difference]: Without dead ends: 622 [2019-10-03 02:41:34,752 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:41:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-03 02:41:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 620. [2019-10-03 02:41:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-03 02:41:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 985 transitions. [2019-10-03 02:41:34,799 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 985 transitions. Word has length 131 [2019-10-03 02:41:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:34,801 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 985 transitions. [2019-10-03 02:41:34,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:41:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 985 transitions. [2019-10-03 02:41:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-03 02:41:34,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:34,811 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] [2019-10-03 02:41:34,811 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:34,812 INFO L82 PathProgramCache]: Analyzing trace with hash 625710456, now seen corresponding path program 1 times [2019-10-03 02:41:34,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:34,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:34,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:34,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:34,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:34,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:34,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:34,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:34,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:34,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:34,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:34,937 INFO L87 Difference]: Start difference. First operand 620 states and 985 transitions. Second operand 4 states. [2019-10-03 02:41:34,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:34,993 INFO L93 Difference]: Finished difference Result 618 states and 980 transitions. [2019-10-03 02:41:34,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:34,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-10-03 02:41:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:35,000 INFO L225 Difference]: With dead ends: 618 [2019-10-03 02:41:35,000 INFO L226 Difference]: Without dead ends: 607 [2019-10-03 02:41:35,000 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:41:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-03 02:41:35,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-03 02:41:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-03 02:41:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 962 transitions. [2019-10-03 02:41:35,026 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 962 transitions. Word has length 131 [2019-10-03 02:41:35,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:35,027 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 962 transitions. [2019-10-03 02:41:35,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 962 transitions. [2019-10-03 02:41:35,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-03 02:41:35,032 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:35,032 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] [2019-10-03 02:41:35,032 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:35,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:35,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1002453247, now seen corresponding path program 1 times [2019-10-03 02:41:35,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:35,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:35,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:35,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:35,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:35,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:35,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:35,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:35,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:35,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:35,201 INFO L87 Difference]: Start difference. First operand 607 states and 962 transitions. Second operand 6 states. [2019-10-03 02:41:35,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:35,472 INFO L93 Difference]: Finished difference Result 610 states and 965 transitions. [2019-10-03 02:41:35,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:35,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-10-03 02:41:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:35,477 INFO L225 Difference]: With dead ends: 610 [2019-10-03 02:41:35,478 INFO L226 Difference]: Without dead ends: 607 [2019-10-03 02:41:35,478 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:41:35,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-03 02:41:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-03 02:41:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-03 02:41:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 958 transitions. [2019-10-03 02:41:35,500 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 958 transitions. Word has length 132 [2019-10-03 02:41:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:35,503 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 958 transitions. [2019-10-03 02:41:35,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 958 transitions. [2019-10-03 02:41:35,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-03 02:41:35,508 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:35,508 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] [2019-10-03 02:41:35,508 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:35,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:35,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1646126772, now seen corresponding path program 1 times [2019-10-03 02:41:35,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:35,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:35,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:35,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:35,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:35,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:35,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:35,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:35,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:35,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:35,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:35,710 INFO L87 Difference]: Start difference. First operand 607 states and 958 transitions. Second operand 6 states. [2019-10-03 02:41:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:35,918 INFO L93 Difference]: Finished difference Result 610 states and 961 transitions. [2019-10-03 02:41:35,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:35,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-10-03 02:41:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:35,925 INFO L225 Difference]: With dead ends: 610 [2019-10-03 02:41:35,925 INFO L226 Difference]: Without dead ends: 607 [2019-10-03 02:41:35,926 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:41:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-03 02:41:35,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-03 02:41:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-03 02:41:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 954 transitions. [2019-10-03 02:41:35,949 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 954 transitions. Word has length 133 [2019-10-03 02:41:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:35,949 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 954 transitions. [2019-10-03 02:41:35,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 954 transitions. [2019-10-03 02:41:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-03 02:41:35,954 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:35,955 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] [2019-10-03 02:41:35,955 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:35,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:35,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1808478140, now seen corresponding path program 1 times [2019-10-03 02:41:35,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:35,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:35,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:35,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:35,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:36,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:36,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:36,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:36,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:36,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:36,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:36,121 INFO L87 Difference]: Start difference. First operand 607 states and 954 transitions. Second operand 6 states. [2019-10-03 02:41:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:36,302 INFO L93 Difference]: Finished difference Result 610 states and 957 transitions. [2019-10-03 02:41:36,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:36,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-10-03 02:41:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:36,308 INFO L225 Difference]: With dead ends: 610 [2019-10-03 02:41:36,308 INFO L226 Difference]: Without dead ends: 607 [2019-10-03 02:41:36,308 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:41:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-03 02:41:36,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-03 02:41:36,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-03 02:41:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 950 transitions. [2019-10-03 02:41:36,330 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 950 transitions. Word has length 134 [2019-10-03 02:41:36,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:36,330 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 950 transitions. [2019-10-03 02:41:36,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 950 transitions. [2019-10-03 02:41:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-03 02:41:36,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:36,335 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] [2019-10-03 02:41:36,335 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:36,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1695866052, now seen corresponding path program 1 times [2019-10-03 02:41:36,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:36,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:36,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:36,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:36,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:36,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:36,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:41:36,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:36,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:41:36,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:41:36,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:41:36,466 INFO L87 Difference]: Start difference. First operand 607 states and 950 transitions. Second operand 7 states. [2019-10-03 02:41:36,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:36,539 INFO L93 Difference]: Finished difference Result 610 states and 953 transitions. [2019-10-03 02:41:36,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:41:36,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2019-10-03 02:41:36,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:36,545 INFO L225 Difference]: With dead ends: 610 [2019-10-03 02:41:36,546 INFO L226 Difference]: Without dead ends: 586 [2019-10-03 02:41:36,547 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:41:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-03 02:41:36,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-03 02:41:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-03 02:41:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 916 transitions. [2019-10-03 02:41:36,569 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 916 transitions. Word has length 134 [2019-10-03 02:41:36,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:36,570 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 916 transitions. [2019-10-03 02:41:36,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:41:36,570 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 916 transitions. [2019-10-03 02:41:36,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 02:41:36,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:36,575 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] [2019-10-03 02:41:36,576 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:36,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:36,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2087814641, now seen corresponding path program 1 times [2019-10-03 02:41:36,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:36,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:36,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:36,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:36,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:36,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:36,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:36,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:36,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:36,788 INFO L87 Difference]: Start difference. First operand 586 states and 916 transitions. Second operand 6 states. [2019-10-03 02:41:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:36,878 INFO L93 Difference]: Finished difference Result 589 states and 919 transitions. [2019-10-03 02:41:36,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:36,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-10-03 02:41:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:36,884 INFO L225 Difference]: With dead ends: 589 [2019-10-03 02:41:36,884 INFO L226 Difference]: Without dead ends: 586 [2019-10-03 02:41:36,884 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:41:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-03 02:41:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-03 02:41:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-03 02:41:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 915 transitions. [2019-10-03 02:41:36,916 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 915 transitions. Word has length 135 [2019-10-03 02:41:36,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:36,919 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 915 transitions. [2019-10-03 02:41:36,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 915 transitions. [2019-10-03 02:41:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-03 02:41:36,924 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:36,925 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] [2019-10-03 02:41:36,925 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:36,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:36,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1341910135, now seen corresponding path program 1 times [2019-10-03 02:41:36,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:36,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:36,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:36,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:36,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:37,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:37,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:37,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:37,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:37,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:37,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:37,082 INFO L87 Difference]: Start difference. First operand 586 states and 915 transitions. Second operand 6 states. [2019-10-03 02:41:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:37,172 INFO L93 Difference]: Finished difference Result 589 states and 918 transitions. [2019-10-03 02:41:37,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:37,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-10-03 02:41:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:37,177 INFO L225 Difference]: With dead ends: 589 [2019-10-03 02:41:37,177 INFO L226 Difference]: Without dead ends: 586 [2019-10-03 02:41:37,178 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:41:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-03 02:41:37,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-03 02:41:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-03 02:41:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 914 transitions. [2019-10-03 02:41:37,198 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 914 transitions. Word has length 136 [2019-10-03 02:41:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:37,200 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 914 transitions. [2019-10-03 02:41:37,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 914 transitions. [2019-10-03 02:41:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-03 02:41:37,205 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:37,205 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] [2019-10-03 02:41:37,205 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:37,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:37,206 INFO L82 PathProgramCache]: Analyzing trace with hash -50054806, now seen corresponding path program 1 times [2019-10-03 02:41:37,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:37,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:37,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:37,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:37,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:37,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:37,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:41:37,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:37,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:41:37,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:41:37,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:41:37,397 INFO L87 Difference]: Start difference. First operand 586 states and 914 transitions. Second operand 12 states. [2019-10-03 02:41:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:37,565 INFO L93 Difference]: Finished difference Result 590 states and 917 transitions. [2019-10-03 02:41:37,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:41:37,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-10-03 02:41:37,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:37,570 INFO L225 Difference]: With dead ends: 590 [2019-10-03 02:41:37,571 INFO L226 Difference]: Without dead ends: 586 [2019-10-03 02:41:37,572 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:41:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-03 02:41:37,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-03 02:41:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-03 02:41:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 913 transitions. [2019-10-03 02:41:37,591 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 913 transitions. Word has length 137 [2019-10-03 02:41:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:37,591 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 913 transitions. [2019-10-03 02:41:37,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:41:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 913 transitions. [2019-10-03 02:41:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 02:41:37,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:37,596 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] [2019-10-03 02:41:37,596 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:37,596 INFO L82 PathProgramCache]: Analyzing trace with hash -749925748, now seen corresponding path program 1 times [2019-10-03 02:41:37,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:37,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:37,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:37,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:37,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:37,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:37,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:37,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:37,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:37,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:37,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:37,816 INFO L87 Difference]: Start difference. First operand 586 states and 913 transitions. Second operand 6 states. [2019-10-03 02:41:42,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:42,220 INFO L93 Difference]: Finished difference Result 1207 states and 1933 transitions. [2019-10-03 02:41:42,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:41:42,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-10-03 02:41:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:42,233 INFO L225 Difference]: With dead ends: 1207 [2019-10-03 02:41:42,233 INFO L226 Difference]: Without dead ends: 1207 [2019-10-03 02:41:42,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:41:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2019-10-03 02:41:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1124. [2019-10-03 02:41:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-10-03 02:41:42,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1787 transitions. [2019-10-03 02:41:42,281 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1787 transitions. Word has length 138 [2019-10-03 02:41:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:42,281 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1787 transitions. [2019-10-03 02:41:42,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1787 transitions. [2019-10-03 02:41:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 02:41:42,320 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:42,321 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] [2019-10-03 02:41:42,322 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:42,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:42,322 INFO L82 PathProgramCache]: Analyzing trace with hash -84982961, now seen corresponding path program 1 times [2019-10-03 02:41:42,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:42,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:42,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:42,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:42,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:42,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:42,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:42,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:42,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:42,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:42,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:42,469 INFO L87 Difference]: Start difference. First operand 1124 states and 1787 transitions. Second operand 6 states. [2019-10-03 02:41:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:46,696 INFO L93 Difference]: Finished difference Result 2499 states and 4098 transitions. [2019-10-03 02:41:46,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:41:46,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-10-03 02:41:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:46,719 INFO L225 Difference]: With dead ends: 2499 [2019-10-03 02:41:46,719 INFO L226 Difference]: Without dead ends: 2499 [2019-10-03 02:41:46,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:41:46,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-10-03 02:41:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2306. [2019-10-03 02:41:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2019-10-03 02:41:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3726 transitions. [2019-10-03 02:41:46,819 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3726 transitions. Word has length 139 [2019-10-03 02:41:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:46,819 INFO L475 AbstractCegarLoop]: Abstraction has 2306 states and 3726 transitions. [2019-10-03 02:41:46,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3726 transitions. [2019-10-03 02:41:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:41:46,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:46,824 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] [2019-10-03 02:41:46,824 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:46,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:46,825 INFO L82 PathProgramCache]: Analyzing trace with hash -708797968, now seen corresponding path program 1 times [2019-10-03 02:41:46,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:46,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:46,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:46,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:46,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:46,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:46,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:46,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:46,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:46,959 INFO L87 Difference]: Start difference. First operand 2306 states and 3726 transitions. Second operand 6 states. [2019-10-03 02:41:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:51,678 INFO L93 Difference]: Finished difference Result 5464 states and 9173 transitions. [2019-10-03 02:41:51,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:41:51,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-10-03 02:41:51,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:51,730 INFO L225 Difference]: With dead ends: 5464 [2019-10-03 02:41:51,730 INFO L226 Difference]: Without dead ends: 5464 [2019-10-03 02:41:51,732 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:41:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2019-10-03 02:41:51,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 4964. [2019-10-03 02:41:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4964 states. [2019-10-03 02:41:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4964 states to 4964 states and 8151 transitions. [2019-10-03 02:41:52,041 INFO L78 Accepts]: Start accepts. Automaton has 4964 states and 8151 transitions. Word has length 140 [2019-10-03 02:41:52,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:52,044 INFO L475 AbstractCegarLoop]: Abstraction has 4964 states and 8151 transitions. [2019-10-03 02:41:52,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4964 states and 8151 transitions. [2019-10-03 02:41:52,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 02:41:52,050 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:52,050 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] [2019-10-03 02:41:52,051 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:52,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:52,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1665568371, now seen corresponding path program 1 times [2019-10-03 02:41:52,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:52,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:52,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:52,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:52,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:52,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:52,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:52,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:52,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:52,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:52,199 INFO L87 Difference]: Start difference. First operand 4964 states and 8151 transitions. Second operand 6 states. [2019-10-03 02:41:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:56,783 INFO L93 Difference]: Finished difference Result 12479 states and 21496 transitions. [2019-10-03 02:41:56,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:41:56,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-03 02:41:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:56,901 INFO L225 Difference]: With dead ends: 12479 [2019-10-03 02:41:56,901 INFO L226 Difference]: Without dead ends: 12479 [2019-10-03 02:41:56,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:41:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12479 states. [2019-10-03 02:41:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12479 to 11114. [2019-10-03 02:41:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11114 states. [2019-10-03 02:41:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11114 states to 11114 states and 18594 transitions. [2019-10-03 02:41:57,501 INFO L78 Accepts]: Start accepts. Automaton has 11114 states and 18594 transitions. Word has length 141 [2019-10-03 02:41:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:57,501 INFO L475 AbstractCegarLoop]: Abstraction has 11114 states and 18594 transitions. [2019-10-03 02:41:57,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 11114 states and 18594 transitions. [2019-10-03 02:41:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 02:41:57,506 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:57,507 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] [2019-10-03 02:41:57,507 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:57,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1800691372, now seen corresponding path program 1 times [2019-10-03 02:41:57,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:57,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:57,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:57,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:57,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:41:57,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:57,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:57,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:57,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:57,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:57,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:57,763 INFO L87 Difference]: Start difference. First operand 11114 states and 18594 transitions. Second operand 6 states. [2019-10-03 02:42:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:03,306 INFO L93 Difference]: Finished difference Result 29618 states and 52491 transitions. [2019-10-03 02:42:03,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:42:03,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-03 02:42:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:03,668 INFO L225 Difference]: With dead ends: 29618 [2019-10-03 02:42:03,668 INFO L226 Difference]: Without dead ends: 29618 [2019-10-03 02:42:03,670 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:42:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29618 states. [2019-10-03 02:42:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29618 to 25800. [2019-10-03 02:42:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25800 states. [2019-10-03 02:42:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25800 states to 25800 states and 44135 transitions. [2019-10-03 02:42:05,485 INFO L78 Accepts]: Start accepts. Automaton has 25800 states and 44135 transitions. Word has length 142 [2019-10-03 02:42:05,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:05,488 INFO L475 AbstractCegarLoop]: Abstraction has 25800 states and 44135 transitions. [2019-10-03 02:42:05,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:42:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 25800 states and 44135 transitions. [2019-10-03 02:42:05,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 02:42:05,497 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:05,497 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] [2019-10-03 02:42:05,498 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:05,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash -667500779, now seen corresponding path program 1 times [2019-10-03 02:42:05,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:05,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:05,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:05,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:05,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:42:06,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:06,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:42:06,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:06,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:42:06,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:42:06,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:42:06,119 INFO L87 Difference]: Start difference. First operand 25800 states and 44135 transitions. Second operand 9 states. [2019-10-03 02:42:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:13,025 INFO L93 Difference]: Finished difference Result 57391 states and 97969 transitions. [2019-10-03 02:42:13,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-03 02:42:13,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 142 [2019-10-03 02:42:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:13,563 INFO L225 Difference]: With dead ends: 57391 [2019-10-03 02:42:13,564 INFO L226 Difference]: Without dead ends: 57391 [2019-10-03 02:42:13,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-10-03 02:42:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57391 states. [2019-10-03 02:42:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57391 to 56572. [2019-10-03 02:42:16,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56572 states. [2019-10-03 02:42:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56572 states to 56572 states and 96179 transitions. [2019-10-03 02:42:17,068 INFO L78 Accepts]: Start accepts. Automaton has 56572 states and 96179 transitions. Word has length 142 [2019-10-03 02:42:17,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:17,069 INFO L475 AbstractCegarLoop]: Abstraction has 56572 states and 96179 transitions. [2019-10-03 02:42:17,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:42:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 56572 states and 96179 transitions. [2019-10-03 02:42:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 02:42:17,079 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:17,080 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, 1, 1, 1] [2019-10-03 02:42:17,080 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:17,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:17,081 INFO L82 PathProgramCache]: Analyzing trace with hash -374692248, now seen corresponding path program 1 times [2019-10-03 02:42:17,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:17,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:17,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:17,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:17,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:42:17,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:17,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:42:17,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:17,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:42:17,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:42:17,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:42:17,263 INFO L87 Difference]: Start difference. First operand 56572 states and 96179 transitions. Second operand 5 states. [2019-10-03 02:42:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:19,773 INFO L93 Difference]: Finished difference Result 56874 states and 96566 transitions. [2019-10-03 02:42:19,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:42:19,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 02:42:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:20,162 INFO L225 Difference]: With dead ends: 56874 [2019-10-03 02:42:20,162 INFO L226 Difference]: Without dead ends: 56874 [2019-10-03 02:42:20,163 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:20,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56874 states. [2019-10-03 02:42:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56874 to 56564. [2019-10-03 02:42:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56564 states. [2019-10-03 02:42:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56564 states to 56564 states and 96163 transitions. [2019-10-03 02:42:22,318 INFO L78 Accepts]: Start accepts. Automaton has 56564 states and 96163 transitions. Word has length 148 [2019-10-03 02:42:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:22,318 INFO L475 AbstractCegarLoop]: Abstraction has 56564 states and 96163 transitions. [2019-10-03 02:42:22,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:42:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 56564 states and 96163 transitions. [2019-10-03 02:42:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 02:42:22,325 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:22,325 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, 1, 1] [2019-10-03 02:42:22,325 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:22,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:22,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1507242393, now seen corresponding path program 1 times [2019-10-03 02:42:22,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:22,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:22,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:22,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:22,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:22,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:42:22,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:22,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:42:22,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:22,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:42:22,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:42:22,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:42:22,452 INFO L87 Difference]: Start difference. First operand 56564 states and 96163 transitions. Second operand 7 states. [2019-10-03 02:42:23,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:23,170 INFO L93 Difference]: Finished difference Result 57940 states and 98112 transitions. [2019-10-03 02:42:23,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:42:23,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-10-03 02:42:23,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:23,565 INFO L225 Difference]: With dead ends: 57940 [2019-10-03 02:42:23,566 INFO L226 Difference]: Without dead ends: 57940 [2019-10-03 02:42:23,566 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:42:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57940 states. [2019-10-03 02:42:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57940 to 57236. [2019-10-03 02:42:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57236 states. [2019-10-03 02:42:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57236 states to 57236 states and 97120 transitions. [2019-10-03 02:42:25,497 INFO L78 Accepts]: Start accepts. Automaton has 57236 states and 97120 transitions. Word has length 147 [2019-10-03 02:42:25,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:25,497 INFO L475 AbstractCegarLoop]: Abstraction has 57236 states and 97120 transitions. [2019-10-03 02:42:25,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:42:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 57236 states and 97120 transitions. [2019-10-03 02:42:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 02:42:25,507 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:25,508 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, 1, 1, 1] [2019-10-03 02:42:25,508 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:25,508 INFO L82 PathProgramCache]: Analyzing trace with hash 417651110, now seen corresponding path program 1 times [2019-10-03 02:42:25,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:25,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:25,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:25,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:25,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:42:25,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:25,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:42:25,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:25,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:42:25,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:42:25,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:42:25,651 INFO L87 Difference]: Start difference. First operand 57236 states and 97120 transitions. Second operand 7 states. [2019-10-03 02:42:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:26,290 INFO L93 Difference]: Finished difference Result 58420 states and 98688 transitions. [2019-10-03 02:42:26,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:42:26,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 148 [2019-10-03 02:42:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:26,679 INFO L225 Difference]: With dead ends: 58420 [2019-10-03 02:42:26,679 INFO L226 Difference]: Without dead ends: 58420 [2019-10-03 02:42:26,680 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:42:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58420 states. [2019-10-03 02:42:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58420 to 57332. [2019-10-03 02:42:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57332 states. [2019-10-03 02:42:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57332 states to 57332 states and 97216 transitions. [2019-10-03 02:42:30,225 INFO L78 Accepts]: Start accepts. Automaton has 57332 states and 97216 transitions. Word has length 148 [2019-10-03 02:42:30,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:30,225 INFO L475 AbstractCegarLoop]: Abstraction has 57332 states and 97216 transitions. [2019-10-03 02:42:30,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:42:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 57332 states and 97216 transitions. [2019-10-03 02:42:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-03 02:42:30,233 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:30,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:30,233 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:30,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:30,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1285408334, now seen corresponding path program 1 times [2019-10-03 02:42:30,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:30,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:30,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:30,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:30,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:42:30,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:30,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:42:30,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:30,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:42:30,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:42:30,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:42:30,416 INFO L87 Difference]: Start difference. First operand 57332 states and 97216 transitions. Second operand 8 states. [2019-10-03 02:42:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:36,253 INFO L93 Difference]: Finished difference Result 135589 states and 230884 transitions. [2019-10-03 02:42:36,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:42:36,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 157 [2019-10-03 02:42:36,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:37,118 INFO L225 Difference]: With dead ends: 135589 [2019-10-03 02:42:37,118 INFO L226 Difference]: Without dead ends: 135589 [2019-10-03 02:42:37,119 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:42:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135589 states. [2019-10-03 02:42:42,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135589 to 135459. [2019-10-03 02:42:42,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135459 states. [2019-10-03 02:42:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135459 states to 135459 states and 230716 transitions. [2019-10-03 02:42:44,043 INFO L78 Accepts]: Start accepts. Automaton has 135459 states and 230716 transitions. Word has length 157 [2019-10-03 02:42:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:44,044 INFO L475 AbstractCegarLoop]: Abstraction has 135459 states and 230716 transitions. [2019-10-03 02:42:44,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:42:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 135459 states and 230716 transitions. [2019-10-03 02:42:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-03 02:42:44,051 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:44,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:44,052 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:44,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:44,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1976046138, now seen corresponding path program 1 times [2019-10-03 02:42:44,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:44,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:44,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:44,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:44,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:42:44,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:44,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:42:44,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:44,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:42:44,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:42:44,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:42:44,173 INFO L87 Difference]: Start difference. First operand 135459 states and 230716 transitions. Second operand 7 states. [2019-10-03 02:42:46,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:46,804 INFO L93 Difference]: Finished difference Result 136291 states and 231484 transitions. [2019-10-03 02:42:46,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:42:46,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2019-10-03 02:42:46,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:47,648 INFO L225 Difference]: With dead ends: 136291 [2019-10-03 02:42:47,648 INFO L226 Difference]: Without dead ends: 136227 [2019-10-03 02:42:47,648 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:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136227 states. [2019-10-03 02:42:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136227 to 136227. [2019-10-03 02:42:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136227 states. [2019-10-03 02:42:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136227 states to 136227 states and 231420 transitions. [2019-10-03 02:42:55,246 INFO L78 Accepts]: Start accepts. Automaton has 136227 states and 231420 transitions. Word has length 158 [2019-10-03 02:42:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:55,246 INFO L475 AbstractCegarLoop]: Abstraction has 136227 states and 231420 transitions. [2019-10-03 02:42:55,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:42:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 136227 states and 231420 transitions. [2019-10-03 02:42:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-03 02:42:55,253 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:55,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:55,253 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:55,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:55,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1830198483, now seen corresponding path program 1 times [2019-10-03 02:42:55,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:55,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:55,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:55,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:55,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:42:55,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:55,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:42:55,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:55,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:42:55,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:42:55,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:42:55,382 INFO L87 Difference]: Start difference. First operand 136227 states and 231420 transitions. Second operand 7 states. [2019-10-03 02:43:02,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:02,242 INFO L93 Difference]: Finished difference Result 141494 states and 240160 transitions. [2019-10-03 02:43:02,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:43:02,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 160 [2019-10-03 02:43:02,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:03,338 INFO L225 Difference]: With dead ends: 141494 [2019-10-03 02:43:03,338 INFO L226 Difference]: Without dead ends: 141494 [2019-10-03 02:43:03,339 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:43:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141494 states. [2019-10-03 02:43:09,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141494 to 139939. [2019-10-03 02:43:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139939 states. [2019-10-03 02:43:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139939 states to 139939 states and 236475 transitions. [2019-10-03 02:43:11,048 INFO L78 Accepts]: Start accepts. Automaton has 139939 states and 236475 transitions. Word has length 160 [2019-10-03 02:43:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:11,048 INFO L475 AbstractCegarLoop]: Abstraction has 139939 states and 236475 transitions. [2019-10-03 02:43:11,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:43:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 139939 states and 236475 transitions. [2019-10-03 02:43:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-03 02:43:11,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:11,053 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:11,053 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:11,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:11,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1095761754, now seen corresponding path program 1 times [2019-10-03 02:43:11,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:11,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:11,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:11,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:11,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:43:11,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:11,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:43:11,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:11,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:43:11,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:43:11,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:43:11,950 INFO L87 Difference]: Start difference. First operand 139939 states and 236475 transitions. Second operand 6 states. [2019-10-03 02:43:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:13,924 INFO L93 Difference]: Finished difference Result 177396 states and 298738 transitions. [2019-10-03 02:43:13,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:43:13,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-10-03 02:43:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:15,134 INFO L225 Difference]: With dead ends: 177396 [2019-10-03 02:43:15,134 INFO L226 Difference]: Without dead ends: 177396 [2019-10-03 02:43:15,134 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:43:15,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177396 states. [2019-10-03 02:43:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177396 to 169198. [2019-10-03 02:43:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169198 states. [2019-10-03 02:43:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169198 states to 169198 states and 285872 transitions. [2019-10-03 02:43:26,448 INFO L78 Accepts]: Start accepts. Automaton has 169198 states and 285872 transitions. Word has length 164 [2019-10-03 02:43:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:26,448 INFO L475 AbstractCegarLoop]: Abstraction has 169198 states and 285872 transitions. [2019-10-03 02:43:26,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:43:26,449 INFO L276 IsEmpty]: Start isEmpty. Operand 169198 states and 285872 transitions. [2019-10-03 02:43:26,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-03 02:43:26,454 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:26,454 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:26,454 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:26,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:26,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1797361628, now seen corresponding path program 1 times [2019-10-03 02:43:26,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:26,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:26,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:26,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:26,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:43:26,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:26,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:43:26,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:26,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:43:26,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:43:26,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:43:26,567 INFO L87 Difference]: Start difference. First operand 169198 states and 285872 transitions. Second operand 4 states. [2019-10-03 02:43:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:39,582 INFO L93 Difference]: Finished difference Result 419403 states and 810598 transitions. [2019-10-03 02:43:39,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:43:39,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-03 02:43:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:43,122 INFO L225 Difference]: With dead ends: 419403 [2019-10-03 02:43:43,122 INFO L226 Difference]: Without dead ends: 419403 [2019-10-03 02:43:43,122 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:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419403 states. [2019-10-03 02:43:54,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419403 to 409511. [2019-10-03 02:43:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409511 states. [2019-10-03 02:44:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409511 states to 409511 states and 783011 transitions. [2019-10-03 02:44:11,171 INFO L78 Accepts]: Start accepts. Automaton has 409511 states and 783011 transitions. Word has length 164 [2019-10-03 02:44:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:11,171 INFO L475 AbstractCegarLoop]: Abstraction has 409511 states and 783011 transitions. [2019-10-03 02:44:11,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 409511 states and 783011 transitions. [2019-10-03 02:44:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-03 02:44:11,179 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:11,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:11,179 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:11,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:11,180 INFO L82 PathProgramCache]: Analyzing trace with hash 600645997, now seen corresponding path program 1 times [2019-10-03 02:44:11,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:11,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:11,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:11,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:11,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:44:11,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:11,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:11,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:11,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:11,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:11,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:11,310 INFO L87 Difference]: Start difference. First operand 409511 states and 783011 transitions. Second operand 4 states. [2019-10-03 02:45:00,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:45:00,603 INFO L93 Difference]: Finished difference Result 1051477 states and 2424699 transitions. [2019-10-03 02:45:00,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:45:00,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-10-03 02:45:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:45:11,947 INFO L225 Difference]: With dead ends: 1051477 [2019-10-03 02:45:11,947 INFO L226 Difference]: Without dead ends: 1051477 [2019-10-03 02:45:11,948 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:45:12,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051477 states.