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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec14_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:39:15,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:39:15,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:39:15,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:39:15,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:39:15,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:39:15,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:39:15,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:39:15,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:39:15,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:39:15,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:39:15,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:39:15,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:39:15,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:39:15,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:39:15,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:39:15,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:39:15,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:39:15,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:39:15,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:39:15,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:39:15,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:39:15,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:39:15,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:39:15,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:39:15,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:39:15,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:39:15,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:39:15,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:39:15,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:39:15,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:39:15,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:39:15,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:39:15,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:39:15,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:39:15,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:39:15,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:39:15,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:39:15,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:39:15,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:39:15,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:39:15,573 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:39:15,588 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:39:15,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:39:15,589 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:39:15,589 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:39:15,590 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:39:15,590 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:39:15,590 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:39:15,590 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:39:15,591 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:39:15,591 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:39:15,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:39:15,592 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:39:15,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:39:15,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:39:15,592 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:39:15,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:39:15,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:39:15,593 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:39:15,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:39:15,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:39:15,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:39:15,594 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:39:15,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:39:15,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:39:15,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:39:15,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:39:15,595 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:39:15,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:39:15,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:39:15,595 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:39:15,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:39:15,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:39:15,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:39:15,640 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:39:15,640 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:39:15,641 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product03.cil.c [2019-10-03 02:39:15,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03448c3fa/b38b58647d6e45809b44fd4bc6bef1c1/FLAGfde95f41f [2019-10-03 02:39:16,371 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:39:16,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product03.cil.c [2019-10-03 02:39:16,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03448c3fa/b38b58647d6e45809b44fd4bc6bef1c1/FLAGfde95f41f [2019-10-03 02:39:16,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03448c3fa/b38b58647d6e45809b44fd4bc6bef1c1 [2019-10-03 02:39:16,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:39:16,618 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:39:16,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:39:16,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:39:16,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:39:16,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:39:16" (1/1) ... [2019-10-03 02:39:16,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b10c84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:16, skipping insertion in model container [2019-10-03 02:39:16,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:39:16" (1/1) ... [2019-10-03 02:39:16,634 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:39:16,720 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:39:17,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:39:17,474 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:39:17,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:39:17,692 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:39:17,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:17 WrapperNode [2019-10-03 02:39:17,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:39:17,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:39:17,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:39:17,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:39:17,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:17" (1/1) ... [2019-10-03 02:39:17,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:17" (1/1) ... [2019-10-03 02:39:17,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:17" (1/1) ... [2019-10-03 02:39:17,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:17" (1/1) ... [2019-10-03 02:39:17,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:17" (1/1) ... [2019-10-03 02:39:17,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:17" (1/1) ... [2019-10-03 02:39:17,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:17" (1/1) ... [2019-10-03 02:39:17,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:39:17,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:39:17,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:39:17,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:39:17,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:17" (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-03 02:39:18,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:39:18,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:39:18,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:39:18,002 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:39:18,002 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:39:18,003 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:39:18,003 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:39:18,003 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:39:18,003 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:39:18,003 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:39:18,004 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:39:18,004 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:39:18,005 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:39:18,006 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:39:18,006 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:39:18,007 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:39:18,007 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-03 02:39:18,008 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:39:18,008 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:39:18,008 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:39:18,008 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:39:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:39:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:39:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:39:18,009 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:39:18,011 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:39:18,011 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:39:18,011 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:39:18,011 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:39:18,012 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:39:18,012 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:39:18,012 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:39:18,012 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:39:18,012 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:39:18,012 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:39:18,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:39:18,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:39:18,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:39:18,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:39:18,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:39:18,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:39:18,014 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:39:18,014 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:39:18,015 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:39:18,015 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:39:18,015 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:39:18,015 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:39:18,015 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:39:18,015 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:39:18,015 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:39:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:39:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:39:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:39:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:39:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:39:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:39:18,017 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:39:18,017 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:39:18,017 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:39:18,018 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__base [2019-10-03 02:39:18,018 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:39:18,018 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:39:18,018 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:39:18,018 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-03 02:39:18,019 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:39:18,019 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:39:18,019 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:39:18,019 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:39:18,019 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:39:18,020 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:39:18,020 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:39:18,020 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:39:18,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:39:18,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:39:18,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:39:18,021 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:39:18,022 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:39:18,022 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:39:18,022 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:39:18,023 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:39:18,023 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:39:18,023 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:39:18,023 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:39:18,023 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:39:18,024 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:39:18,025 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:39:18,026 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:39:18,026 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:39:18,026 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:39:18,026 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:39:18,026 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:39:18,026 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:39:18,026 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:39:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:39:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:39:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:39:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:39:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:39:18,027 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-03 02:39:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:39:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:39:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:39:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:39:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:39:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:39:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:39:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:39:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:39:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:39:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:39:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:39:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:39:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:39:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:39:18,032 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:39:18,032 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:39:18,032 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:39:18,033 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:39:18,034 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:39:18,034 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:39:18,035 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:39:18,035 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:39:18,035 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:39:18,037 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:39:18,037 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:39:18,037 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:39:18,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:39:18,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:39:18,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:39:18,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:39:18,039 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:39:18,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:39:18,039 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:39:18,039 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:39:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:39:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:39:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:39:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:39:18,041 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:39:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:39:18,046 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:39:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:39:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:39:18,054 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:39:18,054 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:39:18,054 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:39:18,054 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:39:18,055 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:39:18,055 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:39:18,055 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:39:18,055 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__base [2019-10-03 02:39:18,055 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:39:18,055 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:39:18,056 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-03 02:39:18,056 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:39:18,056 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:39:18,056 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:39:18,057 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:39:18,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:39:18,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:39:18,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:39:20,604 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:39:20,605 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:39:20,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:20 BoogieIcfgContainer [2019-10-03 02:39:20,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:39:20,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:39:20,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:39:20,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:39:20,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:39:16" (1/3) ... [2019-10-03 02:39:20,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71aed57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:20, skipping insertion in model container [2019-10-03 02:39:20,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:17" (2/3) ... [2019-10-03 02:39:20,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71aed57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:20, skipping insertion in model container [2019-10-03 02:39:20,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:20" (3/3) ... [2019-10-03 02:39:20,617 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product03.cil.c [2019-10-03 02:39:20,626 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:39:20,638 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:39:20,654 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:39:20,678 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:39:20,679 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:39:20,679 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:39:20,679 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:39:20,679 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:39:20,679 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:39:20,679 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:39:20,679 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:39:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states. [2019-10-03 02:39:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 02:39:20,740 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:20,741 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:20,744 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:20,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:20,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2136153508, now seen corresponding path program 1 times [2019-10-03 02:39:20,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:20,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:20,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:20,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:20,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:21,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:21,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:21,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:21,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:21,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:21,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:21,380 INFO L87 Difference]: Start difference. First operand 714 states. Second operand 4 states. [2019-10-03 02:39:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:21,571 INFO L93 Difference]: Finished difference Result 577 states and 914 transitions. [2019-10-03 02:39:21,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:39:21,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-03 02:39:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:21,597 INFO L225 Difference]: With dead ends: 577 [2019-10-03 02:39:21,597 INFO L226 Difference]: Without dead ends: 566 [2019-10-03 02:39:21,599 INFO L640 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-03 02:39:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-03 02:39:21,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-03 02:39:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-03 02:39:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 900 transitions. [2019-10-03 02:39:21,732 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 900 transitions. Word has length 135 [2019-10-03 02:39:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:21,732 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 900 transitions. [2019-10-03 02:39:21,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 900 transitions. [2019-10-03 02:39:21,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-03 02:39:21,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:21,749 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:21,749 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:21,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:21,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1459337121, now seen corresponding path program 1 times [2019-10-03 02:39:21,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:21,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:21,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:21,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:22,030 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:22,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:22,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:22,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:22,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:22,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:22,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:22,035 INFO L87 Difference]: Start difference. First operand 566 states and 900 transitions. Second operand 4 states. [2019-10-03 02:39:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:22,117 INFO L93 Difference]: Finished difference Result 568 states and 901 transitions. [2019-10-03 02:39:22,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:22,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-03 02:39:22,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:22,124 INFO L225 Difference]: With dead ends: 568 [2019-10-03 02:39:22,125 INFO L226 Difference]: Without dead ends: 566 [2019-10-03 02:39:22,126 INFO L640 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-03 02:39:22,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-03 02:39:22,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-03 02:39:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-03 02:39:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 899 transitions. [2019-10-03 02:39:22,174 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 899 transitions. Word has length 136 [2019-10-03 02:39:22,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:22,175 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 899 transitions. [2019-10-03 02:39:22,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 899 transitions. [2019-10-03 02:39:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-03 02:39:22,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:22,184 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:22,184 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:22,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:22,185 INFO L82 PathProgramCache]: Analyzing trace with hash -901760384, now seen corresponding path program 1 times [2019-10-03 02:39:22,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:22,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:22,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:22,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:22,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:22,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:22,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:22,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:22,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:22,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:22,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:22,305 INFO L87 Difference]: Start difference. First operand 566 states and 899 transitions. Second operand 4 states. [2019-10-03 02:39:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:22,364 INFO L93 Difference]: Finished difference Result 568 states and 900 transitions. [2019-10-03 02:39:22,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:22,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-03 02:39:22,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:22,370 INFO L225 Difference]: With dead ends: 568 [2019-10-03 02:39:22,370 INFO L226 Difference]: Without dead ends: 566 [2019-10-03 02:39:22,370 INFO L640 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-03 02:39:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-03 02:39:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-03 02:39:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-03 02:39:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 898 transitions. [2019-10-03 02:39:22,394 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 898 transitions. Word has length 137 [2019-10-03 02:39:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:22,394 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 898 transitions. [2019-10-03 02:39:22,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 898 transitions. [2019-10-03 02:39:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 02:39:22,399 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:22,399 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:22,400 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:22,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:22,400 INFO L82 PathProgramCache]: Analyzing trace with hash -448114181, now seen corresponding path program 1 times [2019-10-03 02:39:22,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:22,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:22,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:22,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:22,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:22,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:22,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:22,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:22,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:22,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:22,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:22,555 INFO L87 Difference]: Start difference. First operand 566 states and 898 transitions. Second operand 4 states. [2019-10-03 02:39:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:22,614 INFO L93 Difference]: Finished difference Result 568 states and 899 transitions. [2019-10-03 02:39:22,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:22,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-03 02:39:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:22,619 INFO L225 Difference]: With dead ends: 568 [2019-10-03 02:39:22,620 INFO L226 Difference]: Without dead ends: 566 [2019-10-03 02:39:22,620 INFO L640 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-03 02:39:22,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-03 02:39:22,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-03 02:39:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-03 02:39:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 897 transitions. [2019-10-03 02:39:22,643 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 897 transitions. Word has length 138 [2019-10-03 02:39:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:22,643 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 897 transitions. [2019-10-03 02:39:22,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 897 transitions. [2019-10-03 02:39:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 02:39:22,647 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:22,647 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:22,648 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:22,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:22,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1078652764, now seen corresponding path program 1 times [2019-10-03 02:39:22,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:22,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:22,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:22,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:22,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:22,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:22,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:22,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:22,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:22,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:22,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:22,761 INFO L87 Difference]: Start difference. First operand 566 states and 897 transitions. Second operand 4 states. [2019-10-03 02:39:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:22,821 INFO L93 Difference]: Finished difference Result 568 states and 898 transitions. [2019-10-03 02:39:22,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:22,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-03 02:39:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:22,826 INFO L225 Difference]: With dead ends: 568 [2019-10-03 02:39:22,827 INFO L226 Difference]: Without dead ends: 566 [2019-10-03 02:39:22,827 INFO L640 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-03 02:39:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-03 02:39:22,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2019-10-03 02:39:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-03 02:39:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 896 transitions. [2019-10-03 02:39:22,852 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 896 transitions. Word has length 139 [2019-10-03 02:39:22,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:22,852 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 896 transitions. [2019-10-03 02:39:22,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 896 transitions. [2019-10-03 02:39:22,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:39:22,856 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:22,856 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:22,857 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:22,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:22,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1512424343, now seen corresponding path program 1 times [2019-10-03 02:39:22,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:22,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:22,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:22,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:22,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:23,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:23,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:39:23,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:23,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:39:23,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:39:23,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:39:23,017 INFO L87 Difference]: Start difference. First operand 566 states and 896 transitions. Second operand 10 states. [2019-10-03 02:39:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:23,223 INFO L93 Difference]: Finished difference Result 575 states and 908 transitions. [2019-10-03 02:39:23,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:39:23,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-03 02:39:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:23,230 INFO L225 Difference]: With dead ends: 575 [2019-10-03 02:39:23,230 INFO L226 Difference]: Without dead ends: 575 [2019-10-03 02:39:23,232 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:39:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-10-03 02:39:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 573. [2019-10-03 02:39:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-10-03 02:39:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 906 transitions. [2019-10-03 02:39:23,283 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 906 transitions. Word has length 140 [2019-10-03 02:39:23,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:23,283 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 906 transitions. [2019-10-03 02:39:23,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:39:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 906 transitions. [2019-10-03 02:39:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:39:23,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:23,289 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:23,289 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:23,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:23,290 INFO L82 PathProgramCache]: Analyzing trace with hash 525841654, now seen corresponding path program 1 times [2019-10-03 02:39:23,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:23,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:23,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:23,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:23,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:23,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:23,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:23,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:23,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:23,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:23,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:23,466 INFO L87 Difference]: Start difference. First operand 573 states and 906 transitions. Second operand 4 states. [2019-10-03 02:39:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:23,521 INFO L93 Difference]: Finished difference Result 571 states and 901 transitions. [2019-10-03 02:39:23,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:39:23,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-03 02:39:23,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:23,527 INFO L225 Difference]: With dead ends: 571 [2019-10-03 02:39:23,528 INFO L226 Difference]: Without dead ends: 569 [2019-10-03 02:39:23,528 INFO L640 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-03 02:39:23,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-03 02:39:23,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-03 02:39:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-03 02:39:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 899 transitions. [2019-10-03 02:39:23,552 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 899 transitions. Word has length 140 [2019-10-03 02:39:23,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:23,552 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 899 transitions. [2019-10-03 02:39:23,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 899 transitions. [2019-10-03 02:39:23,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 02:39:23,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:23,557 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:23,557 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:23,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:23,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1915884638, now seen corresponding path program 1 times [2019-10-03 02:39:23,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:23,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:23,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:23,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:23,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:23,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:23,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:23,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:23,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:23,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:23,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:23,786 INFO L87 Difference]: Start difference. First operand 569 states and 899 transitions. Second operand 6 states. [2019-10-03 02:39:24,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:24,183 INFO L93 Difference]: Finished difference Result 586 states and 920 transitions. [2019-10-03 02:39:24,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:39:24,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-03 02:39:24,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:24,191 INFO L225 Difference]: With dead ends: 586 [2019-10-03 02:39:24,191 INFO L226 Difference]: Without dead ends: 577 [2019-10-03 02:39:24,192 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-03 02:39:24,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 574. [2019-10-03 02:39:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-03 02:39:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 900 transitions. [2019-10-03 02:39:24,217 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 900 transitions. Word has length 141 [2019-10-03 02:39:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:24,218 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 900 transitions. [2019-10-03 02:39:24,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 900 transitions. [2019-10-03 02:39:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 02:39:24,222 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:24,222 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:24,222 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:24,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash 625839962, now seen corresponding path program 1 times [2019-10-03 02:39:24,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:24,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:24,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:24,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:24,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:24,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:24,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:24,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:24,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:24,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:24,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:24,439 INFO L87 Difference]: Start difference. First operand 574 states and 900 transitions. Second operand 6 states. [2019-10-03 02:39:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:24,709 INFO L93 Difference]: Finished difference Result 577 states and 903 transitions. [2019-10-03 02:39:24,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:24,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-03 02:39:24,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:24,717 INFO L225 Difference]: With dead ends: 577 [2019-10-03 02:39:24,718 INFO L226 Difference]: Without dead ends: 574 [2019-10-03 02:39:24,719 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:24,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-03 02:39:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-03 02:39:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-03 02:39:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 896 transitions. [2019-10-03 02:39:24,743 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 896 transitions. Word has length 142 [2019-10-03 02:39:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:24,744 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 896 transitions. [2019-10-03 02:39:24,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 896 transitions. [2019-10-03 02:39:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:39:24,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:24,749 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:24,749 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:24,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:24,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1831211677, now seen corresponding path program 1 times [2019-10-03 02:39:24,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:24,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:24,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:24,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:24,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:24,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:24,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:24,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:24,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:24,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:24,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:24,931 INFO L87 Difference]: Start difference. First operand 574 states and 896 transitions. Second operand 6 states. [2019-10-03 02:39:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:25,231 INFO L93 Difference]: Finished difference Result 577 states and 899 transitions. [2019-10-03 02:39:25,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:25,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-03 02:39:25,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:25,240 INFO L225 Difference]: With dead ends: 577 [2019-10-03 02:39:25,240 INFO L226 Difference]: Without dead ends: 574 [2019-10-03 02:39:25,240 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-03 02:39:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-03 02:39:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-03 02:39:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 892 transitions. [2019-10-03 02:39:25,266 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 892 transitions. Word has length 143 [2019-10-03 02:39:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:25,266 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 892 transitions. [2019-10-03 02:39:25,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 892 transitions. [2019-10-03 02:39:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:39:25,273 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:25,273 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:25,274 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:25,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:25,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1553880605, now seen corresponding path program 1 times [2019-10-03 02:39:25,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:25,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:25,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:25,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:25,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:25,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:25,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:39:25,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:25,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:39:25,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:39:25,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:39:25,440 INFO L87 Difference]: Start difference. First operand 574 states and 892 transitions. Second operand 7 states. [2019-10-03 02:39:25,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:25,541 INFO L93 Difference]: Finished difference Result 580 states and 899 transitions. [2019-10-03 02:39:25,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:39:25,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-03 02:39:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:25,546 INFO L225 Difference]: With dead ends: 580 [2019-10-03 02:39:25,546 INFO L226 Difference]: Without dead ends: 556 [2019-10-03 02:39:25,548 INFO L640 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-03 02:39:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-10-03 02:39:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 553. [2019-10-03 02:39:25,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-03 02:39:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 855 transitions. [2019-10-03 02:39:25,567 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 855 transitions. Word has length 143 [2019-10-03 02:39:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:25,568 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 855 transitions. [2019-10-03 02:39:25,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:39:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 855 transitions. [2019-10-03 02:39:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-03 02:39:25,573 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:25,573 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:25,573 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:25,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:25,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1810773505, now seen corresponding path program 1 times [2019-10-03 02:39:25,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:25,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:25,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:25,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:25,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:25,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:25,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:25,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:25,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:25,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:25,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:25,825 INFO L87 Difference]: Start difference. First operand 553 states and 855 transitions. Second operand 6 states. [2019-10-03 02:39:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:25,985 INFO L93 Difference]: Finished difference Result 556 states and 858 transitions. [2019-10-03 02:39:25,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:25,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-03 02:39:25,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:25,990 INFO L225 Difference]: With dead ends: 556 [2019-10-03 02:39:25,990 INFO L226 Difference]: Without dead ends: 553 [2019-10-03 02:39:25,991 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:25,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-03 02:39:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-03 02:39:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-03 02:39:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 854 transitions. [2019-10-03 02:39:26,017 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 854 transitions. Word has length 144 [2019-10-03 02:39:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:26,017 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 854 transitions. [2019-10-03 02:39:26,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 854 transitions. [2019-10-03 02:39:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 02:39:26,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:26,023 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:26,023 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:26,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:26,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1997404776, now seen corresponding path program 1 times [2019-10-03 02:39:26,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:26,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:26,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:26,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:26,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:26,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:26,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:26,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:26,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:26,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:26,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:26,150 INFO L87 Difference]: Start difference. First operand 553 states and 854 transitions. Second operand 6 states. [2019-10-03 02:39:26,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:26,270 INFO L93 Difference]: Finished difference Result 556 states and 857 transitions. [2019-10-03 02:39:26,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:26,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-03 02:39:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:26,275 INFO L225 Difference]: With dead ends: 556 [2019-10-03 02:39:26,275 INFO L226 Difference]: Without dead ends: 553 [2019-10-03 02:39:26,275 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:39:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-03 02:39:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-03 02:39:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-03 02:39:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 853 transitions. [2019-10-03 02:39:26,294 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 853 transitions. Word has length 145 [2019-10-03 02:39:26,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:26,294 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 853 transitions. [2019-10-03 02:39:26,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:26,294 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 853 transitions. [2019-10-03 02:39:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-03 02:39:26,298 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:26,299 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:26,299 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:26,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:26,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1659299750, now seen corresponding path program 1 times [2019-10-03 02:39:26,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:26,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:26,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:26,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:26,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:26,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:26,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:26,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:26,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:26,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:26,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:26,416 INFO L87 Difference]: Start difference. First operand 553 states and 853 transitions. Second operand 4 states. [2019-10-03 02:39:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:26,474 INFO L93 Difference]: Finished difference Result 556 states and 856 transitions. [2019-10-03 02:39:26,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:39:26,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-10-03 02:39:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:26,479 INFO L225 Difference]: With dead ends: 556 [2019-10-03 02:39:26,479 INFO L226 Difference]: Without dead ends: 553 [2019-10-03 02:39:26,480 INFO L640 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-03 02:39:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-03 02:39:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-03 02:39:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-03 02:39:26,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 852 transitions. [2019-10-03 02:39:26,497 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 852 transitions. Word has length 146 [2019-10-03 02:39:26,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:26,498 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 852 transitions. [2019-10-03 02:39:26,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:26,498 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 852 transitions. [2019-10-03 02:39:26,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-03 02:39:26,502 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:26,502 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:26,503 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:26,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:26,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1328525148, now seen corresponding path program 1 times [2019-10-03 02:39:26,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:26,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:26,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:26,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:26,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:26,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:26,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:39:26,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:26,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:39:26,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:39:26,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:39:26,676 INFO L87 Difference]: Start difference. First operand 553 states and 852 transitions. Second operand 12 states. [2019-10-03 02:39:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:26,972 INFO L93 Difference]: Finished difference Result 562 states and 862 transitions. [2019-10-03 02:39:26,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:39:26,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-03 02:39:26,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:26,977 INFO L225 Difference]: With dead ends: 562 [2019-10-03 02:39:26,977 INFO L226 Difference]: Without dead ends: 560 [2019-10-03 02:39:26,979 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:39:26,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-03 02:39:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 558. [2019-10-03 02:39:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-10-03 02:39:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 858 transitions. [2019-10-03 02:39:27,002 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 858 transitions. Word has length 146 [2019-10-03 02:39:27,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:27,003 INFO L475 AbstractCegarLoop]: Abstraction has 558 states and 858 transitions. [2019-10-03 02:39:27,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:39:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 858 transitions. [2019-10-03 02:39:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 02:39:27,007 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:27,007 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:39:27,007 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:27,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:27,008 INFO L82 PathProgramCache]: Analyzing trace with hash -685285033, now seen corresponding path program 1 times [2019-10-03 02:39:27,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:27,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:27,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:27,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:27,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 02:39:27,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:27,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:39:27,242 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-10-03 02:39:27,244 INFO L207 CegarAbsIntRunner]: [60], [61], [140], [144], [147], [338], [340], [342], [407], [408], [410], [411], [412], [414], [417], [419], [423], [848], [850], [947], [950], [955], [958], [1022], [1023], [1024], [1029], [1062], [1063], [1129], [1131], [1134], [1136], [1142], [1146], [1147], [1183], [1186], [1191], [1196], [1201], [1206], [1211], [1214], [1330], [1335], [1336], [1383], [1388], [1391], [1410], [1597], [1601], [1605], [1609], [1613], [1617], [1620], [1622], [1638], [1651], [1654], [1660], [1664], [1665], [1667], [1670], [1672], [1674], [1679], [1681], [1684], [1804], [1805], [2186], [2190], [2193], [2211], [2347], [2348], [2349], [2350], [2351], [2352], [2353], [2354], [2355], [2365], [2366], [2367], [2368], [2385], [2386], [2387], [2388], [2389], [2390], [2397], [2398], [2399], [2449], [2450], [2479], [2480], [2481], [2482], [2493], [2513], [2514], [2515], [2516], [2521], [2522], [2523], [2549], [2555], [2556], [2557], [2558], [2559], [2560], [2561], [2562], [2563], [2593], [2594], [2595] [2019-10-03 02:39:27,307 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:39:27,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:39:27,426 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:39:27,428 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 167 root evaluator evaluations with a maximum evaluation depth of 0. Performed 167 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 250 variables. [2019-10-03 02:39:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:27,431 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:39:27,489 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:39:27,489 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:39:27,494 INFO L420 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2019-10-03 02:39:27,494 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:39:27,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:39:27,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 10 [2019-10-03 02:39:27,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:27,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:39:27,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:39:27,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:39:27,499 INFO L87 Difference]: Start difference. First operand 558 states and 858 transitions. Second operand 2 states. [2019-10-03 02:39:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:27,499 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:39:27,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:39:27,500 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 147 [2019-10-03 02:39:27,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:27,500 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:39:27,500 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:39:27,500 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:39:27,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:39:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:39:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:39:27,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:39:27,501 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2019-10-03 02:39:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:27,502 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:39:27,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:39:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:39:27,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:39:27,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:39:27 BoogieIcfgContainer [2019-10-03 02:39:27,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:39:27,512 INFO L168 Benchmark]: Toolchain (without parser) took 10891.94 ms. Allocated memory was 139.5 MB in the beginning and 487.6 MB in the end (delta: 348.1 MB). Free memory was 83.3 MB in the beginning and 330.1 MB in the end (delta: -246.8 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:27,514 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 104.3 MB in the beginning and 104.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:39:27,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1074.58 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 83.1 MB in the beginning and 140.6 MB in the end (delta: -57.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:27,520 INFO L168 Benchmark]: Boogie Preprocessor took 217.50 ms. Allocated memory is still 200.3 MB. Free memory was 140.6 MB in the beginning and 131.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:27,521 INFO L168 Benchmark]: RCFGBuilder took 2695.10 ms. Allocated memory was 200.3 MB in the beginning and 265.3 MB in the end (delta: 65.0 MB). Free memory was 131.4 MB in the beginning and 158.0 MB in the end (delta: -26.5 MB). Peak memory consumption was 94.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:27,522 INFO L168 Benchmark]: TraceAbstraction took 6900.47 ms. Allocated memory was 265.3 MB in the beginning and 487.6 MB in the end (delta: 222.3 MB). Free memory was 158.0 MB in the beginning and 330.1 MB in the end (delta: -172.1 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:27,534 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 104.3 MB in the beginning and 104.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1074.58 ms. Allocated memory was 139.5 MB in the beginning and 200.3 MB in the end (delta: 60.8 MB). Free memory was 83.1 MB in the beginning and 140.6 MB in the end (delta: -57.5 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 217.50 ms. Allocated memory is still 200.3 MB. Free memory was 140.6 MB in the beginning and 131.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2695.10 ms. Allocated memory was 200.3 MB in the beginning and 265.3 MB in the end (delta: 65.0 MB). Free memory was 131.4 MB in the beginning and 158.0 MB in the end (delta: -26.5 MB). Peak memory consumption was 94.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6900.47 ms. Allocated memory was 265.3 MB in the beginning and 487.6 MB in the end (delta: 222.3 MB). Free memory was 158.0 MB in the beginning and 330.1 MB in the end (delta: -172.1 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3239]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 73 procedures, 866 locations, 1 error locations. SAFE Result, 6.8s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12836 SDtfs, 569 SDslu, 47876 SDs, 0 SdLazy, 1709 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=714occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.6575342465753424 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2262 NumberOfCodeBlocks, 2262 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2246 ConstructedInterpolants, 0 QuantifiedInterpolants, 384887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 566/576 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...