java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:10:53,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:10:53,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:10:53,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:10:53,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:10:53,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:10:53,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:10:53,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:10:53,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:10:53,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:10:53,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:10:53,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:10:53,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:10:53,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:10:53,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:10:53,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:10:53,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:10:53,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:10:53,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:10:53,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:10:53,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:10:53,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:10:53,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:10:53,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:10:53,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:10:53,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:10:53,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:10:53,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:10:53,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:10:53,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:10:53,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:10:53,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:10:53,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:10:53,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:10:53,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:10:53,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:10:53,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:10:53,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:10:53,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:10:53,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:10:53,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:10:53,867 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:10:53,891 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:10:53,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:10:53,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:10:53,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:10:53,893 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:10:53,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:10:53,898 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:10:53,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:10:53,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:10:53,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:10:53,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:10:53,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:10:53,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:10:53,900 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:10:53,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:10:53,900 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:10:53,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:10:53,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:10:53,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:10:53,901 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:10:53,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:10:53,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:53,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:10:53,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:10:53,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:10:53,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:10:53,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:10:53,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:10:53,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:10:54,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:10:54,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:10:54,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:10:54,239 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:10:54,240 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:10:54,240 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product23.cil.c [2019-10-13 21:10:54,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb64d9f19/8e1e2f8ce07a430689091f29621794fa/FLAGabe93a545 [2019-10-13 21:10:54,922 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:10:54,923 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product23.cil.c [2019-10-13 21:10:54,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb64d9f19/8e1e2f8ce07a430689091f29621794fa/FLAGabe93a545 [2019-10-13 21:10:55,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb64d9f19/8e1e2f8ce07a430689091f29621794fa [2019-10-13 21:10:55,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:10:55,119 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:10:55,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:55,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:10:55,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:10:55,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:55" (1/1) ... [2019-10-13 21:10:55,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8078c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:55, skipping insertion in model container [2019-10-13 21:10:55,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:55" (1/1) ... [2019-10-13 21:10:55,136 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:10:55,211 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:10:55,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:55,916 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:10:56,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:56,116 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:10:56,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56 WrapperNode [2019-10-13 21:10:56,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:56,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:10:56,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:10:56,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:10:56,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... [2019-10-13 21:10:56,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... [2019-10-13 21:10:56,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... [2019-10-13 21:10:56,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... [2019-10-13 21:10:56,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... [2019-10-13 21:10:56,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... [2019-10-13 21:10:56,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (1/1) ... [2019-10-13 21:10:56,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:10:56,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:10:56,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:10:56,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:10:56,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (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-13 21:10:56,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:10:56,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:10:56,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:56,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:56,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:56,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:56,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:56,393 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:10:56,393 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:10:56,394 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:10:56,394 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:10:56,394 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:10:56,395 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:10:56,396 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:10:56,396 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:10:56,396 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:10:56,399 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:10:56,399 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:10:56,399 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:10:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:56,400 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:10:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:10:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:10:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:10:56,401 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:10:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:10:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:10:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:10:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:10:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:10:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:10:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:10:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:10:56,403 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:10:56,404 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:10:56,404 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:10:56,404 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:10:56,404 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:10:56,404 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:10:56,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:10:56,405 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:10:56,405 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:10:56,405 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:10:56,405 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:10:56,405 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:10:56,405 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:10:56,406 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:10:56,406 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:10:56,406 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:10:56,406 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:10:56,406 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:10:56,407 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:10:56,407 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:10:56,407 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:10:56,407 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:10:56,407 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:10:56,407 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:10:56,408 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:10:56,408 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:10:56,408 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:10:56,409 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:10:56,409 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:10:56,409 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:10:56,410 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:10:56,410 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-13 21:10:56,410 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:10:56,410 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:10:56,410 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:10:56,411 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:10:56,411 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-13 21:10:56,411 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:56,412 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:10:56,412 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:10:56,412 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:10:56,412 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:10:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:10:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:10:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:10:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:10:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:10:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:10:56,415 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:10:56,415 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:10:56,416 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:56,416 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:56,417 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:56,417 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:56,417 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:10:56,417 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:10:56,417 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:10:56,418 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:10:56,418 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:10:56,418 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:10:56,418 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:10:56,418 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:10:56,419 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:10:56,419 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:10:56,419 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:10:56,419 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:10:56,419 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:10:56,420 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:10:56,420 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:10:56,420 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:56,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:10:56,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:10:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:10:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:10:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:10:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:10:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:10:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:10:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:10:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:10:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:10:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:10:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:10:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:10:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:10:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:10:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:10:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:10:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:10:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:10:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:10:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:10:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:10:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:10:56,428 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:10:56,429 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:10:56,429 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:10:56,429 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:10:56,430 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:10:56,433 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:10:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:10:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:10:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:10:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:10:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:10:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:10:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:10:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:10:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:10:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:10:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:10:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:10:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:10:56,445 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:10:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:10:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:10:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:10:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:10:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:10:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:10:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:10:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:10:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:10:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:10:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:10:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-13 21:10:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:10:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:10:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:10:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-13 21:10:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:10:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:10:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:10:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:10:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:10:56,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:10:58,901 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:10:58,901 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:10:58,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:58 BoogieIcfgContainer [2019-10-13 21:10:58,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:10:58,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:10:58,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:10:58,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:10:58,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:10:55" (1/3) ... [2019-10-13 21:10:58,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681d2d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:58, skipping insertion in model container [2019-10-13 21:10:58,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:56" (2/3) ... [2019-10-13 21:10:58,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681d2d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:58, skipping insertion in model container [2019-10-13 21:10:58,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:58" (3/3) ... [2019-10-13 21:10:58,913 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product23.cil.c [2019-10-13 21:10:58,922 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:10:58,934 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:10:58,945 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:10:58,996 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:10:58,996 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:10:58,996 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:10:58,996 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:10:58,997 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:10:58,997 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:10:58,997 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:10:58,997 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:10:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states. [2019-10-13 21:10:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:10:59,073 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:59,075 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:59,077 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:59,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash -425142213, now seen corresponding path program 1 times [2019-10-13 21:10:59,093 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:59,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763648718] [2019-10-13 21:10:59,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:59,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:59,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:59,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763648718] [2019-10-13 21:10:59,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:59,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:59,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808616722] [2019-10-13 21:10:59,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:59,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:59,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:59,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:59,816 INFO L87 Difference]: Start difference. First operand 801 states. Second operand 4 states. [2019-10-13 21:11:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:00,026 INFO L93 Difference]: Finished difference Result 1265 states and 2029 transitions. [2019-10-13 21:11:00,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:00,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-13 21:11:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:00,059 INFO L225 Difference]: With dead ends: 1265 [2019-10-13 21:11:00,059 INFO L226 Difference]: Without dead ends: 641 [2019-10-13 21:11:00,074 INFO L600 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-13 21:11:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-10-13 21:11:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-10-13 21:11:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-10-13 21:11:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1016 transitions. [2019-10-13 21:11:00,207 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1016 transitions. Word has length 133 [2019-10-13 21:11:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:00,208 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 1016 transitions. [2019-10-13 21:11:00,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1016 transitions. [2019-10-13 21:11:00,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:11:00,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:00,230 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:00,230 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:00,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:00,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1746655412, now seen corresponding path program 1 times [2019-10-13 21:11:00,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:00,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471080543] [2019-10-13 21:11:00,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:00,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:00,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:00,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471080543] [2019-10-13 21:11:00,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:00,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:00,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725698747] [2019-10-13 21:11:00,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:00,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:00,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:00,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:00,528 INFO L87 Difference]: Start difference. First operand 641 states and 1016 transitions. Second operand 4 states. [2019-10-13 21:11:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:00,640 INFO L93 Difference]: Finished difference Result 1245 states and 1990 transitions. [2019-10-13 21:11:00,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:00,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-13 21:11:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:00,653 INFO L225 Difference]: With dead ends: 1245 [2019-10-13 21:11:00,653 INFO L226 Difference]: Without dead ends: 641 [2019-10-13 21:11:00,670 INFO L600 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-13 21:11:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-10-13 21:11:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-10-13 21:11:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-10-13 21:11:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1015 transitions. [2019-10-13 21:11:00,734 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1015 transitions. Word has length 136 [2019-10-13 21:11:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:00,734 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 1015 transitions. [2019-10-13 21:11:00,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1015 transitions. [2019-10-13 21:11:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:11:00,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:00,787 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:00,787 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:00,787 INFO L82 PathProgramCache]: Analyzing trace with hash -323937366, now seen corresponding path program 1 times [2019-10-13 21:11:00,788 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:00,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528615784] [2019-10-13 21:11:00,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:00,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:00,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:01,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528615784] [2019-10-13 21:11:01,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:01,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:01,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24730] [2019-10-13 21:11:01,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:01,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:01,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:01,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:01,017 INFO L87 Difference]: Start difference. First operand 641 states and 1015 transitions. Second operand 4 states. [2019-10-13 21:11:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:01,088 INFO L93 Difference]: Finished difference Result 1245 states and 1989 transitions. [2019-10-13 21:11:01,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:01,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-13 21:11:01,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:01,096 INFO L225 Difference]: With dead ends: 1245 [2019-10-13 21:11:01,096 INFO L226 Difference]: Without dead ends: 641 [2019-10-13 21:11:01,100 INFO L600 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-13 21:11:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-10-13 21:11:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-10-13 21:11:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-10-13 21:11:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1014 transitions. [2019-10-13 21:11:01,146 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1014 transitions. Word has length 137 [2019-10-13 21:11:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:01,146 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 1014 transitions. [2019-10-13 21:11:01,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1014 transitions. [2019-10-13 21:11:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:11:01,153 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:01,153 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:01,153 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1604183312, now seen corresponding path program 1 times [2019-10-13 21:11:01,154 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:01,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579016569] [2019-10-13 21:11:01,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:01,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:01,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:01,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579016569] [2019-10-13 21:11:01,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:01,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:01,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393532628] [2019-10-13 21:11:01,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:01,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:01,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:01,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:01,317 INFO L87 Difference]: Start difference. First operand 641 states and 1014 transitions. Second operand 4 states. [2019-10-13 21:11:01,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:01,394 INFO L93 Difference]: Finished difference Result 1245 states and 1988 transitions. [2019-10-13 21:11:01,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:01,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-13 21:11:01,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:01,400 INFO L225 Difference]: With dead ends: 1245 [2019-10-13 21:11:01,400 INFO L226 Difference]: Without dead ends: 641 [2019-10-13 21:11:01,403 INFO L600 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-13 21:11:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-10-13 21:11:01,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-10-13 21:11:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-10-13 21:11:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1013 transitions. [2019-10-13 21:11:01,428 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1013 transitions. Word has length 138 [2019-10-13 21:11:01,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:01,428 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 1013 transitions. [2019-10-13 21:11:01,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1013 transitions. [2019-10-13 21:11:01,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:11:01,434 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:01,434 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:01,434 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:01,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:01,435 INFO L82 PathProgramCache]: Analyzing trace with hash 141486054, now seen corresponding path program 1 times [2019-10-13 21:11:01,435 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:01,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808439984] [2019-10-13 21:11:01,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:01,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:01,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:01,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808439984] [2019-10-13 21:11:01,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:01,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:01,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619835297] [2019-10-13 21:11:01,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:01,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:01,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:01,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:01,638 INFO L87 Difference]: Start difference. First operand 641 states and 1013 transitions. Second operand 4 states. [2019-10-13 21:11:01,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:01,718 INFO L93 Difference]: Finished difference Result 1245 states and 1987 transitions. [2019-10-13 21:11:01,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:01,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-13 21:11:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:01,733 INFO L225 Difference]: With dead ends: 1245 [2019-10-13 21:11:01,733 INFO L226 Difference]: Without dead ends: 641 [2019-10-13 21:11:01,741 INFO L600 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-13 21:11:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-10-13 21:11:01,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-10-13 21:11:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-10-13 21:11:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1012 transitions. [2019-10-13 21:11:01,771 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1012 transitions. Word has length 139 [2019-10-13 21:11:01,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:01,772 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 1012 transitions. [2019-10-13 21:11:01,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1012 transitions. [2019-10-13 21:11:01,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:11:01,777 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:01,778 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:01,778 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:01,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:01,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1201249580, now seen corresponding path program 1 times [2019-10-13 21:11:01,781 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:01,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897639169] [2019-10-13 21:11:01,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:01,781 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:01,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:01,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897639169] [2019-10-13 21:11:02,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:02,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:11:02,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000325267] [2019-10-13 21:11:02,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:11:02,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:02,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:11:02,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:11:02,005 INFO L87 Difference]: Start difference. First operand 641 states and 1012 transitions. Second operand 10 states. [2019-10-13 21:11:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:02,209 INFO L93 Difference]: Finished difference Result 1203 states and 1907 transitions. [2019-10-13 21:11:02,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:02,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-13 21:11:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:02,218 INFO L225 Difference]: With dead ends: 1203 [2019-10-13 21:11:02,218 INFO L226 Difference]: Without dead ends: 650 [2019-10-13 21:11:02,222 INFO L600 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-13 21:11:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-13 21:11:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2019-10-13 21:11:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-13 21:11:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1021 transitions. [2019-10-13 21:11:02,263 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1021 transitions. Word has length 140 [2019-10-13 21:11:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:02,264 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1021 transitions. [2019-10-13 21:11:02,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:11:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1021 transitions. [2019-10-13 21:11:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:11:02,273 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:02,274 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:02,274 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:02,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1895896587, now seen corresponding path program 1 times [2019-10-13 21:11:02,275 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:02,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045960348] [2019-10-13 21:11:02,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:02,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045960348] [2019-10-13 21:11:02,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:02,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:02,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141953404] [2019-10-13 21:11:02,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:02,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:02,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:02,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:02,403 INFO L87 Difference]: Start difference. First operand 648 states and 1021 transitions. Second operand 4 states. [2019-10-13 21:11:02,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:02,537 INFO L93 Difference]: Finished difference Result 1251 states and 1993 transitions. [2019-10-13 21:11:02,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:02,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-13 21:11:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:02,545 INFO L225 Difference]: With dead ends: 1251 [2019-10-13 21:11:02,545 INFO L226 Difference]: Without dead ends: 635 [2019-10-13 21:11:02,548 INFO L600 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-13 21:11:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-13 21:11:02,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-13 21:11:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-13 21:11:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 998 transitions. [2019-10-13 21:11:02,575 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 998 transitions. Word has length 140 [2019-10-13 21:11:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:02,575 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 998 transitions. [2019-10-13 21:11:02,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 998 transitions. [2019-10-13 21:11:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:11:02,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:02,581 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:02,581 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:02,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:02,581 INFO L82 PathProgramCache]: Analyzing trace with hash 150537756, now seen corresponding path program 1 times [2019-10-13 21:11:02,582 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:02,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160546210] [2019-10-13 21:11:02,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:02,751 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:02,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160546210] [2019-10-13 21:11:02,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:02,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:02,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581601845] [2019-10-13 21:11:02,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:02,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:02,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:02,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:02,754 INFO L87 Difference]: Start difference. First operand 635 states and 998 transitions. Second operand 6 states. [2019-10-13 21:11:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:02,988 INFO L93 Difference]: Finished difference Result 1191 states and 1885 transitions. [2019-10-13 21:11:02,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:02,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-13 21:11:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:02,995 INFO L225 Difference]: With dead ends: 1191 [2019-10-13 21:11:02,995 INFO L226 Difference]: Without dead ends: 635 [2019-10-13 21:11:03,000 INFO L600 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-13 21:11:03,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-13 21:11:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-13 21:11:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-13 21:11:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 994 transitions. [2019-10-13 21:11:03,039 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 994 transitions. Word has length 141 [2019-10-13 21:11:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:03,041 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 994 transitions. [2019-10-13 21:11:03,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 994 transitions. [2019-10-13 21:11:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:11:03,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:03,047 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:03,047 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:03,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1298093967, now seen corresponding path program 1 times [2019-10-13 21:11:03,048 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:03,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272026906] [2019-10-13 21:11:03,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:03,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272026906] [2019-10-13 21:11:03,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:03,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:03,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554802529] [2019-10-13 21:11:03,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:03,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:03,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:03,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:03,225 INFO L87 Difference]: Start difference. First operand 635 states and 994 transitions. Second operand 6 states. [2019-10-13 21:11:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:03,471 INFO L93 Difference]: Finished difference Result 1191 states and 1881 transitions. [2019-10-13 21:11:03,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:03,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-13 21:11:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:03,479 INFO L225 Difference]: With dead ends: 1191 [2019-10-13 21:11:03,480 INFO L226 Difference]: Without dead ends: 635 [2019-10-13 21:11:03,483 INFO L600 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-13 21:11:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-13 21:11:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-13 21:11:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-13 21:11:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 990 transitions. [2019-10-13 21:11:03,522 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 990 transitions. Word has length 142 [2019-10-13 21:11:03,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:03,522 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 990 transitions. [2019-10-13 21:11:03,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 990 transitions. [2019-10-13 21:11:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:11:03,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:03,532 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:03,532 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:03,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:03,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2074658687, now seen corresponding path program 1 times [2019-10-13 21:11:03,533 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:03,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627989890] [2019-10-13 21:11:03,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:03,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627989890] [2019-10-13 21:11:03,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:03,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:03,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952597651] [2019-10-13 21:11:03,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:03,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:03,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:03,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:03,816 INFO L87 Difference]: Start difference. First operand 635 states and 990 transitions. Second operand 6 states. [2019-10-13 21:11:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:04,048 INFO L93 Difference]: Finished difference Result 1191 states and 1877 transitions. [2019-10-13 21:11:04,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:04,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-13 21:11:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:04,054 INFO L225 Difference]: With dead ends: 1191 [2019-10-13 21:11:04,054 INFO L226 Difference]: Without dead ends: 635 [2019-10-13 21:11:04,062 INFO L600 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-13 21:11:04,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-13 21:11:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-13 21:11:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-13 21:11:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 986 transitions. [2019-10-13 21:11:04,090 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 986 transitions. Word has length 143 [2019-10-13 21:11:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:04,090 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 986 transitions. [2019-10-13 21:11:04,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 986 transitions. [2019-10-13 21:11:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:11:04,096 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:04,097 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:04,097 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:04,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:04,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1020185343, now seen corresponding path program 1 times [2019-10-13 21:11:04,098 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:04,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469406271] [2019-10-13 21:11:04,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:04,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469406271] [2019-10-13 21:11:04,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:04,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:04,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206512460] [2019-10-13 21:11:04,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:04,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:04,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:04,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:04,272 INFO L87 Difference]: Start difference. First operand 635 states and 986 transitions. Second operand 7 states. [2019-10-13 21:11:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:04,365 INFO L93 Difference]: Finished difference Result 1191 states and 1873 transitions. [2019-10-13 21:11:04,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:04,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-13 21:11:04,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:04,373 INFO L225 Difference]: With dead ends: 1191 [2019-10-13 21:11:04,374 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 21:11:04,378 INFO L600 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-13 21:11:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 21:11:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-13 21:11:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-13 21:11:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 952 transitions. [2019-10-13 21:11:04,400 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 952 transitions. Word has length 143 [2019-10-13 21:11:04,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:04,400 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 952 transitions. [2019-10-13 21:11:04,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:04,401 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 952 transitions. [2019-10-13 21:11:04,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:11:04,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:04,406 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:04,406 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:04,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:04,407 INFO L82 PathProgramCache]: Analyzing trace with hash 451901908, now seen corresponding path program 1 times [2019-10-13 21:11:04,407 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:04,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669695461] [2019-10-13 21:11:04,407 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,407 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:04,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669695461] [2019-10-13 21:11:04,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:04,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:04,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957143775] [2019-10-13 21:11:04,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:04,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:04,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:04,569 INFO L87 Difference]: Start difference. First operand 614 states and 952 transitions. Second operand 6 states. [2019-10-13 21:11:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:04,671 INFO L93 Difference]: Finished difference Result 1170 states and 1839 transitions. [2019-10-13 21:11:04,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:04,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-13 21:11:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:04,678 INFO L225 Difference]: With dead ends: 1170 [2019-10-13 21:11:04,678 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 21:11:04,681 INFO L600 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-13 21:11:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 21:11:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-13 21:11:04,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-13 21:11:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 951 transitions. [2019-10-13 21:11:04,732 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 951 transitions. Word has length 144 [2019-10-13 21:11:04,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:04,733 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 951 transitions. [2019-10-13 21:11:04,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:04,733 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 951 transitions. [2019-10-13 21:11:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:11:04,738 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:04,739 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:04,739 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:04,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1173579494, now seen corresponding path program 1 times [2019-10-13 21:11:04,740 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:04,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061173073] [2019-10-13 21:11:04,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:04,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:04,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061173073] [2019-10-13 21:11:04,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:04,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:04,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042962845] [2019-10-13 21:11:04,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:04,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:04,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:04,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:04,883 INFO L87 Difference]: Start difference. First operand 614 states and 951 transitions. Second operand 6 states. [2019-10-13 21:11:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:05,005 INFO L93 Difference]: Finished difference Result 1170 states and 1838 transitions. [2019-10-13 21:11:05,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:05,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-13 21:11:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:05,013 INFO L225 Difference]: With dead ends: 1170 [2019-10-13 21:11:05,014 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 21:11:05,018 INFO L600 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-13 21:11:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 21:11:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-13 21:11:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-13 21:11:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 950 transitions. [2019-10-13 21:11:05,056 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 950 transitions. Word has length 145 [2019-10-13 21:11:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:05,058 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 950 transitions. [2019-10-13 21:11:05,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 950 transitions. [2019-10-13 21:11:05,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:11:05,065 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:05,065 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:05,066 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:05,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:05,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1778458649, now seen corresponding path program 1 times [2019-10-13 21:11:05,066 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:05,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593808777] [2019-10-13 21:11:05,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:05,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:05,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:05,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593808777] [2019-10-13 21:11:05,302 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:05,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:11:05,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973301350] [2019-10-13 21:11:05,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:11:05,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:05,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:11:05,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:05,304 INFO L87 Difference]: Start difference. First operand 614 states and 950 transitions. Second operand 12 states. [2019-10-13 21:11:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:05,493 INFO L93 Difference]: Finished difference Result 1171 states and 1837 transitions. [2019-10-13 21:11:05,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:11:05,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-13 21:11:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:05,498 INFO L225 Difference]: With dead ends: 1171 [2019-10-13 21:11:05,499 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 21:11:05,503 INFO L600 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-13 21:11:05,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 21:11:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-13 21:11:05,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-13 21:11:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 949 transitions. [2019-10-13 21:11:05,526 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 949 transitions. Word has length 146 [2019-10-13 21:11:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:05,526 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 949 transitions. [2019-10-13 21:11:05,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:11:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 949 transitions. [2019-10-13 21:11:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:11:05,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:05,532 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:05,532 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:05,533 INFO L82 PathProgramCache]: Analyzing trace with hash -15461549, now seen corresponding path program 1 times [2019-10-13 21:11:05,533 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:05,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675897783] [2019-10-13 21:11:05,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:05,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:05,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 21:11:05,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675897783] [2019-10-13 21:11:05,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997866649] [2019-10-13 21:11:05,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:06,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 2771 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:11:06,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:06,480 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:07,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:07,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:11:07,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 18 [2019-10-13 21:11:07,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631809490] [2019-10-13 21:11:07,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:07,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:07,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:07,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:11:07,286 INFO L87 Difference]: Start difference. First operand 614 states and 949 transitions. Second operand 5 states. [2019-10-13 21:11:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:08,295 INFO L93 Difference]: Finished difference Result 1170 states and 1865 transitions. [2019-10-13 21:11:08,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:08,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 21:11:08,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:08,302 INFO L225 Difference]: With dead ends: 1170 [2019-10-13 21:11:08,302 INFO L226 Difference]: Without dead ends: 622 [2019-10-13 21:11:08,312 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 293 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:11:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-13 21:11:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-10-13 21:11:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-10-13 21:11:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 962 transitions. [2019-10-13 21:11:08,354 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 962 transitions. Word has length 147 [2019-10-13 21:11:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:08,354 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 962 transitions. [2019-10-13 21:11:08,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:08,354 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 962 transitions. [2019-10-13 21:11:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:11:08,360 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:08,360 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:08,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:08,570 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:08,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:08,571 INFO L82 PathProgramCache]: Analyzing trace with hash 929312331, now seen corresponding path program 1 times [2019-10-13 21:11:08,572 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:08,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138514207] [2019-10-13 21:11:08,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:08,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:08,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:08,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138514207] [2019-10-13 21:11:08,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:08,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:08,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192124998] [2019-10-13 21:11:08,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:08,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:08,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:08,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:08,761 INFO L87 Difference]: Start difference. First operand 622 states and 962 transitions. Second operand 6 states. [2019-10-13 21:11:09,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:09,525 INFO L93 Difference]: Finished difference Result 1185 states and 1889 transitions. [2019-10-13 21:11:09,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:09,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-10-13 21:11:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:09,531 INFO L225 Difference]: With dead ends: 1185 [2019-10-13 21:11:09,531 INFO L226 Difference]: Without dead ends: 627 [2019-10-13 21:11:09,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:09,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-13 21:11:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-13 21:11:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-13 21:11:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 966 transitions. [2019-10-13 21:11:09,564 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 966 transitions. Word has length 149 [2019-10-13 21:11:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:09,564 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 966 transitions. [2019-10-13 21:11:09,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 966 transitions. [2019-10-13 21:11:09,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:11:09,569 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:09,569 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:09,570 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:09,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:09,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1155279277, now seen corresponding path program 1 times [2019-10-13 21:11:09,570 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:09,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645030395] [2019-10-13 21:11:09,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:09,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:09,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:11:09,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645030395] [2019-10-13 21:11:09,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403927933] [2019-10-13 21:11:09,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:10,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 2775 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:11:10,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:10,439 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:11,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:11:11,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 18 [2019-10-13 21:11:11,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132688228] [2019-10-13 21:11:11,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:11,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:11,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:11,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:11:11,152 INFO L87 Difference]: Start difference. First operand 627 states and 966 transitions. Second operand 5 states. [2019-10-13 21:11:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:12,056 INFO L93 Difference]: Finished difference Result 1196 states and 1893 transitions. [2019-10-13 21:11:12,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:12,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-13 21:11:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:12,061 INFO L225 Difference]: With dead ends: 1196 [2019-10-13 21:11:12,061 INFO L226 Difference]: Without dead ends: 635 [2019-10-13 21:11:12,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 301 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:11:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-13 21:11:12,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-13 21:11:12,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-13 21:11:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 979 transitions. [2019-10-13 21:11:12,090 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 979 transitions. Word has length 151 [2019-10-13 21:11:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:12,091 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 979 transitions. [2019-10-13 21:11:12,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:12,091 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 979 transitions. [2019-10-13 21:11:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:12,096 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:12,096 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:12,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:12,304 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:12,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:12,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1174728509, now seen corresponding path program 1 times [2019-10-13 21:11:12,305 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:12,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706269422] [2019-10-13 21:11:12,306 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:12,306 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:12,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:11:12,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706269422] [2019-10-13 21:11:12,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306581702] [2019-10-13 21:11:12,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:12,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 2777 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:11:12,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:13,075 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:13,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:11:13,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 17 [2019-10-13 21:11:13,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434655982] [2019-10-13 21:11:13,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:13,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:13,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:13,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:11:13,788 INFO L87 Difference]: Start difference. First operand 635 states and 979 transitions. Second operand 5 states. [2019-10-13 21:11:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:14,659 INFO L93 Difference]: Finished difference Result 1212 states and 1916 transitions. [2019-10-13 21:11:14,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:14,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-13 21:11:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:14,668 INFO L225 Difference]: With dead ends: 1212 [2019-10-13 21:11:14,668 INFO L226 Difference]: Without dead ends: 643 [2019-10-13 21:11:14,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 305 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:11:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-13 21:11:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-13 21:11:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-13 21:11:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 992 transitions. [2019-10-13 21:11:14,703 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 992 transitions. Word has length 153 [2019-10-13 21:11:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:14,704 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 992 transitions. [2019-10-13 21:11:14,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 992 transitions. [2019-10-13 21:11:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-13 21:11:14,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:14,709 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:14,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:14,920 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:14,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:14,920 INFO L82 PathProgramCache]: Analyzing trace with hash -658065581, now seen corresponding path program 1 times [2019-10-13 21:11:14,920 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:14,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063353724] [2019-10-13 21:11:14,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:14,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:14,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:11:15,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063353724] [2019-10-13 21:11:15,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925507160] [2019-10-13 21:11:15,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:15,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 2779 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:11:15,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:11:15,767 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:11:16,137 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:16,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [11] total 18 [2019-10-13 21:11:16,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895247534] [2019-10-13 21:11:16,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:11:16,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:16,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:11:16,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:11:16,139 INFO L87 Difference]: Start difference. First operand 643 states and 992 transitions. Second operand 9 states. [2019-10-13 21:11:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:17,097 INFO L93 Difference]: Finished difference Result 688 states and 1052 transitions. [2019-10-13 21:11:17,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:17,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-10-13 21:11:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:17,104 INFO L225 Difference]: With dead ends: 688 [2019-10-13 21:11:17,104 INFO L226 Difference]: Without dead ends: 671 [2019-10-13 21:11:17,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 313 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-10-13 21:11:17,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-10-13 21:11:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 657. [2019-10-13 21:11:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-13 21:11:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1011 transitions. [2019-10-13 21:11:17,147 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1011 transitions. Word has length 155 [2019-10-13 21:11:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:17,149 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1011 transitions. [2019-10-13 21:11:17,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:11:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1011 transitions. [2019-10-13 21:11:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:11:17,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:17,154 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:17,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:17,363 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:17,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:17,364 INFO L82 PathProgramCache]: Analyzing trace with hash 303357934, now seen corresponding path program 1 times [2019-10-13 21:11:17,364 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:17,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617167581] [2019-10-13 21:11:17,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,365 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:11:17,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617167581] [2019-10-13 21:11:17,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523473597] [2019-10-13 21:11:17,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:18,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:11:18,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:11:18,200 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:11:18,488 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:18,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [11] total 14 [2019-10-13 21:11:18,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561865193] [2019-10-13 21:11:18,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:18,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:18,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:18,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:11:18,489 INFO L87 Difference]: Start difference. First operand 657 states and 1011 transitions. Second operand 5 states. [2019-10-13 21:11:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:18,592 INFO L93 Difference]: Finished difference Result 674 states and 1031 transitions. [2019-10-13 21:11:18,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:18,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-13 21:11:18,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:18,597 INFO L225 Difference]: With dead ends: 674 [2019-10-13 21:11:18,597 INFO L226 Difference]: Without dead ends: 657 [2019-10-13 21:11:18,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 329 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:11:18,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-13 21:11:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-13 21:11:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-13 21:11:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1009 transitions. [2019-10-13 21:11:18,630 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1009 transitions. Word has length 161 [2019-10-13 21:11:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:18,630 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1009 transitions. [2019-10-13 21:11:18,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1009 transitions. [2019-10-13 21:11:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-13 21:11:18,635 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:18,635 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:11:18,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:18,841 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:18,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:18,841 INFO L82 PathProgramCache]: Analyzing trace with hash 215291242, now seen corresponding path program 1 times [2019-10-13 21:11:18,841 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:18,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776858164] [2019-10-13 21:11:18,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,842 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:11:19,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776858164] [2019-10-13 21:11:19,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382116735] [2019-10-13 21:11:19,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:19,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:11:19,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:19,749 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:20,287 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:20,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 18 [2019-10-13 21:11:20,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454357340] [2019-10-13 21:11:20,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:11:20,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:20,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:11:20,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:11:20,292 INFO L87 Difference]: Start difference. First operand 657 states and 1009 transitions. Second operand 9 states. [2019-10-13 21:11:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:25,237 INFO L93 Difference]: Finished difference Result 1924 states and 3037 transitions. [2019-10-13 21:11:25,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:11:25,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2019-10-13 21:11:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:25,245 INFO L225 Difference]: With dead ends: 1924 [2019-10-13 21:11:25,245 INFO L226 Difference]: Without dead ends: 1333 [2019-10-13 21:11:25,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:11:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2019-10-13 21:11:25,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1290. [2019-10-13 21:11:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2019-10-13 21:11:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 2025 transitions. [2019-10-13 21:11:25,309 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 2025 transitions. Word has length 179 [2019-10-13 21:11:25,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:25,310 INFO L462 AbstractCegarLoop]: Abstraction has 1290 states and 2025 transitions. [2019-10-13 21:11:25,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:11:25,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 2025 transitions. [2019-10-13 21:11:25,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-13 21:11:25,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:25,317 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:11:25,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:25,525 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:25,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash -208374248, now seen corresponding path program 1 times [2019-10-13 21:11:25,525 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:25,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809297541] [2019-10-13 21:11:25,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:25,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:25,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:11:25,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809297541] [2019-10-13 21:11:25,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202534146] [2019-10-13 21:11:25,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:26,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 2862 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:26,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:11:26,355 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:26,600 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:26,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-13 21:11:26,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303723403] [2019-10-13 21:11:26,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:26,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:26,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:26,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:26,604 INFO L87 Difference]: Start difference. First operand 1290 states and 2025 transitions. Second operand 3 states. [2019-10-13 21:11:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:26,797 INFO L93 Difference]: Finished difference Result 3088 states and 4920 transitions. [2019-10-13 21:11:26,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:26,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-10-13 21:11:26,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:26,810 INFO L225 Difference]: With dead ends: 3088 [2019-10-13 21:11:26,811 INFO L226 Difference]: Without dead ends: 1875 [2019-10-13 21:11:26,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 379 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:11:26,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2019-10-13 21:11:26,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1288. [2019-10-13 21:11:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-10-13 21:11:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 2017 transitions. [2019-10-13 21:11:26,902 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 2017 transitions. Word has length 184 [2019-10-13 21:11:26,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:26,903 INFO L462 AbstractCegarLoop]: Abstraction has 1288 states and 2017 transitions. [2019-10-13 21:11:26,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 2017 transitions. [2019-10-13 21:11:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-13 21:11:26,909 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:26,909 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:11:27,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:27,127 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:27,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:27,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1178411162, now seen corresponding path program 1 times [2019-10-13 21:11:27,128 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:27,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697877125] [2019-10-13 21:11:27,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:27,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:27,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:11:27,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697877125] [2019-10-13 21:11:27,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471860623] [2019-10-13 21:11:27,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:27,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 2861 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-13 21:11:27,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 21:11:28,044 INFO L321 TraceCheckSpWp]: Computing backward predicates...