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_spec3_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:11:10,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:11:10,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:11:10,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:11:10,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:11:10,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:11:10,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:11:10,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:11:10,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:11:10,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:11:10,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:11:10,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:11:10,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:11:10,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:11:10,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:11:10,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:11:10,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:11:10,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:11:10,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:11:10,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:11:10,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:11:10,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:11:10,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:11:10,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:11:10,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:11:10,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:11:10,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:11:10,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:11:10,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:11:10,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:11:10,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:11:10,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:11:10,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:11:10,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:11:10,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:11:10,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:11:10,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:11:10,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:11:10,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:11:10,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:11:10,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:11:10,472 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:11:10,490 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:11:10,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:11:10,491 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:11:10,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:11:10,492 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:11:10,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:11:10,492 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:11:10,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:11:10,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:11:10,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:11:10,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:11:10,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:11:10,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:11:10,494 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:11:10,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:11:10,495 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:11:10,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:11:10,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:11:10,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:11:10,496 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:11:10,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:11:10,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:11:10,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:11:10,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:11:10,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:11:10,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:11:10,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:11:10,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:11:10,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:11:10,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:11:10,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:11:10,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:11:10,771 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:11:10,771 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:11:10,772 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product03.cil.c [2019-10-13 21:11:10,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6830c69da/a4ee4ef99a5d45aeaace470c3359646b/FLAG5b28c5874 [2019-10-13 21:11:11,507 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:11:11,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product03.cil.c [2019-10-13 21:11:11,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6830c69da/a4ee4ef99a5d45aeaace470c3359646b/FLAG5b28c5874 [2019-10-13 21:11:11,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6830c69da/a4ee4ef99a5d45aeaace470c3359646b [2019-10-13 21:11:11,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:11:11,742 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:11:11,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:11,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:11:11,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:11:11,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:11" (1/1) ... [2019-10-13 21:11:11,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c301fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:11, skipping insertion in model container [2019-10-13 21:11:11,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:11" (1/1) ... [2019-10-13 21:11:11,758 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:11:11,833 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:11:12,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:12,522 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:11:12,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:11:12,715 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:11:12,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:12 WrapperNode [2019-10-13 21:11:12,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:11:12,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:11:12,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:11:12,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:11:12,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:12" (1/1) ... [2019-10-13 21:11:12,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:12" (1/1) ... [2019-10-13 21:11:12,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:12" (1/1) ... [2019-10-13 21:11:12,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:12" (1/1) ... [2019-10-13 21:11:12,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:12" (1/1) ... [2019-10-13 21:11:12,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:12" (1/1) ... [2019-10-13 21:11:12,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:12" (1/1) ... [2019-10-13 21:11:12,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:11:12,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:11:12,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:11:12,923 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:11:12,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:11:12,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:11:12,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:11:12,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:12,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:12,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:12,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:12,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:11:12,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:11:12,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:11:12,994 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:11:12,994 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:11:12,995 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:12,995 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:12,995 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:11:12,995 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:11:12,996 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:11:12,996 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:11:12,996 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:11:12,996 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:11:12,997 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:11:12,997 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:11:12,997 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:11:12,997 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:11:12,998 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:11:12,998 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:11:12,998 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:11:12,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:11:12,999 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:11:12,999 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:11:12,999 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:11:12,999 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:11:13,000 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:11:13,000 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:11:13,000 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:11:13,000 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:11:13,000 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:11:13,001 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:11:13,001 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:11:13,001 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:11:13,001 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:11:13,001 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:11:13,002 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__base [2019-10-13 21:11:13,002 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:11:13,002 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:11:13,002 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:11:13,002 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-13 21:11:13,002 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:13,003 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:11:13,003 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:11:13,003 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:11:13,003 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:11:13,003 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:11:13,003 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:11:13,004 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:11:13,004 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:11:13,004 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:11:13,004 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:11:13,004 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:11:13,005 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:11:13,005 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:11:13,005 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:11:13,005 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:11:13,005 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:11:13,006 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:11:13,006 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:11:13,006 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:11:13,006 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:11:13,006 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:11:13,006 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:11:13,007 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:11:13,007 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:11:13,007 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:11:13,007 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:11:13,007 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:11:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:11:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:11:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:11:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:11:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:11:13,008 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:11:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:11:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:11:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:11:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:11:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:11:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:11:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:11:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:11:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:11:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:11:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:11:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:11:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:11:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:11:13,011 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:11:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:11:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:11:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:11:13,012 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:11:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:11:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:11:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:11:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:11:13,013 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:11:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:11:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:11:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-13 21:11:13,014 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-13 21:11:13,015 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:11:13,015 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:11:13,015 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:11:13,015 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:11:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:11:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:11:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:11:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:11:13,016 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:11:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:11:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:11:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:11:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:11:13,017 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:11:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:11:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:11:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:11:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:11:13,018 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:11:13,019 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:11:13,019 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:11:13,019 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:11:13,019 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:11:13,019 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:11:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:11:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:11:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:11:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:11:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__base [2019-10-13 21:11:13,021 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:11:13,021 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:11:13,021 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-13 21:11:13,021 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:11:13,021 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:11:13,022 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:11:13,022 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:11:13,022 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:11:13,022 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:11:13,022 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:11:13,022 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:11:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:11:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:11:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:11:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:11:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:11:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:11:13,024 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:11:13,024 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:11:13,024 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:11:13,024 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:11:13,024 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:11:13,024 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:11:13,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:11:13,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:11:13,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:11:15,530 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:11:15,531 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:11:15,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:15 BoogieIcfgContainer [2019-10-13 21:11:15,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:11:15,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:11:15,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:11:15,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:11:15,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:11:11" (1/3) ... [2019-10-13 21:11:15,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f56400e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:15, skipping insertion in model container [2019-10-13 21:11:15,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:12" (2/3) ... [2019-10-13 21:11:15,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f56400e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:15, skipping insertion in model container [2019-10-13 21:11:15,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:15" (3/3) ... [2019-10-13 21:11:15,545 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product03.cil.c [2019-10-13 21:11:15,558 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:11:15,569 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:11:15,585 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:11:15,643 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:11:15,643 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:11:15,643 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:11:15,643 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:11:15,643 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:11:15,644 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:11:15,644 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:11:15,644 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:11:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states. [2019-10-13 21:11:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:11:15,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:15,729 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] [2019-10-13 21:11:15,731 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:15,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:15,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1710974497, now seen corresponding path program 1 times [2019-10-13 21:11:15,747 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:15,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254054921] [2019-10-13 21:11:15,748 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:15,748 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:15,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:16,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254054921] [2019-10-13 21:11:16,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:16,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:16,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164602108] [2019-10-13 21:11:16,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:16,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:16,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:16,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:16,389 INFO L87 Difference]: Start difference. First operand 769 states. Second operand 7 states. [2019-10-13 21:11:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:16,707 INFO L93 Difference]: Finished difference Result 1217 states and 1978 transitions. [2019-10-13 21:11:16,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:16,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-10-13 21:11:16,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:16,748 INFO L225 Difference]: With dead ends: 1217 [2019-10-13 21:11:16,749 INFO L226 Difference]: Without dead ends: 617 [2019-10-13 21:11:16,761 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:16,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-13 21:11:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 615. [2019-10-13 21:11:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-13 21:11:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 984 transitions. [2019-10-13 21:11:16,905 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 984 transitions. Word has length 141 [2019-10-13 21:11:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:16,906 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 984 transitions. [2019-10-13 21:11:16,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 984 transitions. [2019-10-13 21:11:16,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:11:16,913 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:16,913 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] [2019-10-13 21:11:16,913 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:16,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:16,914 INFO L82 PathProgramCache]: Analyzing trace with hash 896936914, now seen corresponding path program 1 times [2019-10-13 21:11:16,914 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:16,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820351131] [2019-10-13 21:11:16,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:16,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:16,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:17,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820351131] [2019-10-13 21:11:17,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:17,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:17,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963880237] [2019-10-13 21:11:17,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:17,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:17,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:17,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:17,195 INFO L87 Difference]: Start difference. First operand 615 states and 984 transitions. Second operand 4 states. [2019-10-13 21:11:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:17,285 INFO L93 Difference]: Finished difference Result 1196 states and 1933 transitions. [2019-10-13 21:11:17,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:17,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-13 21:11:17,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:17,291 INFO L225 Difference]: With dead ends: 1196 [2019-10-13 21:11:17,292 INFO L226 Difference]: Without dead ends: 597 [2019-10-13 21:11:17,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-13 21:11:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-10-13 21:11:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-13 21:11:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 951 transitions. [2019-10-13 21:11:17,348 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 951 transitions. Word has length 142 [2019-10-13 21:11:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:17,350 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 951 transitions. [2019-10-13 21:11:17,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 951 transitions. [2019-10-13 21:11:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:11:17,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:17,358 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] [2019-10-13 21:11:17,359 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:17,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:17,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1517302758, now seen corresponding path program 1 times [2019-10-13 21:11:17,367 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:17,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766345540] [2019-10-13 21:11:17,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,368 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:17,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766345540] [2019-10-13 21:11:17,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:17,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:17,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567563398] [2019-10-13 21:11:17,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:17,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:17,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:17,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:17,660 INFO L87 Difference]: Start difference. First operand 597 states and 951 transitions. Second operand 7 states. [2019-10-13 21:11:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:17,803 INFO L93 Difference]: Finished difference Result 1165 states and 1875 transitions. [2019-10-13 21:11:17,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:17,804 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-10-13 21:11:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:17,811 INFO L225 Difference]: With dead ends: 1165 [2019-10-13 21:11:17,812 INFO L226 Difference]: Without dead ends: 591 [2019-10-13 21:11:17,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-13 21:11:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-13 21:11:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-13 21:11:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 938 transitions. [2019-10-13 21:11:17,865 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 938 transitions. Word has length 142 [2019-10-13 21:11:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:17,867 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 938 transitions. [2019-10-13 21:11:17,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 938 transitions. [2019-10-13 21:11:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:11:17,879 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:17,879 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] [2019-10-13 21:11:17,880 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:17,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:17,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1570420835, now seen corresponding path program 1 times [2019-10-13 21:11:17,881 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:17,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722501969] [2019-10-13 21:11:17,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:17,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:18,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722501969] [2019-10-13 21:11:18,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:18,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:18,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366330707] [2019-10-13 21:11:18,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:18,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:18,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:18,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:18,131 INFO L87 Difference]: Start difference. First operand 591 states and 938 transitions. Second operand 7 states. [2019-10-13 21:11:18,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:18,231 INFO L93 Difference]: Finished difference Result 1153 states and 1849 transitions. [2019-10-13 21:11:18,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:18,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-13 21:11:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:18,240 INFO L225 Difference]: With dead ends: 1153 [2019-10-13 21:11:18,240 INFO L226 Difference]: Without dead ends: 585 [2019-10-13 21:11:18,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-13 21:11:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-13 21:11:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-13 21:11:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 925 transitions. [2019-10-13 21:11:18,269 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 925 transitions. Word has length 143 [2019-10-13 21:11:18,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:18,270 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 925 transitions. [2019-10-13 21:11:18,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 925 transitions. [2019-10-13 21:11:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:11:18,274 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:18,274 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] [2019-10-13 21:11:18,275 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:18,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:18,275 INFO L82 PathProgramCache]: Analyzing trace with hash -115528610, now seen corresponding path program 1 times [2019-10-13 21:11:18,275 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:18,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118993374] [2019-10-13 21:11:18,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:18,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118993374] [2019-10-13 21:11:18,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:18,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:18,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592197840] [2019-10-13 21:11:18,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:18,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:18,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:18,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:18,431 INFO L87 Difference]: Start difference. First operand 585 states and 925 transitions. Second operand 7 states. [2019-10-13 21:11:18,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:18,531 INFO L93 Difference]: Finished difference Result 1141 states and 1823 transitions. [2019-10-13 21:11:18,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:18,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-13 21:11:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:18,543 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 21:11:18,543 INFO L226 Difference]: Without dead ends: 579 [2019-10-13 21:11:18,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:18,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-13 21:11:18,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-10-13 21:11:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-13 21:11:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 912 transitions. [2019-10-13 21:11:18,571 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 912 transitions. Word has length 144 [2019-10-13 21:11:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:18,571 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 912 transitions. [2019-10-13 21:11:18,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 912 transitions. [2019-10-13 21:11:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:11:18,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:18,576 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] [2019-10-13 21:11:18,576 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:18,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:18,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1354475425, now seen corresponding path program 1 times [2019-10-13 21:11:18,578 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:18,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833949653] [2019-10-13 21:11:18,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:18,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833949653] [2019-10-13 21:11:18,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:18,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:18,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071409797] [2019-10-13 21:11:18,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:18,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:18,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:18,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:18,801 INFO L87 Difference]: Start difference. First operand 579 states and 912 transitions. Second operand 7 states. [2019-10-13 21:11:18,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:18,878 INFO L93 Difference]: Finished difference Result 1129 states and 1797 transitions. [2019-10-13 21:11:18,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:11:18,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-13 21:11:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:18,883 INFO L225 Difference]: With dead ends: 1129 [2019-10-13 21:11:18,884 INFO L226 Difference]: Without dead ends: 579 [2019-10-13 21:11:18,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:11:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-13 21:11:18,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-10-13 21:11:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-13 21:11:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 911 transitions. [2019-10-13 21:11:18,906 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 911 transitions. Word has length 144 [2019-10-13 21:11:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:18,907 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 911 transitions. [2019-10-13 21:11:18,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 911 transitions. [2019-10-13 21:11:18,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:11:18,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:18,911 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] [2019-10-13 21:11:18,911 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:18,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:18,911 INFO L82 PathProgramCache]: Analyzing trace with hash 538513127, now seen corresponding path program 1 times [2019-10-13 21:11:18,911 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:18,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916614524] [2019-10-13 21:11:18,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:18,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:19,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916614524] [2019-10-13 21:11:19,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:19,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:19,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288159688] [2019-10-13 21:11:19,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:19,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:19,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:19,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:19,031 INFO L87 Difference]: Start difference. First operand 579 states and 911 transitions. Second operand 5 states. [2019-10-13 21:11:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:19,102 INFO L93 Difference]: Finished difference Result 1128 states and 1794 transitions. [2019-10-13 21:11:19,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:19,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-13 21:11:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:19,107 INFO L225 Difference]: With dead ends: 1128 [2019-10-13 21:11:19,107 INFO L226 Difference]: Without dead ends: 579 [2019-10-13 21:11:19,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:19,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-13 21:11:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-10-13 21:11:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-13 21:11:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 910 transitions. [2019-10-13 21:11:19,128 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 910 transitions. Word has length 145 [2019-10-13 21:11:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:19,129 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 910 transitions. [2019-10-13 21:11:19,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 910 transitions. [2019-10-13 21:11:19,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:11:19,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:19,133 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] [2019-10-13 21:11:19,133 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:19,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:19,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1098945642, now seen corresponding path program 1 times [2019-10-13 21:11:19,133 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:19,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181392614] [2019-10-13 21:11:19,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:19,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181392614] [2019-10-13 21:11:19,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:19,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:19,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666013303] [2019-10-13 21:11:19,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:19,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:19,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:19,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:19,268 INFO L87 Difference]: Start difference. First operand 579 states and 910 transitions. Second operand 5 states. [2019-10-13 21:11:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:19,343 INFO L93 Difference]: Finished difference Result 1128 states and 1792 transitions. [2019-10-13 21:11:19,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:19,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-10-13 21:11:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:19,348 INFO L225 Difference]: With dead ends: 1128 [2019-10-13 21:11:19,348 INFO L226 Difference]: Without dead ends: 579 [2019-10-13 21:11:19,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-13 21:11:19,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-10-13 21:11:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-13 21:11:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 909 transitions. [2019-10-13 21:11:19,373 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 909 transitions. Word has length 146 [2019-10-13 21:11:19,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:19,374 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 909 transitions. [2019-10-13 21:11:19,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 909 transitions. [2019-10-13 21:11:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:11:19,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:19,382 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] [2019-10-13 21:11:19,382 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:19,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:19,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1332579362, now seen corresponding path program 1 times [2019-10-13 21:11:19,383 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:19,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056515568] [2019-10-13 21:11:19,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:19,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056515568] [2019-10-13 21:11:19,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:19,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:19,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157765523] [2019-10-13 21:11:19,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:19,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:19,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:19,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:19,552 INFO L87 Difference]: Start difference. First operand 579 states and 909 transitions. Second operand 5 states. [2019-10-13 21:11:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:19,620 INFO L93 Difference]: Finished difference Result 1128 states and 1790 transitions. [2019-10-13 21:11:19,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:19,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 21:11:19,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:19,625 INFO L225 Difference]: With dead ends: 1128 [2019-10-13 21:11:19,625 INFO L226 Difference]: Without dead ends: 579 [2019-10-13 21:11:19,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:19,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-13 21:11:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-10-13 21:11:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-13 21:11:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 908 transitions. [2019-10-13 21:11:19,648 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 908 transitions. Word has length 147 [2019-10-13 21:11:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:19,648 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 908 transitions. [2019-10-13 21:11:19,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 908 transitions. [2019-10-13 21:11:19,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:11:19,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:19,652 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] [2019-10-13 21:11:19,652 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:19,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:19,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1053582449, now seen corresponding path program 1 times [2019-10-13 21:11:19,653 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:19,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785527255] [2019-10-13 21:11:19,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:19,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785527255] [2019-10-13 21:11:19,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:19,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:11:19,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036009720] [2019-10-13 21:11:19,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:19,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:19,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:19,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:19,770 INFO L87 Difference]: Start difference. First operand 579 states and 908 transitions. Second operand 5 states. [2019-10-13 21:11:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:19,835 INFO L93 Difference]: Finished difference Result 1128 states and 1788 transitions. [2019-10-13 21:11:19,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:19,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:11:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:19,841 INFO L225 Difference]: With dead ends: 1128 [2019-10-13 21:11:19,841 INFO L226 Difference]: Without dead ends: 579 [2019-10-13 21:11:19,844 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:11:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-13 21:11:19,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-10-13 21:11:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-13 21:11:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 907 transitions. [2019-10-13 21:11:19,869 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 907 transitions. Word has length 148 [2019-10-13 21:11:19,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:19,869 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 907 transitions. [2019-10-13 21:11:19,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:19,869 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 907 transitions. [2019-10-13 21:11:19,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:11:19,874 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:19,874 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] [2019-10-13 21:11:19,875 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:19,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:19,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1647215267, now seen corresponding path program 1 times [2019-10-13 21:11:19,876 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:19,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549994758] [2019-10-13 21:11:19,876 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,876 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:19,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:20,122 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:11:20,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549994758] [2019-10-13 21:11:20,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051687400] [2019-10-13 21:11:20,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:20,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 3036 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:20,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:20,729 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:20,896 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:20,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-13 21:11:20,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731607708] [2019-10-13 21:11:20,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:20,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:20,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:20,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:20,898 INFO L87 Difference]: Start difference. First operand 579 states and 907 transitions. Second operand 3 states. [2019-10-13 21:11:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:20,986 INFO L93 Difference]: Finished difference Result 1616 states and 2581 transitions. [2019-10-13 21:11:20,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:20,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-13 21:11:20,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:20,995 INFO L225 Difference]: With dead ends: 1616 [2019-10-13 21:11:20,996 INFO L226 Difference]: Without dead ends: 1071 [2019-10-13 21:11:20,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2019-10-13 21:11:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1058. [2019-10-13 21:11:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2019-10-13 21:11:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1677 transitions. [2019-10-13 21:11:21,075 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1677 transitions. Word has length 149 [2019-10-13 21:11:21,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:21,079 INFO L462 AbstractCegarLoop]: Abstraction has 1058 states and 1677 transitions. [2019-10-13 21:11:21,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1677 transitions. [2019-10-13 21:11:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:11:21,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:21,086 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] [2019-10-13 21:11:21,294 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:21,295 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:21,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:21,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1609221353, now seen corresponding path program 1 times [2019-10-13 21:11:21,297 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:21,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624480747] [2019-10-13 21:11:21,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:21,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:21,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:11:21,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624480747] [2019-10-13 21:11:21,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108643103] [2019-10-13 21:11:21,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:22,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 3037 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:22,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:22,253 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:22,428 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:22,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-13 21:11:22,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985895901] [2019-10-13 21:11:22,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:22,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:22,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:22,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:22,430 INFO L87 Difference]: Start difference. First operand 1058 states and 1677 transitions. Second operand 3 states. [2019-10-13 21:11:22,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:22,527 INFO L93 Difference]: Finished difference Result 2574 states and 4123 transitions. [2019-10-13 21:11:22,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:22,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-13 21:11:22,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:22,540 INFO L225 Difference]: With dead ends: 2574 [2019-10-13 21:11:22,540 INFO L226 Difference]: Without dead ends: 1550 [2019-10-13 21:11:22,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:11:22,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2019-10-13 21:11:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1501. [2019-10-13 21:11:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2019-10-13 21:11:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2400 transitions. [2019-10-13 21:11:22,618 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2400 transitions. Word has length 150 [2019-10-13 21:11:22,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:22,618 INFO L462 AbstractCegarLoop]: Abstraction has 1501 states and 2400 transitions. [2019-10-13 21:11:22,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2400 transitions. [2019-10-13 21:11:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 21:11:22,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:22,628 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, 1] [2019-10-13 21:11:22,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:22,836 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash 515426087, now seen corresponding path program 1 times [2019-10-13 21:11:22,837 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:22,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799457104] [2019-10-13 21:11:22,838 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:22,838 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:22,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:22,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799457104] [2019-10-13 21:11:22,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:22,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:22,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4913657] [2019-10-13 21:11:22,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:22,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:22,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:22,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:22,981 INFO L87 Difference]: Start difference. First operand 1501 states and 2400 transitions. Second operand 7 states. [2019-10-13 21:11:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:25,503 INFO L93 Difference]: Finished difference Result 4425 states and 7227 transitions. [2019-10-13 21:11:25,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:25,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2019-10-13 21:11:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:25,535 INFO L225 Difference]: With dead ends: 4425 [2019-10-13 21:11:25,535 INFO L226 Difference]: Without dead ends: 2958 [2019-10-13 21:11:25,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2019-10-13 21:11:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2888. [2019-10-13 21:11:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2019-10-13 21:11:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4693 transitions. [2019-10-13 21:11:25,702 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4693 transitions. Word has length 152 [2019-10-13 21:11:25,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:25,704 INFO L462 AbstractCegarLoop]: Abstraction has 2888 states and 4693 transitions. [2019-10-13 21:11:25,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4693 transitions. [2019-10-13 21:11:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:25,714 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:25,715 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, 1, 1] [2019-10-13 21:11:25,715 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash 484144798, now seen corresponding path program 1 times [2019-10-13 21:11:25,716 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:25,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763193573] [2019-10-13 21:11:25,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:25,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:25,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:11:25,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763193573] [2019-10-13 21:11:25,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270294683] [2019-10-13 21:11:25,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:26,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 3055 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:11:26,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:26,692 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:26,810 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:26,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-10-13 21:11:26,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025707383] [2019-10-13 21:11:26,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:26,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:26,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:26,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:11:26,814 INFO L87 Difference]: Start difference. First operand 2888 states and 4693 transitions. Second operand 4 states. [2019-10-13 21:11:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:26,959 INFO L93 Difference]: Finished difference Result 5814 states and 9533 transitions. [2019-10-13 21:11:26,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:11:26,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-13 21:11:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:26,981 INFO L225 Difference]: With dead ends: 5814 [2019-10-13 21:11:26,982 INFO L226 Difference]: Without dead ends: 2960 [2019-10-13 21:11:26,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:11:27,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2019-10-13 21:11:27,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 2910. [2019-10-13 21:11:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2910 states. [2019-10-13 21:11:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4721 transitions. [2019-10-13 21:11:27,128 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4721 transitions. Word has length 153 [2019-10-13 21:11:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:27,128 INFO L462 AbstractCegarLoop]: Abstraction has 2910 states and 4721 transitions. [2019-10-13 21:11:27,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4721 transitions. [2019-10-13 21:11:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:27,139 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:27,139 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, 1, 1] [2019-10-13 21:11:27,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:27,349 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:27,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:27,350 INFO L82 PathProgramCache]: Analyzing trace with hash 318290409, now seen corresponding path program 1 times [2019-10-13 21:11:27,350 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:27,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294907516] [2019-10-13 21:11:27,351 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:27,351 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:27,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:27,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294907516] [2019-10-13 21:11:27,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:27,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:27,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832970924] [2019-10-13 21:11:27,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:27,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:27,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:27,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:27,471 INFO L87 Difference]: Start difference. First operand 2910 states and 4721 transitions. Second operand 4 states. [2019-10-13 21:11:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:27,624 INFO L93 Difference]: Finished difference Result 5780 states and 9450 transitions. [2019-10-13 21:11:27,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:27,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-13 21:11:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:27,646 INFO L225 Difference]: With dead ends: 5780 [2019-10-13 21:11:27,646 INFO L226 Difference]: Without dead ends: 2904 [2019-10-13 21:11:27,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:27,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2019-10-13 21:11:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 2894. [2019-10-13 21:11:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2894 states. [2019-10-13 21:11:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 4669 transitions. [2019-10-13 21:11:27,775 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 4669 transitions. Word has length 153 [2019-10-13 21:11:27,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:27,776 INFO L462 AbstractCegarLoop]: Abstraction has 2894 states and 4669 transitions. [2019-10-13 21:11:27,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 4669 transitions. [2019-10-13 21:11:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:27,782 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:27,783 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, 1, 1] [2019-10-13 21:11:27,783 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:27,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:27,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1785476129, now seen corresponding path program 1 times [2019-10-13 21:11:27,783 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:27,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342380367] [2019-10-13 21:11:27,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:27,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:27,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 21:11:28,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342380367] [2019-10-13 21:11:28,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598366634] [2019-10-13 21:11:28,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:28,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 3056 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:11:28,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:11:28,612 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:11:28,721 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:11:28,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 11 [2019-10-13 21:11:28,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460059838] [2019-10-13 21:11:28,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:11:28,722 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:28,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:11:28,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:11:28,723 INFO L87 Difference]: Start difference. First operand 2894 states and 4669 transitions. Second operand 3 states. [2019-10-13 21:11:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:28,882 INFO L93 Difference]: Finished difference Result 8582 states and 14025 transitions. [2019-10-13 21:11:28,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:11:28,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-13 21:11:28,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:28,934 INFO L225 Difference]: With dead ends: 8582 [2019-10-13 21:11:28,934 INFO L226 Difference]: Without dead ends: 5723 [2019-10-13 21:11:28,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:11:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5723 states. [2019-10-13 21:11:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5723 to 5653. [2019-10-13 21:11:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5653 states. [2019-10-13 21:11:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 9202 transitions. [2019-10-13 21:11:29,157 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 9202 transitions. Word has length 153 [2019-10-13 21:11:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:29,158 INFO L462 AbstractCegarLoop]: Abstraction has 5653 states and 9202 transitions. [2019-10-13 21:11:29,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:11:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 9202 transitions. [2019-10-13 21:11:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:11:29,164 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:29,165 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, 1, 1] [2019-10-13 21:11:29,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:29,377 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:29,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:29,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1229627489, now seen corresponding path program 1 times [2019-10-13 21:11:29,377 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:29,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119649984] [2019-10-13 21:11:29,377 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:29,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:29,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 21:11:29,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119649984] [2019-10-13 21:11:29,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031932443] [2019-10-13 21:11:29,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:30,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 3057 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 21:11:30,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:30,344 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:30,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:11:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:11:30,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:11:30,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 7] total 20 [2019-10-13 21:11:30,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821865072] [2019-10-13 21:11:30,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:11:30,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:30,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:11:30,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-13 21:11:30,648 INFO L87 Difference]: Start difference. First operand 5653 states and 9202 transitions. Second operand 6 states. [2019-10-13 21:11:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:32,080 INFO L93 Difference]: Finished difference Result 15172 states and 24939 transitions. [2019-10-13 21:11:32,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:32,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-10-13 21:11:32,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:32,153 INFO L225 Difference]: With dead ends: 15172 [2019-10-13 21:11:32,154 INFO L226 Difference]: Without dead ends: 9553 [2019-10-13 21:11:32,180 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-13 21:11:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9553 states. [2019-10-13 21:11:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9553 to 9513. [2019-10-13 21:11:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9513 states. [2019-10-13 21:11:32,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9513 states to 9513 states and 15166 transitions. [2019-10-13 21:11:32,582 INFO L78 Accepts]: Start accepts. Automaton has 9513 states and 15166 transitions. Word has length 153 [2019-10-13 21:11:32,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:32,582 INFO L462 AbstractCegarLoop]: Abstraction has 9513 states and 15166 transitions. [2019-10-13 21:11:32,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:11:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 9513 states and 15166 transitions. [2019-10-13 21:11:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:11:32,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:32,588 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:32,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:32,804 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:32,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:32,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2070244592, now seen corresponding path program 1 times [2019-10-13 21:11:32,804 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:32,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557325228] [2019-10-13 21:11:32,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:32,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:32,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:11:32,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557325228] [2019-10-13 21:11:32,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:32,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:32,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356455672] [2019-10-13 21:11:32,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:32,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:32,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:32,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:32,960 INFO L87 Difference]: Start difference. First operand 9513 states and 15166 transitions. Second operand 7 states. [2019-10-13 21:11:36,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:36,147 INFO L93 Difference]: Finished difference Result 28456 states and 46340 transitions. [2019-10-13 21:11:36,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:36,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-10-13 21:11:36,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:36,254 INFO L225 Difference]: With dead ends: 28456 [2019-10-13 21:11:36,255 INFO L226 Difference]: Without dead ends: 18977 [2019-10-13 21:11:36,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:36,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18977 states. [2019-10-13 21:11:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18977 to 18849. [2019-10-13 21:11:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18849 states. [2019-10-13 21:11:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18849 states to 18849 states and 30362 transitions. [2019-10-13 21:11:37,000 INFO L78 Accepts]: Start accepts. Automaton has 18849 states and 30362 transitions. Word has length 161 [2019-10-13 21:11:37,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:37,001 INFO L462 AbstractCegarLoop]: Abstraction has 18849 states and 30362 transitions. [2019-10-13 21:11:37,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:11:37,001 INFO L276 IsEmpty]: Start isEmpty. Operand 18849 states and 30362 transitions. [2019-10-13 21:11:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-13 21:11:37,007 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:37,007 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, 1] [2019-10-13 21:11:37,008 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:37,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:37,009 INFO L82 PathProgramCache]: Analyzing trace with hash -529036724, now seen corresponding path program 1 times [2019-10-13 21:11:37,010 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:37,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393316805] [2019-10-13 21:11:37,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:37,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:37,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:11:37,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393316805] [2019-10-13 21:11:37,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:37,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:11:37,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435657003] [2019-10-13 21:11:37,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:11:37,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:37,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:11:37,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:11:37,149 INFO L87 Difference]: Start difference. First operand 18849 states and 30362 transitions. Second operand 4 states. [2019-10-13 21:11:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:37,740 INFO L93 Difference]: Finished difference Result 37740 states and 61311 transitions. [2019-10-13 21:11:37,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:11:37,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-13 21:11:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:37,844 INFO L225 Difference]: With dead ends: 37740 [2019-10-13 21:11:37,845 INFO L226 Difference]: Without dead ends: 18919 [2019-10-13 21:11:37,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:11:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18919 states. [2019-10-13 21:11:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18919 to 18855. [2019-10-13 21:11:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18855 states. [2019-10-13 21:11:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18855 states to 18855 states and 30286 transitions. [2019-10-13 21:11:38,599 INFO L78 Accepts]: Start accepts. Automaton has 18855 states and 30286 transitions. Word has length 162 [2019-10-13 21:11:38,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:38,600 INFO L462 AbstractCegarLoop]: Abstraction has 18855 states and 30286 transitions. [2019-10-13 21:11:38,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:11:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 18855 states and 30286 transitions. [2019-10-13 21:11:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-13 21:11:38,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:38,605 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:38,605 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:38,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:38,606 INFO L82 PathProgramCache]: Analyzing trace with hash 290171593, now seen corresponding path program 1 times [2019-10-13 21:11:38,606 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:38,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585571887] [2019-10-13 21:11:38,606 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:38,606 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:38,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:38,958 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:11:38,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585571887] [2019-10-13 21:11:38,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:38,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:38,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089007671] [2019-10-13 21:11:38,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:38,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:38,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:38,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:38,960 INFO L87 Difference]: Start difference. First operand 18855 states and 30286 transitions. Second operand 7 states. [2019-10-13 21:11:42,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:42,654 INFO L93 Difference]: Finished difference Result 56622 states and 93138 transitions. [2019-10-13 21:11:42,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:11:42,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-10-13 21:11:42,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:42,815 INFO L225 Difference]: With dead ends: 56622 [2019-10-13 21:11:42,816 INFO L226 Difference]: Without dead ends: 37801 [2019-10-13 21:11:42,883 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:42,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37801 states.