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_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:10:03,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:10:03,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:10:03,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:10:03,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:10:03,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:10:03,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:10:03,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:10:03,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:10:03,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:10:03,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:10:03,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:10:03,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:10:03,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:10:03,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:10:03,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:10:03,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:10:03,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:10:03,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:10:03,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:10:03,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:10:03,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:10:03,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:10:03,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:10:03,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:10:03,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:10:03,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:10:03,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:10:03,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:10:03,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:10:03,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:10:03,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:10:03,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:10:03,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:10:03,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:10:03,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:10:03,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:10:03,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:10:03,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:10:03,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:10:03,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:10:03,256 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-15 01:10:03,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:10:03,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:10:03,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:10:03,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:10:03,282 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:10:03,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:10:03,282 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:10:03,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:10:03,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:10:03,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:10:03,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:10:03,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:10:03,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:10:03,285 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:10:03,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:10:03,285 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:10:03,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:10:03,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:10:03,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:10:03,286 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:10:03,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:10:03,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:10:03,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:10:03,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:10:03,287 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:10:03,287 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:10:03,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:10:03,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:10:03,288 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-15 01:10:03,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:10:03,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:10:03,594 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:10:03,596 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:10:03,596 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:10:03,597 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product31.cil.c [2019-10-15 01:10:03,674 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0552cb907/2654d34b4e6342698bf315c1ede18405/FLAG4b753268f [2019-10-15 01:10:04,425 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:10:04,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product31.cil.c [2019-10-15 01:10:04,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0552cb907/2654d34b4e6342698bf315c1ede18405/FLAG4b753268f [2019-10-15 01:10:04,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0552cb907/2654d34b4e6342698bf315c1ede18405 [2019-10-15 01:10:04,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:10:04,552 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:10:04,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:04,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:10:04,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:10:04,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:04" (1/1) ... [2019-10-15 01:10:04,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af97dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:04, skipping insertion in model container [2019-10-15 01:10:04,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:04" (1/1) ... [2019-10-15 01:10:04,570 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:10:04,662 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:10:05,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:05,451 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:10:05,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:05,682 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:10:05,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:05 WrapperNode [2019-10-15 01:10:05,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:05,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:10:05,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:10:05,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:10:05,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:05" (1/1) ... [2019-10-15 01:10:05,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:05" (1/1) ... [2019-10-15 01:10:05,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:05" (1/1) ... [2019-10-15 01:10:05,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:05" (1/1) ... [2019-10-15 01:10:05,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:05" (1/1) ... [2019-10-15 01:10:05,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:05" (1/1) ... [2019-10-15 01:10:05,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:05" (1/1) ... [2019-10-15 01:10:05,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:10:05,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:10:05,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:10:05,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:10:05,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:05" (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-15 01:10:06,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:10:06,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:10:06,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:06,016 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:10:06,017 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:10:06,017 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:10:06,018 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:10:06,018 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:10:06,018 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:10:06,019 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:10:06,019 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:10:06,019 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:10:06,019 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:10:06,021 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:10:06,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:10:06,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:10:06,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:10:06,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:10:06,025 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:10:06,025 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:10:06,026 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:10:06,027 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:10:06,027 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:10:06,027 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:10:06,028 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:10:06,028 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:10:06,028 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:10:06,028 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:10:06,029 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:10:06,029 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:10:06,029 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:10:06,029 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:10:06,029 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:10:06,030 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:10:06,030 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:10:06,030 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:10:06,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:10:06,030 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:10:06,031 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:10:06,031 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:10:06,031 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:10:06,031 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:10:06,031 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:10:06,031 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-15 01:10:06,032 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:10:06,032 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:10:06,032 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:10:06,032 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:10:06,032 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:10:06,032 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:10:06,033 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:10:06,033 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:10:06,033 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:10:06,033 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:10:06,033 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:10:06,034 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-15 01:10:06,034 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:10:06,035 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:10:06,035 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:10:06,036 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:10:06,036 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-15 01:10:06,036 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:06,037 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:10:06,037 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:10:06,038 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:10:06,038 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:10:06,038 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:10:06,038 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:10:06,038 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:10:06,039 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:10:06,039 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:10:06,039 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:10:06,039 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:10:06,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:10:06,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:06,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:06,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:06,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:10:06,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:10:06,042 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:10:06,042 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:10:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:10:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:10:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:10:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:10:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:10:06,044 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:10:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:10:06,045 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:10:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:10:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:10:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:10:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:10:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:10:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:10:06,046 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:10:06,047 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:10:06,047 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:10:06,047 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:10:06,047 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:10:06,047 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:10:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:10:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:10:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:10:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:10:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:10:06,049 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:10:06,049 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:10:06,049 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:10:06,049 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:10:06,049 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:10:06,050 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:10:06,050 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:10:06,050 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:10:06,050 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:10:06,050 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:10:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:10:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:10:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:10:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:10:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:10:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:10:06,053 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:10:06,053 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:10:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:10:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:10:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:10:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:10:06,055 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:10:06,055 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:10:06,055 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:10:06,055 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:10:06,056 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:10:06,056 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:10:06,056 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:10:06,056 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:10:06,057 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:10:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:10:06,063 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:10:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:10:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-15 01:10:06,064 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:10:06,065 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:10:06,065 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:10:06,071 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:10:06,071 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:10:06,071 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-15 01:10:06,071 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-15 01:10:06,071 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:10:06,071 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:10:06,071 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-15 01:10:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-15 01:10:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:10:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:10:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:10:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:10:06,072 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:10:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:10:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:10:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:10:06,073 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:06,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:10:06,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:10:06,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:10:06,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:10:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:10:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:10:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:10:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:10:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:10:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:10:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:10:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:10:08,613 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:10:08,613 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:10:08,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:08 BoogieIcfgContainer [2019-10-15 01:10:08,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:10:08,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:10:08,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:10:08,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:10:08,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:10:04" (1/3) ... [2019-10-15 01:10:08,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4487446c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:08, skipping insertion in model container [2019-10-15 01:10:08,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:05" (2/3) ... [2019-10-15 01:10:08,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4487446c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:08, skipping insertion in model container [2019-10-15 01:10:08,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:08" (3/3) ... [2019-10-15 01:10:08,626 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product31.cil.c [2019-10-15 01:10:08,637 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:10:08,648 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:10:08,661 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:10:08,696 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:10:08,697 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:10:08,697 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:10:08,697 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:10:08,697 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:10:08,697 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:10:08,697 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:10:08,697 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:10:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states. [2019-10-15 01:10:08,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:10:08,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:08,763 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:08,765 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:08,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:08,772 INFO L82 PathProgramCache]: Analyzing trace with hash 841338012, now seen corresponding path program 1 times [2019-10-15 01:10:08,782 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:08,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978326393] [2019-10-15 01:10:08,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:09,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978326393] [2019-10-15 01:10:09,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:09,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:09,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526908454] [2019-10-15 01:10:09,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:09,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:09,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:09,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:09,522 INFO L87 Difference]: Start difference. First operand 817 states. Second operand 4 states. [2019-10-15 01:10:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:09,800 INFO L93 Difference]: Finished difference Result 1297 states and 2075 transitions. [2019-10-15 01:10:09,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:09,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-15 01:10:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:09,840 INFO L225 Difference]: With dead ends: 1297 [2019-10-15 01:10:09,841 INFO L226 Difference]: Without dead ends: 657 [2019-10-15 01:10:09,855 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-15 01:10:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-15 01:10:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-15 01:10:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-15 01:10:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1039 transitions. [2019-10-15 01:10:09,985 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1039 transitions. Word has length 133 [2019-10-15 01:10:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:09,986 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1039 transitions. [2019-10-15 01:10:09,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1039 transitions. [2019-10-15 01:10:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 01:10:10,002 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:10,008 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:10,009 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:10,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1822294424, now seen corresponding path program 1 times [2019-10-15 01:10:10,010 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:10,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51433679] [2019-10-15 01:10:10,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:10,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51433679] [2019-10-15 01:10:10,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:10,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:10,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444002958] [2019-10-15 01:10:10,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:10,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:10,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:10,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:10,267 INFO L87 Difference]: Start difference. First operand 657 states and 1039 transitions. Second operand 4 states. [2019-10-15 01:10:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:10,418 INFO L93 Difference]: Finished difference Result 1277 states and 2036 transitions. [2019-10-15 01:10:10,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:10,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-15 01:10:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:10,426 INFO L225 Difference]: With dead ends: 1277 [2019-10-15 01:10:10,427 INFO L226 Difference]: Without dead ends: 657 [2019-10-15 01:10:10,440 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-15 01:10:10,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-15 01:10:10,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-15 01:10:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-15 01:10:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1038 transitions. [2019-10-15 01:10:10,508 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1038 transitions. Word has length 136 [2019-10-15 01:10:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:10,510 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1038 transitions. [2019-10-15 01:10:10,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1038 transitions. [2019-10-15 01:10:10,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 01:10:10,518 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:10,518 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:10,519 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:10,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:10,519 INFO L82 PathProgramCache]: Analyzing trace with hash -122460853, now seen corresponding path program 1 times [2019-10-15 01:10:10,519 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:10,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263809568] [2019-10-15 01:10:10,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:10,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263809568] [2019-10-15 01:10:10,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:10,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:10,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182404025] [2019-10-15 01:10:10,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:10,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:10,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:10,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:10,720 INFO L87 Difference]: Start difference. First operand 657 states and 1038 transitions. Second operand 4 states. [2019-10-15 01:10:10,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:10,790 INFO L93 Difference]: Finished difference Result 1277 states and 2035 transitions. [2019-10-15 01:10:10,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:10,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-15 01:10:10,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:10,797 INFO L225 Difference]: With dead ends: 1277 [2019-10-15 01:10:10,797 INFO L226 Difference]: Without dead ends: 657 [2019-10-15 01:10:10,800 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-15 01:10:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-15 01:10:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-15 01:10:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-15 01:10:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1037 transitions. [2019-10-15 01:10:10,830 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1037 transitions. Word has length 137 [2019-10-15 01:10:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:10,830 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1037 transitions. [2019-10-15 01:10:10,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1037 transitions. [2019-10-15 01:10:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:10:10,835 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:10,835 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:10,836 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:10,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:10,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1796711564, now seen corresponding path program 1 times [2019-10-15 01:10:10,836 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:10,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27575411] [2019-10-15 01:10:10,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:10,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:10,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27575411] [2019-10-15 01:10:10,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:10,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:10,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140434770] [2019-10-15 01:10:10,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:10,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:10,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:10,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:10,987 INFO L87 Difference]: Start difference. First operand 657 states and 1037 transitions. Second operand 4 states. [2019-10-15 01:10:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:11,070 INFO L93 Difference]: Finished difference Result 1277 states and 2034 transitions. [2019-10-15 01:10:11,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:11,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-15 01:10:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:11,083 INFO L225 Difference]: With dead ends: 1277 [2019-10-15 01:10:11,084 INFO L226 Difference]: Without dead ends: 657 [2019-10-15 01:10:11,089 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-15 01:10:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-15 01:10:11,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-15 01:10:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-15 01:10:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1036 transitions. [2019-10-15 01:10:11,127 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1036 transitions. Word has length 138 [2019-10-15 01:10:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:11,128 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1036 transitions. [2019-10-15 01:10:11,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1036 transitions. [2019-10-15 01:10:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:10:11,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:11,134 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:11,134 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:11,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:11,135 INFO L82 PathProgramCache]: Analyzing trace with hash 619711975, now seen corresponding path program 1 times [2019-10-15 01:10:11,135 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:11,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046336878] [2019-10-15 01:10:11,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:11,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:11,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:11,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046336878] [2019-10-15 01:10:11,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:11,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:11,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989148671] [2019-10-15 01:10:11,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:11,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:11,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:11,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:11,404 INFO L87 Difference]: Start difference. First operand 657 states and 1036 transitions. Second operand 4 states. [2019-10-15 01:10:11,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:11,513 INFO L93 Difference]: Finished difference Result 1277 states and 2033 transitions. [2019-10-15 01:10:11,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:11,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-15 01:10:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:11,524 INFO L225 Difference]: With dead ends: 1277 [2019-10-15 01:10:11,524 INFO L226 Difference]: Without dead ends: 657 [2019-10-15 01:10:11,530 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-15 01:10:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-15 01:10:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-15 01:10:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-15 01:10:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1035 transitions. [2019-10-15 01:10:11,562 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1035 transitions. Word has length 139 [2019-10-15 01:10:11,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:11,562 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1035 transitions. [2019-10-15 01:10:11,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:11,563 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1035 transitions. [2019-10-15 01:10:11,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:10:11,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:11,570 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:11,574 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:11,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:11,574 INFO L82 PathProgramCache]: Analyzing trace with hash 998018384, now seen corresponding path program 1 times [2019-10-15 01:10:11,575 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:11,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060819040] [2019-10-15 01:10:11,575 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:11,575 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:11,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:11,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060819040] [2019-10-15 01:10:11,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:11,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:10:11,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637097418] [2019-10-15 01:10:11,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:10:11,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:11,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:10:11,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:10:11,841 INFO L87 Difference]: Start difference. First operand 657 states and 1035 transitions. Second operand 10 states. [2019-10-15 01:10:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:12,045 INFO L93 Difference]: Finished difference Result 1235 states and 1953 transitions. [2019-10-15 01:10:12,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:10:12,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-15 01:10:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:12,051 INFO L225 Difference]: With dead ends: 1235 [2019-10-15 01:10:12,051 INFO L226 Difference]: Without dead ends: 666 [2019-10-15 01:10:12,055 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:10:12,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-10-15 01:10:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2019-10-15 01:10:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-10-15 01:10:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1044 transitions. [2019-10-15 01:10:12,090 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1044 transitions. Word has length 140 [2019-10-15 01:10:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:12,091 INFO L462 AbstractCegarLoop]: Abstraction has 664 states and 1044 transitions. [2019-10-15 01:10:12,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:10:12,091 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1044 transitions. [2019-10-15 01:10:12,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:10:12,097 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:12,097 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:12,097 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:12,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:12,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1692665391, now seen corresponding path program 1 times [2019-10-15 01:10:12,098 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:12,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504253145] [2019-10-15 01:10:12,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:12,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504253145] [2019-10-15 01:10:12,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:12,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:12,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582583595] [2019-10-15 01:10:12,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:12,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:12,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:12,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:12,295 INFO L87 Difference]: Start difference. First operand 664 states and 1044 transitions. Second operand 4 states. [2019-10-15 01:10:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:12,365 INFO L93 Difference]: Finished difference Result 1283 states and 2039 transitions. [2019-10-15 01:10:12,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:12,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-15 01:10:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:12,372 INFO L225 Difference]: With dead ends: 1283 [2019-10-15 01:10:12,373 INFO L226 Difference]: Without dead ends: 651 [2019-10-15 01:10:12,376 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-15 01:10:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-15 01:10:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-15 01:10:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-15 01:10:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1021 transitions. [2019-10-15 01:10:12,403 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1021 transitions. Word has length 140 [2019-10-15 01:10:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:12,404 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1021 transitions. [2019-10-15 01:10:12,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1021 transitions. [2019-10-15 01:10:12,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:10:12,409 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:12,409 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:12,409 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:12,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:12,410 INFO L82 PathProgramCache]: Analyzing trace with hash 677141201, now seen corresponding path program 1 times [2019-10-15 01:10:12,410 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:12,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019922129] [2019-10-15 01:10:12,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:12,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019922129] [2019-10-15 01:10:12,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:12,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:12,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379153614] [2019-10-15 01:10:12,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:12,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:12,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:12,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:12,585 INFO L87 Difference]: Start difference. First operand 651 states and 1021 transitions. Second operand 6 states. [2019-10-15 01:10:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:12,813 INFO L93 Difference]: Finished difference Result 1223 states and 1931 transitions. [2019-10-15 01:10:12,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:12,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-15 01:10:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:12,820 INFO L225 Difference]: With dead ends: 1223 [2019-10-15 01:10:12,820 INFO L226 Difference]: Without dead ends: 651 [2019-10-15 01:10:12,824 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-15 01:10:12,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-15 01:10:12,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-15 01:10:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-15 01:10:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1017 transitions. [2019-10-15 01:10:12,852 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1017 transitions. Word has length 141 [2019-10-15 01:10:12,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:12,853 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1017 transitions. [2019-10-15 01:10:12,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1017 transitions. [2019-10-15 01:10:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:10:12,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:12,859 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:12,859 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:12,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:12,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1320232493, now seen corresponding path program 1 times [2019-10-15 01:10:12,859 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:12,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770676307] [2019-10-15 01:10:12,860 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,860 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:13,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770676307] [2019-10-15 01:10:13,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:13,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:13,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57994148] [2019-10-15 01:10:13,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:13,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:13,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:13,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:13,003 INFO L87 Difference]: Start difference. First operand 651 states and 1017 transitions. Second operand 6 states. [2019-10-15 01:10:13,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:13,245 INFO L93 Difference]: Finished difference Result 1223 states and 1927 transitions. [2019-10-15 01:10:13,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:13,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-15 01:10:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:13,251 INFO L225 Difference]: With dead ends: 1223 [2019-10-15 01:10:13,251 INFO L226 Difference]: Without dead ends: 651 [2019-10-15 01:10:13,255 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-15 01:10:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-15 01:10:13,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-15 01:10:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-15 01:10:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1013 transitions. [2019-10-15 01:10:13,282 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1013 transitions. Word has length 142 [2019-10-15 01:10:13,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:13,282 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1013 transitions. [2019-10-15 01:10:13,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1013 transitions. [2019-10-15 01:10:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:10:13,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:13,287 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:13,288 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:13,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:13,288 INFO L82 PathProgramCache]: Analyzing trace with hash 893402902, now seen corresponding path program 1 times [2019-10-15 01:10:13,288 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:13,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44664537] [2019-10-15 01:10:13,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:13,445 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:13,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44664537] [2019-10-15 01:10:13,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:13,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:13,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675118446] [2019-10-15 01:10:13,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:13,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:13,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:13,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:13,449 INFO L87 Difference]: Start difference. First operand 651 states and 1013 transitions. Second operand 6 states. [2019-10-15 01:10:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:13,641 INFO L93 Difference]: Finished difference Result 1223 states and 1923 transitions. [2019-10-15 01:10:13,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:13,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-15 01:10:13,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:13,647 INFO L225 Difference]: With dead ends: 1223 [2019-10-15 01:10:13,647 INFO L226 Difference]: Without dead ends: 651 [2019-10-15 01:10:13,650 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-15 01:10:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-15 01:10:13,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-15 01:10:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-15 01:10:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1009 transitions. [2019-10-15 01:10:13,676 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1009 transitions. Word has length 143 [2019-10-15 01:10:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:13,677 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1009 transitions. [2019-10-15 01:10:13,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1009 transitions. [2019-10-15 01:10:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:10:13,682 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:13,682 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:13,682 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:13,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1947876246, now seen corresponding path program 1 times [2019-10-15 01:10:13,683 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:13,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960051570] [2019-10-15 01:10:13,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:13,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:13,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960051570] [2019-10-15 01:10:13,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:13,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:13,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419356395] [2019-10-15 01:10:13,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:13,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:13,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:13,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:13,828 INFO L87 Difference]: Start difference. First operand 651 states and 1009 transitions. Second operand 7 states. [2019-10-15 01:10:13,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:13,938 INFO L93 Difference]: Finished difference Result 1223 states and 1919 transitions. [2019-10-15 01:10:13,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:13,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-15 01:10:13,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:13,945 INFO L225 Difference]: With dead ends: 1223 [2019-10-15 01:10:13,945 INFO L226 Difference]: Without dead ends: 630 [2019-10-15 01:10:13,950 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-15 01:10:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-15 01:10:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-15 01:10:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-15 01:10:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 975 transitions. [2019-10-15 01:10:14,028 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 975 transitions. Word has length 143 [2019-10-15 01:10:14,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:14,028 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 975 transitions. [2019-10-15 01:10:14,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 975 transitions. [2019-10-15 01:10:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:10:14,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:14,032 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:14,033 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:14,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash 504333880, now seen corresponding path program 1 times [2019-10-15 01:10:14,033 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:14,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461184553] [2019-10-15 01:10:14,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:14,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:14,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:14,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461184553] [2019-10-15 01:10:14,174 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:14,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:14,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758264707] [2019-10-15 01:10:14,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:14,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:14,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:14,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:14,176 INFO L87 Difference]: Start difference. First operand 630 states and 975 transitions. Second operand 6 states. [2019-10-15 01:10:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:14,271 INFO L93 Difference]: Finished difference Result 1202 states and 1885 transitions. [2019-10-15 01:10:14,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:14,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-15 01:10:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:14,276 INFO L225 Difference]: With dead ends: 1202 [2019-10-15 01:10:14,276 INFO L226 Difference]: Without dead ends: 630 [2019-10-15 01:10:14,279 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-15 01:10:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-15 01:10:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-15 01:10:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-15 01:10:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 974 transitions. [2019-10-15 01:10:14,303 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 974 transitions. Word has length 144 [2019-10-15 01:10:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:14,303 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 974 transitions. [2019-10-15 01:10:14,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 974 transitions. [2019-10-15 01:10:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:10:14,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:14,308 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:14,309 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:14,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:14,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1035806555, now seen corresponding path program 1 times [2019-10-15 01:10:14,309 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:14,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255321610] [2019-10-15 01:10:14,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:14,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:14,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:14,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255321610] [2019-10-15 01:10:14,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:14,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:14,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447165977] [2019-10-15 01:10:14,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:14,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:14,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:14,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:14,440 INFO L87 Difference]: Start difference. First operand 630 states and 974 transitions. Second operand 6 states. [2019-10-15 01:10:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:14,535 INFO L93 Difference]: Finished difference Result 1202 states and 1884 transitions. [2019-10-15 01:10:14,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:14,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-15 01:10:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:14,541 INFO L225 Difference]: With dead ends: 1202 [2019-10-15 01:10:14,541 INFO L226 Difference]: Without dead ends: 630 [2019-10-15 01:10:14,545 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-15 01:10:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-15 01:10:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-15 01:10:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-15 01:10:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 973 transitions. [2019-10-15 01:10:14,569 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 973 transitions. Word has length 145 [2019-10-15 01:10:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:14,570 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 973 transitions. [2019-10-15 01:10:14,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 973 transitions. [2019-10-15 01:10:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:10:14,574 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:14,575 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:14,575 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:14,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:14,575 INFO L82 PathProgramCache]: Analyzing trace with hash 39300765, now seen corresponding path program 1 times [2019-10-15 01:10:14,576 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:14,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006635772] [2019-10-15 01:10:14,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:14,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:14,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 01:10:14,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006635772] [2019-10-15 01:10:14,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:14,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:10:14,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701132702] [2019-10-15 01:10:14,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:10:14,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:14,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:10:14,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:14,796 INFO L87 Difference]: Start difference. First operand 630 states and 973 transitions. Second operand 12 states. [2019-10-15 01:10:14,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:14,985 INFO L93 Difference]: Finished difference Result 1203 states and 1883 transitions. [2019-10-15 01:10:14,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:10:14,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-15 01:10:14,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:14,991 INFO L225 Difference]: With dead ends: 1203 [2019-10-15 01:10:14,991 INFO L226 Difference]: Without dead ends: 630 [2019-10-15 01:10:14,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:10:14,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-15 01:10:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-15 01:10:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-15 01:10:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 972 transitions. [2019-10-15 01:10:15,022 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 972 transitions. Word has length 146 [2019-10-15 01:10:15,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:15,022 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 972 transitions. [2019-10-15 01:10:15,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:10:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 972 transitions. [2019-10-15 01:10:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:10:15,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:15,036 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:15,037 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:15,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash -733497836, now seen corresponding path program 1 times [2019-10-15 01:10:15,037 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:15,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806169674] [2019-10-15 01:10:15,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:15,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:15,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-15 01:10:15,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806169674] [2019-10-15 01:10:15,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848500509] [2019-10-15 01:10:15,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:15,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 2771 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:10:15,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:16,074 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:17,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:10:17,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 18 [2019-10-15 01:10:17,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297486645] [2019-10-15 01:10:17,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:17,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:17,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:17,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:10:17,102 INFO L87 Difference]: Start difference. First operand 630 states and 972 transitions. Second operand 5 states. [2019-10-15 01:10:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:17,983 INFO L93 Difference]: Finished difference Result 1202 states and 1911 transitions. [2019-10-15 01:10:17,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:17,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-15 01:10:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:17,989 INFO L225 Difference]: With dead ends: 1202 [2019-10-15 01:10:17,989 INFO L226 Difference]: Without dead ends: 638 [2019-10-15 01:10:17,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 293 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:10:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-15 01:10:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-15 01:10:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-15 01:10:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 985 transitions. [2019-10-15 01:10:18,019 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 985 transitions. Word has length 147 [2019-10-15 01:10:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:18,019 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 985 transitions. [2019-10-15 01:10:18,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 985 transitions. [2019-10-15 01:10:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-15 01:10:18,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:18,024 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:18,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:18,236 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:18,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:18,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1966079276, now seen corresponding path program 1 times [2019-10-15 01:10:18,237 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:18,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271237156] [2019-10-15 01:10:18,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:18,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:18,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:18,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271237156] [2019-10-15 01:10:18,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:18,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:18,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304936848] [2019-10-15 01:10:18,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:18,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:18,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:18,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:18,453 INFO L87 Difference]: Start difference. First operand 638 states and 985 transitions. Second operand 6 states. [2019-10-15 01:10:19,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:19,264 INFO L93 Difference]: Finished difference Result 1217 states and 1935 transitions. [2019-10-15 01:10:19,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:19,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-10-15 01:10:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:19,269 INFO L225 Difference]: With dead ends: 1217 [2019-10-15 01:10:19,269 INFO L226 Difference]: Without dead ends: 643 [2019-10-15 01:10:19,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:10:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-15 01:10:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-10-15 01:10:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-15 01:10:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 989 transitions. [2019-10-15 01:10:19,298 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 989 transitions. Word has length 149 [2019-10-15 01:10:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:19,299 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 989 transitions. [2019-10-15 01:10:19,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 989 transitions. [2019-10-15 01:10:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-15 01:10:19,303 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:19,303 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:19,304 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:19,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:19,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1163052, now seen corresponding path program 1 times [2019-10-15 01:10:19,304 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:19,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18394701] [2019-10-15 01:10:19,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:19,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:19,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 01:10:19,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18394701] [2019-10-15 01:10:19,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679465610] [2019-10-15 01:10:19,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:20,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 2775 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:10:20,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:20,246 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:21,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:10:21,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 18 [2019-10-15 01:10:21,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671973255] [2019-10-15 01:10:21,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:21,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:21,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:21,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:10:21,012 INFO L87 Difference]: Start difference. First operand 643 states and 989 transitions. Second operand 5 states. [2019-10-15 01:10:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:22,017 INFO L93 Difference]: Finished difference Result 1228 states and 1939 transitions. [2019-10-15 01:10:22,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:22,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-15 01:10:22,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:22,022 INFO L225 Difference]: With dead ends: 1228 [2019-10-15 01:10:22,023 INFO L226 Difference]: Without dead ends: 651 [2019-10-15 01:10:22,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 301 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:10:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-15 01:10:22,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-15 01:10:22,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-15 01:10:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1002 transitions. [2019-10-15 01:10:22,051 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1002 transitions. Word has length 151 [2019-10-15 01:10:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:22,052 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1002 transitions. [2019-10-15 01:10:22,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1002 transitions. [2019-10-15 01:10:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:10:22,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:22,057 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:22,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:22,264 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:22,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1998068, now seen corresponding path program 1 times [2019-10-15 01:10:22,264 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:22,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028094447] [2019-10-15 01:10:22,265 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:22,265 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:22,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:10:22,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028094447] [2019-10-15 01:10:22,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127655068] [2019-10-15 01:10:22,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:23,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 2777 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:10:23,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:23,194 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:10:23,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:10:23,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 17 [2019-10-15 01:10:23,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145633125] [2019-10-15 01:10:23,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:23,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:23,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:23,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:10:23,885 INFO L87 Difference]: Start difference. First operand 651 states and 1002 transitions. Second operand 5 states. [2019-10-15 01:10:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:24,782 INFO L93 Difference]: Finished difference Result 1244 states and 1962 transitions. [2019-10-15 01:10:24,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:24,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-15 01:10:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:24,788 INFO L225 Difference]: With dead ends: 1244 [2019-10-15 01:10:24,789 INFO L226 Difference]: Without dead ends: 659 [2019-10-15 01:10:24,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 305 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:10:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-15 01:10:24,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-10-15 01:10:24,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-10-15 01:10:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1015 transitions. [2019-10-15 01:10:24,817 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1015 transitions. Word has length 153 [2019-10-15 01:10:24,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:24,818 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 1015 transitions. [2019-10-15 01:10:24,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1015 transitions. [2019-10-15 01:10:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:10:24,823 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:24,823 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:25,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:25,034 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:25,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:25,034 INFO L82 PathProgramCache]: Analyzing trace with hash -46315116, now seen corresponding path program 1 times [2019-10-15 01:10:25,034 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:25,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66696346] [2019-10-15 01:10:25,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:25,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:25,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:10:25,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66696346] [2019-10-15 01:10:25,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028543540] [2019-10-15 01:10:25,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:25,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 2779 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:10:25,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:10:25,919 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:10:26,238 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:26,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [11] total 18 [2019-10-15 01:10:26,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69577180] [2019-10-15 01:10:26,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:10:26,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:26,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:10:26,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:10:26,240 INFO L87 Difference]: Start difference. First operand 659 states and 1015 transitions. Second operand 9 states. [2019-10-15 01:10:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:27,627 INFO L93 Difference]: Finished difference Result 704 states and 1075 transitions. [2019-10-15 01:10:27,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:27,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-10-15 01:10:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:27,635 INFO L225 Difference]: With dead ends: 704 [2019-10-15 01:10:27,635 INFO L226 Difference]: Without dead ends: 687 [2019-10-15 01:10:27,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 313 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:10:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-10-15 01:10:27,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 673. [2019-10-15 01:10:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-10-15 01:10:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1034 transitions. [2019-10-15 01:10:27,665 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1034 transitions. Word has length 155 [2019-10-15 01:10:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:27,667 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 1034 transitions. [2019-10-15 01:10:27,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:10:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1034 transitions. [2019-10-15 01:10:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:10:27,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:27,672 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:27,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:27,880 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:27,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:27,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1624631089, now seen corresponding path program 1 times [2019-10-15 01:10:27,881 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:27,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675390878] [2019-10-15 01:10:27,882 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:27,882 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:27,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 01:10:28,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675390878] [2019-10-15 01:10:28,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248818612] [2019-10-15 01:10:28,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:28,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 01:10:28,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:10:28,863 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:10:29,135 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:29,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [11] total 14 [2019-10-15 01:10:29,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090649637] [2019-10-15 01:10:29,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:29,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:29,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:29,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:10:29,137 INFO L87 Difference]: Start difference. First operand 673 states and 1034 transitions. Second operand 5 states. [2019-10-15 01:10:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:29,176 INFO L93 Difference]: Finished difference Result 690 states and 1054 transitions. [2019-10-15 01:10:29,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:29,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-15 01:10:29,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:29,180 INFO L225 Difference]: With dead ends: 690 [2019-10-15 01:10:29,180 INFO L226 Difference]: Without dead ends: 673 [2019-10-15 01:10:29,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 329 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:10:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-10-15 01:10:29,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2019-10-15 01:10:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-10-15 01:10:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1032 transitions. [2019-10-15 01:10:29,211 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1032 transitions. Word has length 161 [2019-10-15 01:10:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:29,211 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 1032 transitions. [2019-10-15 01:10:29,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1032 transitions. [2019-10-15 01:10:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-15 01:10:29,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:29,217 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:29,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:29,434 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:29,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:29,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1739480465, now seen corresponding path program 1 times [2019-10-15 01:10:29,435 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:29,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440374599] [2019-10-15 01:10:29,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:29,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:29,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:10:29,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440374599] [2019-10-15 01:10:29,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91551264] [2019-10-15 01:10:29,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:30,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:10:30,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:30,356 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-15 01:10:30,357 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:30,774 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-15 01:10:30,774 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:30,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 18 [2019-10-15 01:10:30,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534639919] [2019-10-15 01:10:30,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:10:30,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:30,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:10:30,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:10:30,778 INFO L87 Difference]: Start difference. First operand 673 states and 1032 transitions. Second operand 9 states. [2019-10-15 01:10:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:36,087 INFO L93 Difference]: Finished difference Result 1972 states and 3106 transitions. [2019-10-15 01:10:36,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:10:36,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2019-10-15 01:10:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:36,101 INFO L225 Difference]: With dead ends: 1972 [2019-10-15 01:10:36,102 INFO L226 Difference]: Without dead ends: 1365 [2019-10-15 01:10:36,105 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2019-10-15 01:10:36,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-10-15 01:10:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1322. [2019-10-15 01:10:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-10-15 01:10:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2071 transitions. [2019-10-15 01:10:36,185 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2071 transitions. Word has length 179 [2019-10-15 01:10:36,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:36,185 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 2071 transitions. [2019-10-15 01:10:36,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:10:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2071 transitions. [2019-10-15 01:10:36,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-15 01:10:36,191 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:36,192 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:36,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:36,400 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:36,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:36,401 INFO L82 PathProgramCache]: Analyzing trace with hash -802437721, now seen corresponding path program 1 times [2019-10-15 01:10:36,402 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:36,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705516389] [2019-10-15 01:10:36,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:36,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:36,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat