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_product18.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:10:30,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:10:30,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:10:30,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:10:30,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:10:30,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:10:30,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:10:30,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:10:30,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:10:30,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:10:30,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:10:30,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:10:30,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:10:30,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:10:30,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:10:30,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:10:30,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:10:30,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:10:30,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:10:30,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:10:30,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:10:30,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:10:30,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:10:30,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:10:30,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:10:30,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:10:30,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:10:30,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:10:30,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:10:30,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:10:30,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:10:30,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:10:30,141 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:10:30,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:10:30,142 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:10:30,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:10:30,143 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:10:30,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:10:30,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:10:30,144 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:10:30,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:10:30,146 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:30,160 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:10:30,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:10:30,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:10:30,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:10:30,162 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:10:30,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:10:30,162 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:10:30,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:10:30,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:10:30,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:10:30,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:10:30,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:10:30,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:10:30,163 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:10:30,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:10:30,164 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:10:30,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:10:30,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:10:30,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:10:30,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:10:30,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:10:30,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:30,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:10:30,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:10:30,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:10:30,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:10:30,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:10:30,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:10:30,166 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:30,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:10:30,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:10:30,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:10:30,486 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:10:30,487 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:10:30,487 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product18.cil.c [2019-10-13 21:10:30,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7ce86a6/f9980d80e114464ea7dd584579d731cc/FLAGbb1955d61 [2019-10-13 21:10:31,145 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:10:31,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product18.cil.c [2019-10-13 21:10:31,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7ce86a6/f9980d80e114464ea7dd584579d731cc/FLAGbb1955d61 [2019-10-13 21:10:31,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7ce86a6/f9980d80e114464ea7dd584579d731cc [2019-10-13 21:10:31,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:10:31,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:10:31,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:31,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:10:31,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:10:31,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:31" (1/1) ... [2019-10-13 21:10:31,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259a0832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:31, skipping insertion in model container [2019-10-13 21:10:31,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:31" (1/1) ... [2019-10-13 21:10:31,360 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:10:31,452 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:10:32,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:32,329 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:10:32,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:32,615 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:10:32,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:32 WrapperNode [2019-10-13 21:10:32,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:32,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:10:32,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:10:32,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:10:32,639 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:32" (1/1) ... [2019-10-13 21:10:32,639 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:32" (1/1) ... [2019-10-13 21:10:32,690 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:32" (1/1) ... [2019-10-13 21:10:32,693 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:32" (1/1) ... [2019-10-13 21:10:32,793 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:32" (1/1) ... [2019-10-13 21:10:32,833 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:32" (1/1) ... [2019-10-13 21:10:32,850 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:32" (1/1) ... [2019-10-13 21:10:32,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:10:32,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:10:32,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:10:32,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:10:32,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:32" (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:32,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:10:32,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:10:32,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:32,942 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:10:32,942 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:10:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:10:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:10:32,944 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:10:32,944 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:10:32,945 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:10:32,945 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:10:32,945 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:10:32,945 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:10:32,946 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:10:32,947 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:10:32,947 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:10:32,949 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:10:32,949 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:10:32,950 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:10:32,950 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:10:32,950 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:10:32,950 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:10:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:10:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:10:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:10:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:10:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:10:32,952 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:10:32,952 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:10:32,952 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:10:32,952 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:10:32,953 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:10:32,953 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:32,953 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:10:32,953 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:10:32,953 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2019-10-13 21:10:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:10:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__weight [2019-10-13 21:10:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:10:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:10:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:10:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:32,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:32,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:32,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:10:32,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:10:32,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:10:32,955 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:10:32,956 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:10:32,956 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:10:32,956 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:10:32,956 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:10:32,956 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:10:32,956 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:10:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:10:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:10:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:10:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:10:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:10:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:10:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:10:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:10:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:10:32,959 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:10:32,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:32,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:32,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:32,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:32,960 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:10:32,960 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:10:32,961 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:10:32,961 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:10:32,961 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:10:32,962 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:10:32,962 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:10:32,962 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:10:32,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:10:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:10:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:10:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:10:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:10:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:10:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:10:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:10:32,965 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:10:32,965 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:10:32,965 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:10:32,966 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:10:32,966 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:10:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:10:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:10:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:10:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:10:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:10:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:10:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:10:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:10:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:10:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:10:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:10:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:10:32,969 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:10:32,969 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:10:32,969 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:10:32,969 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:10:32,969 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:10:32,970 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:10:32,970 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:10:32,970 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:10:32,970 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:10:32,970 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:10:32,970 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:10:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:10:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:10:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:10:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:10:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:10:32,972 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:10:32,972 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:10:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:10:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:10:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2019-10-13 21:10:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__weight [2019-10-13 21:10:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:10:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:10:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:10:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:10:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:10:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:10:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:10:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:10:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:10:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:10:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:10:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:10:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:10:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:10:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:10:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:10:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:10:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:10:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:10:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:10:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:10:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:10:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:10:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:10:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:10:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:10:32,980 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:10:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:10:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:10:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:10:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:10:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:10:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:10:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:10:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:10:35,193 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:10:35,194 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:10:35,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:35 BoogieIcfgContainer [2019-10-13 21:10:35,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:10:35,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:10:35,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:10:35,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:10:35,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:10:31" (1/3) ... [2019-10-13 21:10:35,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60948aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:35, skipping insertion in model container [2019-10-13 21:10:35,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:32" (2/3) ... [2019-10-13 21:10:35,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60948aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:35, skipping insertion in model container [2019-10-13 21:10:35,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:35" (3/3) ... [2019-10-13 21:10:35,208 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product18.cil.c [2019-10-13 21:10:35,220 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:10:35,232 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:10:35,246 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:10:35,299 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:10:35,300 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:10:35,300 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:10:35,300 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:10:35,300 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:10:35,300 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:10:35,300 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:10:35,301 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:10:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2019-10-13 21:10:35,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-13 21:10:35,376 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:35,377 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:35,380 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:35,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:35,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1188892362, now seen corresponding path program 1 times [2019-10-13 21:10:35,399 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:35,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404896766] [2019-10-13 21:10:35,400 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:35,400 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:35,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:36,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404896766] [2019-10-13 21:10:36,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:36,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:36,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323038780] [2019-10-13 21:10:36,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:36,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:36,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:36,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:36,180 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 4 states. [2019-10-13 21:10:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:36,429 INFO L93 Difference]: Finished difference Result 1165 states and 1897 transitions. [2019-10-13 21:10:36,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:36,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-13 21:10:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:36,477 INFO L225 Difference]: With dead ends: 1165 [2019-10-13 21:10:36,478 INFO L226 Difference]: Without dead ends: 591 [2019-10-13 21:10:36,496 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:10:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-13 21:10:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-13 21:10:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-13 21:10:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 950 transitions. [2019-10-13 21:10:36,638 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 950 transitions. Word has length 85 [2019-10-13 21:10:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:36,638 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 950 transitions. [2019-10-13 21:10:36,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 950 transitions. [2019-10-13 21:10:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 21:10:36,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:36,645 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:36,645 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:36,646 INFO L82 PathProgramCache]: Analyzing trace with hash -425590234, now seen corresponding path program 1 times [2019-10-13 21:10:36,647 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:36,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675534974] [2019-10-13 21:10:36,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:36,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:36,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:36,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675534974] [2019-10-13 21:10:36,849 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:36,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:36,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164615073] [2019-10-13 21:10:36,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:36,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:36,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:36,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:36,853 INFO L87 Difference]: Start difference. First operand 591 states and 950 transitions. Second operand 4 states. [2019-10-13 21:10:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:36,938 INFO L93 Difference]: Finished difference Result 1145 states and 1858 transitions. [2019-10-13 21:10:36,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:36,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-13 21:10:36,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:36,945 INFO L225 Difference]: With dead ends: 1145 [2019-10-13 21:10:36,946 INFO L226 Difference]: Without dead ends: 591 [2019-10-13 21:10:36,950 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:10:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-13 21:10:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-13 21:10:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-13 21:10:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 949 transitions. [2019-10-13 21:10:37,002 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 949 transitions. Word has length 88 [2019-10-13 21:10:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:37,003 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 949 transitions. [2019-10-13 21:10:37,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 949 transitions. [2019-10-13 21:10:37,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:10:37,007 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:37,007 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:37,007 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:37,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:37,008 INFO L82 PathProgramCache]: Analyzing trace with hash -737262235, now seen corresponding path program 1 times [2019-10-13 21:10:37,008 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:37,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381502050] [2019-10-13 21:10:37,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:37,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381502050] [2019-10-13 21:10:37,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:37,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:37,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658903391] [2019-10-13 21:10:37,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:37,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:37,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:37,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:37,221 INFO L87 Difference]: Start difference. First operand 591 states and 949 transitions. Second operand 4 states. [2019-10-13 21:10:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:37,292 INFO L93 Difference]: Finished difference Result 1145 states and 1857 transitions. [2019-10-13 21:10:37,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:37,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-13 21:10:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:37,299 INFO L225 Difference]: With dead ends: 1145 [2019-10-13 21:10:37,299 INFO L226 Difference]: Without dead ends: 591 [2019-10-13 21:10:37,304 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:10:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-13 21:10:37,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-13 21:10:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-13 21:10:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 948 transitions. [2019-10-13 21:10:37,334 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 948 transitions. Word has length 89 [2019-10-13 21:10:37,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:37,335 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 948 transitions. [2019-10-13 21:10:37,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:37,335 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 948 transitions. [2019-10-13 21:10:37,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:10:37,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:37,338 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:37,338 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:37,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:37,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1727810174, now seen corresponding path program 1 times [2019-10-13 21:10:37,339 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:37,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421333156] [2019-10-13 21:10:37,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:37,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421333156] [2019-10-13 21:10:37,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:37,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:37,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696699538] [2019-10-13 21:10:37,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:37,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:37,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:37,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:37,521 INFO L87 Difference]: Start difference. First operand 591 states and 948 transitions. Second operand 4 states. [2019-10-13 21:10:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:37,620 INFO L93 Difference]: Finished difference Result 1145 states and 1856 transitions. [2019-10-13 21:10:37,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:37,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-13 21:10:37,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:37,628 INFO L225 Difference]: With dead ends: 1145 [2019-10-13 21:10:37,629 INFO L226 Difference]: Without dead ends: 591 [2019-10-13 21:10:37,632 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:10:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-13 21:10:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-13 21:10:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-13 21:10:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 947 transitions. [2019-10-13 21:10:37,666 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 947 transitions. Word has length 90 [2019-10-13 21:10:37,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:37,667 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 947 transitions. [2019-10-13 21:10:37,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 947 transitions. [2019-10-13 21:10:37,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 21:10:37,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:37,671 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:37,672 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:37,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:37,672 INFO L82 PathProgramCache]: Analyzing trace with hash 2006291585, now seen corresponding path program 1 times [2019-10-13 21:10:37,672 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:37,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459837919] [2019-10-13 21:10:37,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:37,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459837919] [2019-10-13 21:10:37,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:37,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:37,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622629479] [2019-10-13 21:10:37,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:37,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:37,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:37,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:37,809 INFO L87 Difference]: Start difference. First operand 591 states and 947 transitions. Second operand 4 states. [2019-10-13 21:10:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:37,865 INFO L93 Difference]: Finished difference Result 1145 states and 1855 transitions. [2019-10-13 21:10:37,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:37,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-13 21:10:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:37,872 INFO L225 Difference]: With dead ends: 1145 [2019-10-13 21:10:37,872 INFO L226 Difference]: Without dead ends: 591 [2019-10-13 21:10:37,876 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:10:37,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-13 21:10:37,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-13 21:10:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-13 21:10:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 946 transitions. [2019-10-13 21:10:37,903 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 946 transitions. Word has length 91 [2019-10-13 21:10:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:37,903 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 946 transitions. [2019-10-13 21:10:37,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 946 transitions. [2019-10-13 21:10:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:10:37,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:37,907 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:37,907 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:37,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:37,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1880678622, now seen corresponding path program 1 times [2019-10-13 21:10:37,910 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:37,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421747164] [2019-10-13 21:10:37,910 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,911 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:38,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421747164] [2019-10-13 21:10:38,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:38,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:10:38,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174141038] [2019-10-13 21:10:38,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:10:38,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:38,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:10:38,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:10:38,151 INFO L87 Difference]: Start difference. First operand 591 states and 946 transitions. Second operand 10 states. [2019-10-13 21:10:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:38,319 INFO L93 Difference]: Finished difference Result 1103 states and 1775 transitions. [2019-10-13 21:10:38,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:10:38,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-13 21:10:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:38,326 INFO L225 Difference]: With dead ends: 1103 [2019-10-13 21:10:38,326 INFO L226 Difference]: Without dead ends: 600 [2019-10-13 21:10:38,331 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:10:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-13 21:10:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2019-10-13 21:10:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:10:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 955 transitions. [2019-10-13 21:10:38,365 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 955 transitions. Word has length 92 [2019-10-13 21:10:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:38,368 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 955 transitions. [2019-10-13 21:10:38,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:10:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 955 transitions. [2019-10-13 21:10:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:10:38,370 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:38,370 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:38,371 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:38,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:38,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1901015997, now seen corresponding path program 1 times [2019-10-13 21:10:38,371 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:38,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079330014] [2019-10-13 21:10:38,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:38,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:38,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:38,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079330014] [2019-10-13 21:10:38,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:38,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:38,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742789352] [2019-10-13 21:10:38,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:38,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:38,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:38,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:38,494 INFO L87 Difference]: Start difference. First operand 598 states and 955 transitions. Second operand 4 states. [2019-10-13 21:10:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:38,559 INFO L93 Difference]: Finished difference Result 1151 states and 1861 transitions. [2019-10-13 21:10:38,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:38,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-13 21:10:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:38,569 INFO L225 Difference]: With dead ends: 1151 [2019-10-13 21:10:38,569 INFO L226 Difference]: Without dead ends: 585 [2019-10-13 21:10:38,573 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:10:38,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-13 21:10:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-13 21:10:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-13 21:10:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 932 transitions. [2019-10-13 21:10:38,607 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 932 transitions. Word has length 92 [2019-10-13 21:10:38,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:38,608 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 932 transitions. [2019-10-13 21:10:38,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 932 transitions. [2019-10-13 21:10:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 21:10:38,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:38,612 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:38,612 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:38,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1516088769, now seen corresponding path program 1 times [2019-10-13 21:10:38,613 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:38,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249341192] [2019-10-13 21:10:38,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:38,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:38,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:38,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249341192] [2019-10-13 21:10:38,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:38,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:38,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545814823] [2019-10-13 21:10:38,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:38,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:38,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:38,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:38,893 INFO L87 Difference]: Start difference. First operand 585 states and 932 transitions. Second operand 6 states. [2019-10-13 21:10:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:39,118 INFO L93 Difference]: Finished difference Result 1091 states and 1753 transitions. [2019-10-13 21:10:39,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:39,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-13 21:10:39,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:39,124 INFO L225 Difference]: With dead ends: 1091 [2019-10-13 21:10:39,124 INFO L226 Difference]: Without dead ends: 585 [2019-10-13 21:10:39,128 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:10:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-13 21:10:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-13 21:10:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-13 21:10:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 928 transitions. [2019-10-13 21:10:39,156 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 928 transitions. Word has length 93 [2019-10-13 21:10:39,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:39,156 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 928 transitions. [2019-10-13 21:10:39,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 928 transitions. [2019-10-13 21:10:39,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:10:39,158 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:39,162 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:39,163 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:39,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:39,163 INFO L82 PathProgramCache]: Analyzing trace with hash 645733217, now seen corresponding path program 1 times [2019-10-13 21:10:39,163 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:39,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580546963] [2019-10-13 21:10:39,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:39,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580546963] [2019-10-13 21:10:39,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:39,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:39,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316800977] [2019-10-13 21:10:39,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:39,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:39,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:39,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:39,327 INFO L87 Difference]: Start difference. First operand 585 states and 928 transitions. Second operand 6 states. [2019-10-13 21:10:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:39,537 INFO L93 Difference]: Finished difference Result 1091 states and 1749 transitions. [2019-10-13 21:10:39,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:39,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-13 21:10:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:39,544 INFO L225 Difference]: With dead ends: 1091 [2019-10-13 21:10:39,544 INFO L226 Difference]: Without dead ends: 585 [2019-10-13 21:10:39,547 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:10:39,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-13 21:10:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-13 21:10:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-13 21:10:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 924 transitions. [2019-10-13 21:10:39,573 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 924 transitions. Word has length 94 [2019-10-13 21:10:39,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:39,574 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 924 transitions. [2019-10-13 21:10:39,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:39,574 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 924 transitions. [2019-10-13 21:10:39,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:10:39,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:39,576 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:39,576 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:39,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:39,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1096058748, now seen corresponding path program 1 times [2019-10-13 21:10:39,577 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:39,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789412065] [2019-10-13 21:10:39,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:39,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789412065] [2019-10-13 21:10:39,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:39,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:39,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673588598] [2019-10-13 21:10:39,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:39,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:39,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:39,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:39,729 INFO L87 Difference]: Start difference. First operand 585 states and 924 transitions. Second operand 6 states. [2019-10-13 21:10:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:39,960 INFO L93 Difference]: Finished difference Result 1091 states and 1745 transitions. [2019-10-13 21:10:39,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:39,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-13 21:10:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:39,966 INFO L225 Difference]: With dead ends: 1091 [2019-10-13 21:10:39,966 INFO L226 Difference]: Without dead ends: 585 [2019-10-13 21:10:39,969 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:10:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-13 21:10:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-13 21:10:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-13 21:10:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 920 transitions. [2019-10-13 21:10:39,989 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 920 transitions. Word has length 95 [2019-10-13 21:10:39,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:39,990 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 920 transitions. [2019-10-13 21:10:39,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 920 transitions. [2019-10-13 21:10:39,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:10:39,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:39,992 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:39,992 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:39,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:39,993 INFO L82 PathProgramCache]: Analyzing trace with hash -48204540, now seen corresponding path program 1 times [2019-10-13 21:10:39,993 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:39,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965013335] [2019-10-13 21:10:39,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:40,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965013335] [2019-10-13 21:10:40,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:40,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:10:40,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419363608] [2019-10-13 21:10:40,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:10:40,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:40,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:10:40,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:10:40,118 INFO L87 Difference]: Start difference. First operand 585 states and 920 transitions. Second operand 7 states. [2019-10-13 21:10:40,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:40,207 INFO L93 Difference]: Finished difference Result 1091 states and 1741 transitions. [2019-10-13 21:10:40,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:10:40,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-13 21:10:40,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:40,214 INFO L225 Difference]: With dead ends: 1091 [2019-10-13 21:10:40,214 INFO L226 Difference]: Without dead ends: 564 [2019-10-13 21:10:40,217 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:10:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-13 21:10:40,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-10-13 21:10:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-13 21:10:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 886 transitions. [2019-10-13 21:10:40,241 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 886 transitions. Word has length 95 [2019-10-13 21:10:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,242 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 886 transitions. [2019-10-13 21:10:40,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:10:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 886 transitions. [2019-10-13 21:10:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:10:40,244 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,244 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:40,244 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,245 INFO L82 PathProgramCache]: Analyzing trace with hash 704168390, now seen corresponding path program 1 times [2019-10-13 21:10:40,245 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537815997] [2019-10-13 21:10:40,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:40,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537815997] [2019-10-13 21:10:40,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:40,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:40,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771035913] [2019-10-13 21:10:40,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:40,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:40,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:40,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:40,365 INFO L87 Difference]: Start difference. First operand 564 states and 886 transitions. Second operand 6 states. [2019-10-13 21:10:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:40,463 INFO L93 Difference]: Finished difference Result 1070 states and 1707 transitions. [2019-10-13 21:10:40,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:40,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-13 21:10:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:40,468 INFO L225 Difference]: With dead ends: 1070 [2019-10-13 21:10:40,469 INFO L226 Difference]: Without dead ends: 564 [2019-10-13 21:10:40,471 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:10:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-13 21:10:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-10-13 21:10:40,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-13 21:10:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 885 transitions. [2019-10-13 21:10:40,490 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 885 transitions. Word has length 96 [2019-10-13 21:10:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,491 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 885 transitions. [2019-10-13 21:10:40,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 885 transitions. [2019-10-13 21:10:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:10:40,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,493 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:40,493 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,494 INFO L82 PathProgramCache]: Analyzing trace with hash 637838025, now seen corresponding path program 1 times [2019-10-13 21:10:40,494 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867866631] [2019-10-13 21:10:40,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:40,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867866631] [2019-10-13 21:10:40,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:40,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:40,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212427263] [2019-10-13 21:10:40,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:40,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:40,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:40,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:40,616 INFO L87 Difference]: Start difference. First operand 564 states and 885 transitions. Second operand 6 states. [2019-10-13 21:10:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:40,739 INFO L93 Difference]: Finished difference Result 1070 states and 1706 transitions. [2019-10-13 21:10:40,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:40,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-13 21:10:40,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:40,747 INFO L225 Difference]: With dead ends: 1070 [2019-10-13 21:10:40,748 INFO L226 Difference]: Without dead ends: 564 [2019-10-13 21:10:40,752 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:10:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-13 21:10:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-10-13 21:10:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-13 21:10:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 884 transitions. [2019-10-13 21:10:40,839 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 884 transitions. Word has length 97 [2019-10-13 21:10:40,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,840 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 884 transitions. [2019-10-13 21:10:40,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:40,840 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 884 transitions. [2019-10-13 21:10:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:10:40,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,844 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:40,844 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1457200085, now seen corresponding path program 1 times [2019-10-13 21:10:40,845 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850693666] [2019-10-13 21:10:40,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:41,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850693666] [2019-10-13 21:10:41,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:41,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:10:41,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006794518] [2019-10-13 21:10:41,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:10:41,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:41,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:10:41,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:10:41,099 INFO L87 Difference]: Start difference. First operand 564 states and 884 transitions. Second operand 12 states. [2019-10-13 21:10:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:41,277 INFO L93 Difference]: Finished difference Result 1071 states and 1705 transitions. [2019-10-13 21:10:41,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:10:41,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-13 21:10:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:41,282 INFO L225 Difference]: With dead ends: 1071 [2019-10-13 21:10:41,282 INFO L226 Difference]: Without dead ends: 564 [2019-10-13 21:10:41,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:41,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-13 21:10:41,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-10-13 21:10:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-13 21:10:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 883 transitions. [2019-10-13 21:10:41,308 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 883 transitions. Word has length 98 [2019-10-13 21:10:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:41,308 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 883 transitions. [2019-10-13 21:10:41,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:10:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 883 transitions. [2019-10-13 21:10:41,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 21:10:41,310 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:41,310 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:41,311 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:41,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:41,311 INFO L82 PathProgramCache]: Analyzing trace with hash 910887794, now seen corresponding path program 1 times [2019-10-13 21:10:41,311 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:41,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240597983] [2019-10-13 21:10:41,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:41,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240597983] [2019-10-13 21:10:41,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:41,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:41,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627877744] [2019-10-13 21:10:41,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:41,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:41,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:41,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:41,471 INFO L87 Difference]: Start difference. First operand 564 states and 883 transitions. Second operand 6 states. [2019-10-13 21:10:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:45,311 INFO L93 Difference]: Finished difference Result 1670 states and 2699 transitions. [2019-10-13 21:10:45,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:45,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-13 21:10:45,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:45,322 INFO L225 Difference]: With dead ends: 1670 [2019-10-13 21:10:45,322 INFO L226 Difference]: Without dead ends: 1172 [2019-10-13 21:10:45,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:10:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2019-10-13 21:10:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1047. [2019-10-13 21:10:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-10-13 21:10:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1686 transitions. [2019-10-13 21:10:45,398 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1686 transitions. Word has length 99 [2019-10-13 21:10:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:45,399 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 1686 transitions. [2019-10-13 21:10:45,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1686 transitions. [2019-10-13 21:10:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 21:10:45,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:45,407 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:45,407 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:45,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:45,407 INFO L82 PathProgramCache]: Analyzing trace with hash 728641115, now seen corresponding path program 1 times [2019-10-13 21:10:45,408 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:45,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427238403] [2019-10-13 21:10:45,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:45,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:45,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:45,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427238403] [2019-10-13 21:10:45,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:45,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:10:45,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366092282] [2019-10-13 21:10:45,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:10:45,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:45,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:10:45,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:10:45,670 INFO L87 Difference]: Start difference. First operand 1047 states and 1686 transitions. Second operand 12 states. [2019-10-13 21:10:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:55,769 INFO L93 Difference]: Finished difference Result 3352 states and 5434 transitions. [2019-10-13 21:10:55,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-13 21:10:55,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 131 [2019-10-13 21:10:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:55,798 INFO L225 Difference]: With dead ends: 3352 [2019-10-13 21:10:55,798 INFO L226 Difference]: Without dead ends: 2371 [2019-10-13 21:10:55,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:10:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2019-10-13 21:10:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2313. [2019-10-13 21:10:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2313 states. [2019-10-13 21:10:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3713 transitions. [2019-10-13 21:10:55,960 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3713 transitions. Word has length 131 [2019-10-13 21:10:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:55,960 INFO L462 AbstractCegarLoop]: Abstraction has 2313 states and 3713 transitions. [2019-10-13 21:10:55,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:10:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3713 transitions. [2019-10-13 21:10:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-13 21:10:55,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:55,966 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:55,966 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:55,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:55,966 INFO L82 PathProgramCache]: Analyzing trace with hash 552853337, now seen corresponding path program 1 times [2019-10-13 21:10:55,967 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:55,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777052962] [2019-10-13 21:10:55,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:55,967 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:55,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:56,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777052962] [2019-10-13 21:10:56,183 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:56,183 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:10:56,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164598239] [2019-10-13 21:10:56,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:10:56,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:56,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:10:56,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:10:56,185 INFO L87 Difference]: Start difference. First operand 2313 states and 3713 transitions. Second operand 9 states. [2019-10-13 21:10:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:59,842 INFO L93 Difference]: Finished difference Result 4600 states and 7543 transitions. [2019-10-13 21:10:59,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:10:59,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-10-13 21:10:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:59,857 INFO L225 Difference]: With dead ends: 4600 [2019-10-13 21:10:59,857 INFO L226 Difference]: Without dead ends: 2353 [2019-10-13 21:10:59,869 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:10:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-10-13 21:10:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2337. [2019-10-13 21:10:59,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-10-13 21:10:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3797 transitions. [2019-10-13 21:10:59,979 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3797 transitions. Word has length 132 [2019-10-13 21:10:59,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:59,980 INFO L462 AbstractCegarLoop]: Abstraction has 2337 states and 3797 transitions. [2019-10-13 21:10:59,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:10:59,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3797 transitions. [2019-10-13 21:10:59,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:10:59,984 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:59,984 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:59,984 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:59,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:59,985 INFO L82 PathProgramCache]: Analyzing trace with hash -2055663078, now seen corresponding path program 1 times [2019-10-13 21:10:59,985 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:59,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500780044] [2019-10-13 21:10:59,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:59,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:59,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:00,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500780044] [2019-10-13 21:11:00,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:00,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:11:00,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657327] [2019-10-13 21:11:00,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:11:00,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:00,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:11:00,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:00,146 INFO L87 Difference]: Start difference. First operand 2337 states and 3797 transitions. Second operand 8 states.