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_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:11:08,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:11:08,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:11:08,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:11:08,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:11:08,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:11:08,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:11:08,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:11:08,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:11:08,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:11:08,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:11:08,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:11:08,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:11:08,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:11:08,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:11:08,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:11:08,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:11:08,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:11:08,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:11:08,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:11:08,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:11:08,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:11:08,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:11:08,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:11:08,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:11:08,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:11:08,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:11:08,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:11:08,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:11:08,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:11:08,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:11:08,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:11:08,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:11:08,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:11:08,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:11:08,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:11:08,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:11:08,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:11:08,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:11:08,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:11:08,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:11:08,169 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:11:08,190 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:11:08,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:11:08,192 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:11:08,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:11:08,193 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:11:08,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:11:08,193 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:11:08,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:11:08,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:11:08,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:11:08,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:11:08,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:11:08,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:11:08,196 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:11:08,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:11:08,196 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:11:08,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:11:08,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:11:08,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:11:08,197 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:11:08,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:11:08,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:11:08,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:11:08,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:11:08,198 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:11:08,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:11:08,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:11:08,199 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:11:08,199 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:11:08,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:11:08,510 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:11:08,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:11:08,515 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:11:08,515 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:11:08,516 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c [2019-10-13 21:11:08,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d548a404/09f8ebdf1c87478a90e13fa356a5086f/FLAG8b507fe35 [2019-10-13 21:11:09,308 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:11:09,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_productSimulator.cil.c [2019-10-13 21:11:09,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d548a404/09f8ebdf1c87478a90e13fa356a5086f/FLAG8b507fe35 [2019-10-13 21:11:09,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d548a404/09f8ebdf1c87478a90e13fa356a5086f [2019-10-13 21:11:09,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:11:09,419 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:11:09,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:09,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:11:09,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:11:09,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:09" (1/1) ... [2019-10-13 21:11:09,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0cb0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:09, skipping insertion in model container [2019-10-13 21:11:09,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:09" (1/1) ... [2019-10-13 21:11:09,436 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:11:09,507 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:11:10,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:10,328 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:11:10,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:10,567 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:11:10,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:10 WrapperNode [2019-10-13 21:11:10,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:10,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:11:10,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:11:10,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:11:10,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:10" (1/1) ... [2019-10-13 21:11:10,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:10" (1/1) ... [2019-10-13 21:11:10,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:10" (1/1) ... [2019-10-13 21:11:10,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:10" (1/1) ... [2019-10-13 21:11:10,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:10" (1/1) ... [2019-10-13 21:11:10,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:10" (1/1) ... [2019-10-13 21:11:10,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:10" (1/1) ... [2019-10-13 21:11:10,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:11:10,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:11:10,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:11:10,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:11:10,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:10" (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:11:10,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:11:10,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:11:10,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:10,860 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:11:10,861 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:11:10,862 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:11:10,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:11:10,862 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:11:10,863 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:11:10,863 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:11:10,863 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:11:10,864 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:11:10,864 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:11:10,865 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:11:10,865 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:11:10,865 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:11:10,867 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:11:10,867 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:11:10,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:11:10,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:11:10,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:11:10,868 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:11:10,868 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:11:10,869 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:11:10,869 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:11:10,869 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:11:10,869 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:11:10,869 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:11:10,870 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:11:10,870 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:11:10,870 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:11:10,870 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:11:10,870 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:11:10,871 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:11:10,871 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:11:10,871 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:11:10,871 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:11:10,871 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:11:10,872 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:11:10,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:10,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:10,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:10,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:11:10,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:11:10,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:11:10,873 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:11:10,874 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:11:10,874 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:11:10,875 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:11:10,875 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:11:10,875 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:11:10,875 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__before__overloaded [2019-10-13 21:11:10,875 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked__role__overloaded [2019-10-13 21:11:10,876 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:11:10,876 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__before__weight [2019-10-13 21:11:10,876 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__role__weight [2019-10-13 21:11:10,876 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:11:10,876 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__weight [2019-10-13 21:11:10,877 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__weight [2019-10-13 21:11:10,877 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__before__empty [2019-10-13 21:11:10,877 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__role__empty [2019-10-13 21:11:10,877 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:11:10,877 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:11:10,878 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:11:10,878 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:11:10,878 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:11:10,878 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:11:10,878 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:11:10,878 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:11:10,879 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:11:10,879 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:11:10,879 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-13 21:11:10,879 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-13 21:11:10,880 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__before__executivefloor [2019-10-13 21:11:10,880 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__role__executivefloor [2019-10-13 21:11:10,880 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:11:10,880 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:11:10,881 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:11:10,881 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-13 21:11:10,881 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-13 21:11:10,882 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-13 21:11:10,882 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-13 21:11:10,882 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:10,882 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:11:10,883 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:11:10,884 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__before__overloaded [2019-10-13 21:11:10,884 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__role__overloaded [2019-10-13 21:11:10,885 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:11:10,885 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__before__overloaded [2019-10-13 21:11:10,885 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__role__overloaded [2019-10-13 21:11:10,885 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:11:10,886 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:11:10,886 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:11:10,886 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:11:10,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:11:10,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:11:10,887 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:11:10,887 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:11:10,887 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:11:10,887 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:11:10,887 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:11:10,887 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:11:10,888 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:11:10,888 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:11:10,888 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:11:10,888 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:11:10,888 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:11:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:11:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:11:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:11:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:11:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:11:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:11:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:11:10,890 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:11:10,890 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:11:10,890 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:11:10,890 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:11:10,891 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:11:10,891 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:11:10,891 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:11:10,891 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:11:10,892 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:11:10,892 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:11:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:11:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:11:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:11:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:11:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:11:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:11:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:11:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:11:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:11:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:11:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:11:10,896 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:11:10,896 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:11:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:11:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:11:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:11:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:11:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:11:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:11:10,902 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:11:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:11:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:11:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:11:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:11:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:11:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:11:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:11:10,911 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:10,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:11:10,911 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:10,911 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:10,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:11:10,911 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:11:10,912 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:11:10,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:11:10,912 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:11:10,912 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:11:10,912 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:11:10,912 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:11:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:11:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:11:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:11:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:11:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:11:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__before__overloaded [2019-10-13 21:11:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked__role__overloaded [2019-10-13 21:11:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__before__weight [2019-10-13 21:11:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__role__weight [2019-10-13 21:11:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__weight [2019-10-13 21:11:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__weight [2019-10-13 21:11:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__before__empty [2019-10-13 21:11:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__role__empty [2019-10-13 21:11:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:11:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:11:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:11:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:11:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:11:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__twothirdsfull [2019-10-13 21:11:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__twothirdsfull [2019-10-13 21:11:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__before__executivefloor [2019-10-13 21:11:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__role__executivefloor [2019-10-13 21:11:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:11:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:11:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__twothirdsfull [2019-10-13 21:11:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__twothirdsfull [2019-10-13 21:11:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__before__executivefloor [2019-10-13 21:11:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__role__executivefloor [2019-10-13 21:11:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:11:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:11:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__before__overloaded [2019-10-13 21:11:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__role__overloaded [2019-10-13 21:11:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure printState__before__overloaded [2019-10-13 21:11:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure printState__role__overloaded [2019-10-13 21:11:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:11:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:11:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:11:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:11:13,511 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:11:13,511 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:11:13,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:13 BoogieIcfgContainer [2019-10-13 21:11:13,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:11:13,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:11:13,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:11:13,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:11:13,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:11:09" (1/3) ... [2019-10-13 21:11:13,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db5eefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:13, skipping insertion in model container [2019-10-13 21:11:13,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:10" (2/3) ... [2019-10-13 21:11:13,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db5eefd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:13, skipping insertion in model container [2019-10-13 21:11:13,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:13" (3/3) ... [2019-10-13 21:11:13,521 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_productSimulator.cil.c [2019-10-13 21:11:13,532 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:11:13,541 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:11:13,554 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:11:13,590 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:11:13,590 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:11:13,590 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:11:13,590 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:11:13,590 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:11:13,591 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:11:13,591 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:11:13,591 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:11:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states. [2019-10-13 21:11:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:11:13,691 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:13,692 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:13,695 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:13,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:13,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1390055657, now seen corresponding path program 1 times [2019-10-13 21:11:13,714 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:13,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869380191] [2019-10-13 21:11:13,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:13,715 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:13,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:14,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869380191] [2019-10-13 21:11:14,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:14,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:14,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657720176] [2019-10-13 21:11:14,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:14,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:14,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:14,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:14,388 INFO L87 Difference]: Start difference. First operand 926 states. Second operand 6 states. [2019-10-13 21:11:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:14,575 INFO L93 Difference]: Finished difference Result 1497 states and 2337 transitions. [2019-10-13 21:11:14,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:14,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-13 21:11:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:14,611 INFO L225 Difference]: With dead ends: 1497 [2019-10-13 21:11:14,611 INFO L226 Difference]: Without dead ends: 754 [2019-10-13 21:11:14,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:14,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-13 21:11:14,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-13 21:11:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-13 21:11:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1165 transitions. [2019-10-13 21:11:14,762 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1165 transitions. Word has length 119 [2019-10-13 21:11:14,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:14,764 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1165 transitions. [2019-10-13 21:11:14,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:14,764 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1165 transitions. [2019-10-13 21:11:14,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:11:14,770 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:14,770 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:14,771 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:14,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:14,771 INFO L82 PathProgramCache]: Analyzing trace with hash -232939241, now seen corresponding path program 1 times [2019-10-13 21:11:14,772 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:14,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061140596] [2019-10-13 21:11:14,772 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:14,772 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:14,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:15,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061140596] [2019-10-13 21:11:15,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:15,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:15,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678057314] [2019-10-13 21:11:15,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:15,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:15,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:15,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:15,080 INFO L87 Difference]: Start difference. First operand 754 states and 1165 transitions. Second operand 4 states. [2019-10-13 21:11:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:15,175 INFO L93 Difference]: Finished difference Result 1450 states and 2260 transitions. [2019-10-13 21:11:15,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:15,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-13 21:11:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:15,183 INFO L225 Difference]: With dead ends: 1450 [2019-10-13 21:11:15,184 INFO L226 Difference]: Without dead ends: 754 [2019-10-13 21:11:15,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-13 21:11:15,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-13 21:11:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-13 21:11:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1164 transitions. [2019-10-13 21:11:15,253 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1164 transitions. Word has length 122 [2019-10-13 21:11:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:15,255 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1164 transitions. [2019-10-13 21:11:15,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1164 transitions. [2019-10-13 21:11:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 21:11:15,265 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:15,266 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:15,266 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:15,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1715522467, now seen corresponding path program 1 times [2019-10-13 21:11:15,267 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:15,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795392899] [2019-10-13 21:11:15,267 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:15,267 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:15,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:15,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795392899] [2019-10-13 21:11:15,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:15,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:15,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089282357] [2019-10-13 21:11:15,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:15,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:15,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:15,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:15,537 INFO L87 Difference]: Start difference. First operand 754 states and 1164 transitions. Second operand 4 states. [2019-10-13 21:11:15,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:15,647 INFO L93 Difference]: Finished difference Result 1450 states and 2259 transitions. [2019-10-13 21:11:15,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:15,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-10-13 21:11:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:15,660 INFO L225 Difference]: With dead ends: 1450 [2019-10-13 21:11:15,660 INFO L226 Difference]: Without dead ends: 754 [2019-10-13 21:11:15,665 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:15,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-13 21:11:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-13 21:11:15,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-13 21:11:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1163 transitions. [2019-10-13 21:11:15,717 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1163 transitions. Word has length 123 [2019-10-13 21:11:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:15,718 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1163 transitions. [2019-10-13 21:11:15,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1163 transitions. [2019-10-13 21:11:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-13 21:11:15,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:15,723 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:15,724 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:15,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:15,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1903026157, now seen corresponding path program 1 times [2019-10-13 21:11:15,725 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:15,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940325904] [2019-10-13 21:11:15,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:15,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:15,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:16,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940325904] [2019-10-13 21:11:16,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:16,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:16,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717269166] [2019-10-13 21:11:16,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:16,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:16,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:16,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:16,035 INFO L87 Difference]: Start difference. First operand 754 states and 1163 transitions. Second operand 4 states. [2019-10-13 21:11:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:16,112 INFO L93 Difference]: Finished difference Result 1450 states and 2258 transitions. [2019-10-13 21:11:16,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:16,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-13 21:11:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:16,120 INFO L225 Difference]: With dead ends: 1450 [2019-10-13 21:11:16,120 INFO L226 Difference]: Without dead ends: 754 [2019-10-13 21:11:16,124 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-13 21:11:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-13 21:11:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-13 21:11:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1162 transitions. [2019-10-13 21:11:16,154 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1162 transitions. Word has length 124 [2019-10-13 21:11:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:16,154 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1162 transitions. [2019-10-13 21:11:16,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1162 transitions. [2019-10-13 21:11:16,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-13 21:11:16,157 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:16,158 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:16,158 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:16,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:16,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2005235937, now seen corresponding path program 1 times [2019-10-13 21:11:16,159 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:16,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312088449] [2019-10-13 21:11:16,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:16,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:16,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:16,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312088449] [2019-10-13 21:11:16,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:16,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:16,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136466555] [2019-10-13 21:11:16,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:16,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:16,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:16,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:16,304 INFO L87 Difference]: Start difference. First operand 754 states and 1162 transitions. Second operand 4 states. [2019-10-13 21:11:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:16,377 INFO L93 Difference]: Finished difference Result 1450 states and 2257 transitions. [2019-10-13 21:11:16,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:16,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-10-13 21:11:16,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:16,392 INFO L225 Difference]: With dead ends: 1450 [2019-10-13 21:11:16,392 INFO L226 Difference]: Without dead ends: 754 [2019-10-13 21:11:16,397 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:16,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-13 21:11:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-13 21:11:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-13 21:11:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1161 transitions. [2019-10-13 21:11:16,435 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1161 transitions. Word has length 125 [2019-10-13 21:11:16,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:16,436 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1161 transitions. [2019-10-13 21:11:16,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:16,436 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1161 transitions. [2019-10-13 21:11:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 21:11:16,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:16,441 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:16,441 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:16,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:16,442 INFO L82 PathProgramCache]: Analyzing trace with hash -475123953, now seen corresponding path program 1 times [2019-10-13 21:11:16,442 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:16,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837705284] [2019-10-13 21:11:16,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:16,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:16,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:16,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837705284] [2019-10-13 21:11:16,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:16,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:16,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118982842] [2019-10-13 21:11:16,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:16,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:16,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:16,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:16,624 INFO L87 Difference]: Start difference. First operand 754 states and 1161 transitions. Second operand 4 states. [2019-10-13 21:11:16,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:16,685 INFO L93 Difference]: Finished difference Result 1450 states and 2256 transitions. [2019-10-13 21:11:16,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:16,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-10-13 21:11:16,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:16,693 INFO L225 Difference]: With dead ends: 1450 [2019-10-13 21:11:16,693 INFO L226 Difference]: Without dead ends: 754 [2019-10-13 21:11:16,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-13 21:11:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-13 21:11:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-13 21:11:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1160 transitions. [2019-10-13 21:11:16,790 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1160 transitions. Word has length 126 [2019-10-13 21:11:16,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:16,791 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1160 transitions. [2019-10-13 21:11:16,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1160 transitions. [2019-10-13 21:11:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 21:11:16,793 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:16,794 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:16,794 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:16,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:16,794 INFO L82 PathProgramCache]: Analyzing trace with hash 218267130, now seen corresponding path program 1 times [2019-10-13 21:11:16,794 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:16,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907307037] [2019-10-13 21:11:16,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:16,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:16,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:16,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907307037] [2019-10-13 21:11:16,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:16,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:16,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387382671] [2019-10-13 21:11:16,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:16,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:16,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:16,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:16,946 INFO L87 Difference]: Start difference. First operand 754 states and 1160 transitions. Second operand 4 states. [2019-10-13 21:11:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:17,028 INFO L93 Difference]: Finished difference Result 1450 states and 2255 transitions. [2019-10-13 21:11:17,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:17,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-10-13 21:11:17,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:17,037 INFO L225 Difference]: With dead ends: 1450 [2019-10-13 21:11:17,037 INFO L226 Difference]: Without dead ends: 754 [2019-10-13 21:11:17,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-13 21:11:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-13 21:11:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-13 21:11:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1159 transitions. [2019-10-13 21:11:17,086 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1159 transitions. Word has length 127 [2019-10-13 21:11:17,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:17,088 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1159 transitions. [2019-10-13 21:11:17,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:17,088 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1159 transitions. [2019-10-13 21:11:17,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 21:11:17,091 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:17,092 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:17,092 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:17,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:17,093 INFO L82 PathProgramCache]: Analyzing trace with hash 117355163, now seen corresponding path program 1 times [2019-10-13 21:11:17,093 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:17,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733761874] [2019-10-13 21:11:17,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,099 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:17,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733761874] [2019-10-13 21:11:17,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:17,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:11:17,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839741348] [2019-10-13 21:11:17,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:11:17,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:17,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:11:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:17,309 INFO L87 Difference]: Start difference. First operand 754 states and 1159 transitions. Second operand 9 states. [2019-10-13 21:11:17,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:17,704 INFO L93 Difference]: Finished difference Result 1402 states and 2167 transitions. [2019-10-13 21:11:17,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:11:17,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2019-10-13 21:11:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:17,711 INFO L225 Difference]: With dead ends: 1402 [2019-10-13 21:11:17,712 INFO L226 Difference]: Without dead ends: 748 [2019-10-13 21:11:17,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:11:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-13 21:11:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-13 21:11:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-13 21:11:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1146 transitions. [2019-10-13 21:11:17,751 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1146 transitions. Word has length 127 [2019-10-13 21:11:17,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:17,752 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1146 transitions. [2019-10-13 21:11:17,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:11:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1146 transitions. [2019-10-13 21:11:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:11:17,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:17,755 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:17,756 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:17,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:17,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1586108187, now seen corresponding path program 1 times [2019-10-13 21:11:17,756 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:17,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064885808] [2019-10-13 21:11:17,757 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,757 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:17,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064885808] [2019-10-13 21:11:17,989 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:17,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:17,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248443416] [2019-10-13 21:11:17,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:17,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:17,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:17,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:17,992 INFO L87 Difference]: Start difference. First operand 748 states and 1146 transitions. Second operand 6 states. [2019-10-13 21:11:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:18,231 INFO L93 Difference]: Finished difference Result 1396 states and 2154 transitions. [2019-10-13 21:11:18,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:18,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-10-13 21:11:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:18,238 INFO L225 Difference]: With dead ends: 1396 [2019-10-13 21:11:18,238 INFO L226 Difference]: Without dead ends: 748 [2019-10-13 21:11:18,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-13 21:11:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-13 21:11:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-13 21:11:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1142 transitions. [2019-10-13 21:11:18,280 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1142 transitions. Word has length 128 [2019-10-13 21:11:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:18,281 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1142 transitions. [2019-10-13 21:11:18,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1142 transitions. [2019-10-13 21:11:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 21:11:18,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:18,284 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:18,284 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:18,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:18,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1697144642, now seen corresponding path program 1 times [2019-10-13 21:11:18,284 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:18,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071854324] [2019-10-13 21:11:18,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:18,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071854324] [2019-10-13 21:11:18,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:18,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:18,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383925792] [2019-10-13 21:11:18,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:18,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:18,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:18,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:18,437 INFO L87 Difference]: Start difference. First operand 748 states and 1142 transitions. Second operand 6 states. [2019-10-13 21:11:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:18,701 INFO L93 Difference]: Finished difference Result 1396 states and 2150 transitions. [2019-10-13 21:11:18,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:18,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-10-13 21:11:18,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:18,710 INFO L225 Difference]: With dead ends: 1396 [2019-10-13 21:11:18,710 INFO L226 Difference]: Without dead ends: 748 [2019-10-13 21:11:18,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:18,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-13 21:11:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-13 21:11:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-13 21:11:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1138 transitions. [2019-10-13 21:11:18,755 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1138 transitions. Word has length 129 [2019-10-13 21:11:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:18,756 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1138 transitions. [2019-10-13 21:11:18,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1138 transitions. [2019-10-13 21:11:18,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:11:18,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:18,758 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:18,759 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:18,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:18,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1882039414, now seen corresponding path program 1 times [2019-10-13 21:11:18,759 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:18,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715704693] [2019-10-13 21:11:18,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:18,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715704693] [2019-10-13 21:11:18,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:18,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:18,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733855841] [2019-10-13 21:11:18,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:18,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:18,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:18,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:18,901 INFO L87 Difference]: Start difference. First operand 748 states and 1138 transitions. Second operand 6 states. [2019-10-13 21:11:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:19,137 INFO L93 Difference]: Finished difference Result 1396 states and 2146 transitions. [2019-10-13 21:11:19,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:19,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-10-13 21:11:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:19,144 INFO L225 Difference]: With dead ends: 1396 [2019-10-13 21:11:19,144 INFO L226 Difference]: Without dead ends: 748 [2019-10-13 21:11:19,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-13 21:11:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-13 21:11:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-13 21:11:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1134 transitions. [2019-10-13 21:11:19,186 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1134 transitions. Word has length 130 [2019-10-13 21:11:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:19,186 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1134 transitions. [2019-10-13 21:11:19,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1134 transitions. [2019-10-13 21:11:19,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:11:19,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:19,190 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:19,190 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:19,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:19,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1517623306, now seen corresponding path program 1 times [2019-10-13 21:11:19,191 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:19,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941986003] [2019-10-13 21:11:19,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:19,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941986003] [2019-10-13 21:11:19,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:19,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:19,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473595332] [2019-10-13 21:11:19,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:19,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:19,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:19,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:19,340 INFO L87 Difference]: Start difference. First operand 748 states and 1134 transitions. Second operand 7 states. [2019-10-13 21:11:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:19,429 INFO L93 Difference]: Finished difference Result 1396 states and 2142 transitions. [2019-10-13 21:11:19,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:19,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-10-13 21:11:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:19,435 INFO L225 Difference]: With dead ends: 1396 [2019-10-13 21:11:19,435 INFO L226 Difference]: Without dead ends: 727 [2019-10-13 21:11:19,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-13 21:11:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-13 21:11:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-13 21:11:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1100 transitions. [2019-10-13 21:11:19,465 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1100 transitions. Word has length 130 [2019-10-13 21:11:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:19,465 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1100 transitions. [2019-10-13 21:11:19,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1100 transitions. [2019-10-13 21:11:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 21:11:19,468 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:19,468 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:19,468 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:19,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:19,469 INFO L82 PathProgramCache]: Analyzing trace with hash -61574717, now seen corresponding path program 1 times [2019-10-13 21:11:19,469 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:19,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281349854] [2019-10-13 21:11:19,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:19,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281349854] [2019-10-13 21:11:19,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:19,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:19,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781572276] [2019-10-13 21:11:19,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:19,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:19,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:19,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:19,599 INFO L87 Difference]: Start difference. First operand 727 states and 1100 transitions. Second operand 6 states. [2019-10-13 21:11:19,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:19,731 INFO L93 Difference]: Finished difference Result 1375 states and 2108 transitions. [2019-10-13 21:11:19,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:19,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-10-13 21:11:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:19,744 INFO L225 Difference]: With dead ends: 1375 [2019-10-13 21:11:19,744 INFO L226 Difference]: Without dead ends: 727 [2019-10-13 21:11:19,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-13 21:11:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-13 21:11:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-13 21:11:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1099 transitions. [2019-10-13 21:11:19,789 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1099 transitions. Word has length 131 [2019-10-13 21:11:19,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:19,789 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1099 transitions. [2019-10-13 21:11:19,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:19,790 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1099 transitions. [2019-10-13 21:11:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-13 21:11:19,793 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:19,794 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:19,794 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:19,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:19,795 INFO L82 PathProgramCache]: Analyzing trace with hash -499475921, now seen corresponding path program 1 times [2019-10-13 21:11:19,795 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:19,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600099105] [2019-10-13 21:11:19,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:20,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600099105] [2019-10-13 21:11:20,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:20,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:20,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641642376] [2019-10-13 21:11:20,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:20,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:20,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:20,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:20,016 INFO L87 Difference]: Start difference. First operand 727 states and 1099 transitions. Second operand 6 states. [2019-10-13 21:11:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:20,165 INFO L93 Difference]: Finished difference Result 1375 states and 2107 transitions. [2019-10-13 21:11:20,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:20,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-10-13 21:11:20,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:20,172 INFO L225 Difference]: With dead ends: 1375 [2019-10-13 21:11:20,172 INFO L226 Difference]: Without dead ends: 727 [2019-10-13 21:11:20,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-13 21:11:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-13 21:11:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-13 21:11:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1098 transitions. [2019-10-13 21:11:20,248 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1098 transitions. Word has length 132 [2019-10-13 21:11:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:20,248 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1098 transitions. [2019-10-13 21:11:20,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1098 transitions. [2019-10-13 21:11:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:11:20,253 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:20,253 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:20,254 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:20,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:20,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2067723976, now seen corresponding path program 1 times [2019-10-13 21:11:20,254 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:20,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005290029] [2019-10-13 21:11:20,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:20,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:20,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:20,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005290029] [2019-10-13 21:11:20,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:20,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 21:11:20,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620974947] [2019-10-13 21:11:20,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 21:11:20,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:20,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 21:11:20,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:11:20,448 INFO L87 Difference]: Start difference. First operand 727 states and 1098 transitions. Second operand 11 states. [2019-10-13 21:11:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:20,841 INFO L93 Difference]: Finished difference Result 1376 states and 2106 transitions. [2019-10-13 21:11:20,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:20,841 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 133 [2019-10-13 21:11:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:20,847 INFO L225 Difference]: With dead ends: 1376 [2019-10-13 21:11:20,847 INFO L226 Difference]: Without dead ends: 727 [2019-10-13 21:11:20,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:11:20,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-10-13 21:11:20,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2019-10-13 21:11:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-10-13 21:11:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1097 transitions. [2019-10-13 21:11:20,876 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1097 transitions. Word has length 133 [2019-10-13 21:11:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:20,877 INFO L462 AbstractCegarLoop]: Abstraction has 727 states and 1097 transitions. [2019-10-13 21:11:20,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 21:11:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1097 transitions. [2019-10-13 21:11:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-13 21:11:20,879 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:20,879 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:20,880 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:20,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:20,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1980443808, now seen corresponding path program 1 times [2019-10-13 21:11:20,880 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:20,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978632777] [2019-10-13 21:11:20,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:20,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:20,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:21,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978632777] [2019-10-13 21:11:21,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:21,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:21,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757456081] [2019-10-13 21:11:21,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:21,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:21,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:21,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:21,056 INFO L87 Difference]: Start difference. First operand 727 states and 1097 transitions. Second operand 4 states. [2019-10-13 21:11:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:22,285 INFO L93 Difference]: Finished difference Result 2040 states and 3133 transitions. [2019-10-13 21:11:22,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:22,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-10-13 21:11:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:22,297 INFO L225 Difference]: With dead ends: 2040 [2019-10-13 21:11:22,297 INFO L226 Difference]: Without dead ends: 1400 [2019-10-13 21:11:22,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:22,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-10-13 21:11:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1387. [2019-10-13 21:11:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1387 states. [2019-10-13 21:11:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 2107 transitions. [2019-10-13 21:11:22,382 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 2107 transitions. Word has length 134 [2019-10-13 21:11:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:22,383 INFO L462 AbstractCegarLoop]: Abstraction has 1387 states and 2107 transitions. [2019-10-13 21:11:22,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2107 transitions. [2019-10-13 21:11:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:11:22,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:22,386 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:22,387 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:22,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:22,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1183400857, now seen corresponding path program 1 times [2019-10-13 21:11:22,388 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:22,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573244485] [2019-10-13 21:11:22,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:22,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:22,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:22,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573244485] [2019-10-13 21:11:22,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:22,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:11:22,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892378408] [2019-10-13 21:11:22,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:22,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:22,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:22,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:22,663 INFO L87 Difference]: Start difference. First operand 1387 states and 2107 transitions. Second operand 6 states. [2019-10-13 21:11:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:27,557 INFO L93 Difference]: Finished difference Result 3471 states and 5469 transitions. [2019-10-13 21:11:27,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:27,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-10-13 21:11:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:27,579 INFO L225 Difference]: With dead ends: 3471 [2019-10-13 21:11:27,579 INFO L226 Difference]: Without dead ends: 2838 [2019-10-13 21:11:27,583 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 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:11:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2019-10-13 21:11:27,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2789. [2019-10-13 21:11:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2789 states. [2019-10-13 21:11:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4412 transitions. [2019-10-13 21:11:27,712 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4412 transitions. Word has length 135 [2019-10-13 21:11:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:27,713 INFO L462 AbstractCegarLoop]: Abstraction has 2789 states and 4412 transitions. [2019-10-13 21:11:27,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4412 transitions. [2019-10-13 21:11:27,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-13 21:11:27,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:27,723 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:27,724 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:27,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:27,724 INFO L82 PathProgramCache]: Analyzing trace with hash -185210926, now seen corresponding path program 1 times [2019-10-13 21:11:27,724 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:27,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986094230] [2019-10-13 21:11:27,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:27,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:27,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:27,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986094230] [2019-10-13 21:11:27,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:27,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:11:27,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655443275] [2019-10-13 21:11:27,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:11:27,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:27,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:11:27,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:27,970 INFO L87 Difference]: Start difference. First operand 2789 states and 4412 transitions. Second operand 9 states. [2019-10-13 21:11:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:32,842 INFO L93 Difference]: Finished difference Result 5459 states and 8816 transitions. [2019-10-13 21:11:32,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:11:32,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 180 [2019-10-13 21:11:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:32,864 INFO L225 Difference]: With dead ends: 5459 [2019-10-13 21:11:32,865 INFO L226 Difference]: Without dead ends: 2813 [2019-10-13 21:11:32,881 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:11:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2019-10-13 21:11:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2805. [2019-10-13 21:11:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2805 states. [2019-10-13 21:11:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 4492 transitions. [2019-10-13 21:11:33,024 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 4492 transitions. Word has length 180 [2019-10-13 21:11:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:33,025 INFO L462 AbstractCegarLoop]: Abstraction has 2805 states and 4492 transitions. [2019-10-13 21:11:33,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:11:33,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 4492 transitions. [2019-10-13 21:11:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-13 21:11:33,037 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:33,037 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:33,038 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:33,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:33,038 INFO L82 PathProgramCache]: Analyzing trace with hash 748218603, now seen corresponding path program 1 times [2019-10-13 21:11:33,038 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:33,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118954745] [2019-10-13 21:11:33,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:33,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:33,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:33,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118954745] [2019-10-13 21:11:33,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:33,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:11:33,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637524903] [2019-10-13 21:11:33,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:11:33,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:33,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:11:33,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:33,366 INFO L87 Difference]: Start difference. First operand 2805 states and 4492 transitions. Second operand 8 states. [2019-10-13 21:11:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:41,640 INFO L93 Difference]: Finished difference Result 10521 states and 17486 transitions. [2019-10-13 21:11:41,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:11:41,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-10-13 21:11:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:41,724 INFO L225 Difference]: With dead ends: 10521 [2019-10-13 21:11:41,724 INFO L226 Difference]: Without dead ends: 7859 [2019-10-13 21:11:41,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:11:41,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7859 states. [2019-10-13 21:11:42,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7859 to 7785. [2019-10-13 21:11:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7785 states. [2019-10-13 21:11:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7785 states to 7785 states and 12512 transitions. [2019-10-13 21:11:42,160 INFO L78 Accepts]: Start accepts. Automaton has 7785 states and 12512 transitions. Word has length 181 [2019-10-13 21:11:42,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:42,161 INFO L462 AbstractCegarLoop]: Abstraction has 7785 states and 12512 transitions. [2019-10-13 21:11:42,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:11:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 7785 states and 12512 transitions. [2019-10-13 21:11:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-13 21:11:42,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:42,171 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:42,171 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:42,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:42,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1478649548, now seen corresponding path program 1 times [2019-10-13 21:11:42,172 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:42,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173076570] [2019-10-13 21:11:42,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:42,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:42,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-13 21:11:42,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173076570] [2019-10-13 21:11:42,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:42,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:42,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519367577] [2019-10-13 21:11:42,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:42,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:42,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:42,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:42,383 INFO L87 Difference]: Start difference. First operand 7785 states and 12512 transitions. Second operand 4 states.