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_spec2_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:31:37,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:31:37,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:31:37,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:31:37,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:31:37,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:31:37,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:31:37,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:31:37,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:31:37,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:31:37,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:31:37,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:31:37,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:31:37,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:31:37,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:31:37,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:31:37,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:31:37,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:31:37,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:31:37,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:31:37,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:31:37,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:31:37,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:31:37,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:31:37,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:31:37,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:31:37,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:31:37,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:31:37,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:31:37,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:31:37,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:31:37,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:31:37,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:31:37,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:31:37,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:31:37,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:31:37,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:31:37,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:31:37,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:31:37,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:31:37,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:31:37,429 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-09-10 02:31:37,453 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:31:37,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:31:37,455 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:31:37,455 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:31:37,456 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:31:37,456 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:31:37,456 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:31:37,456 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:31:37,457 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:31:37,457 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:31:37,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:31:37,459 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:31:37,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:31:37,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:31:37,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:31:37,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:31:37,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:31:37,461 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:31:37,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:31:37,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:31:37,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:31:37,462 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:31:37,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:31:37,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:31:37,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:31:37,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:31:37,463 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:31:37,463 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:31:37,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:31:37,463 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:31:37,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:31:37,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:31:37,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:31:37,524 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:31:37,525 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:31:37,526 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product23.cil.c [2019-09-10 02:31:37,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b137ba6/2d8b4042d4ca43858a6dfdf4639723f5/FLAG317dd0467 [2019-09-10 02:31:38,215 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:31:38,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product23.cil.c [2019-09-10 02:31:38,234 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b137ba6/2d8b4042d4ca43858a6dfdf4639723f5/FLAG317dd0467 [2019-09-10 02:31:38,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b137ba6/2d8b4042d4ca43858a6dfdf4639723f5 [2019-09-10 02:31:38,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:31:38,456 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:31:38,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:38,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:31:38,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:31:38,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:38" (1/1) ... [2019-09-10 02:31:38,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@367d60c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:38, skipping insertion in model container [2019-09-10 02:31:38,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:31:38" (1/1) ... [2019-09-10 02:31:38,475 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:31:38,572 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:31:39,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:39,252 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:31:39,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:31:39,449 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:31:39,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:39 WrapperNode [2019-09-10 02:31:39,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:31:39,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:31:39,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:31:39,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:31:39,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:39" (1/1) ... [2019-09-10 02:31:39,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:39" (1/1) ... [2019-09-10 02:31:39,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:39" (1/1) ... [2019-09-10 02:31:39,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:39" (1/1) ... [2019-09-10 02:31:39,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:39" (1/1) ... [2019-09-10 02:31:39,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:39" (1/1) ... [2019-09-10 02:31:39,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:39" (1/1) ... [2019-09-10 02:31:39,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:31:39,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:31:39,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:31:39,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:31:39,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:39" (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-09-10 02:31:39,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:31:39,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:31:39,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:39,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:39,707 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:39,707 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:39,707 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:39,707 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:31:39,707 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:31:39,708 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:31:39,708 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:31:39,708 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:31:39,708 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:31:39,708 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:31:39,709 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:31:39,709 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:31:39,709 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:31:39,709 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:31:39,709 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:31:39,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:39,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:39,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:39,710 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:31:39,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:31:39,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:31:39,711 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:31:39,711 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:31:39,711 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:31:39,711 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:31:39,712 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:31:39,712 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:31:39,712 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:31:39,712 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:31:39,712 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:31:39,713 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:31:39,713 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:31:39,713 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:31:39,713 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:31:39,713 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:31:39,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:31:39,714 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:31:39,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:31:39,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:31:39,714 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:31:39,714 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:31:39,715 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:31:39,715 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:31:39,715 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:31:39,715 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:31:39,715 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:31:39,715 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:31:39,716 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:31:39,716 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:31:39,716 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:31:39,716 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:31:39,716 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:31:39,716 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:31:39,717 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:31:39,717 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:31:39,717 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:31:39,717 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:31:39,717 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:31:39,718 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:31:39,718 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:31:39,718 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:31:39,718 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-09-10 02:31:39,718 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-10 02:31:39,719 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:31:39,719 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:31:39,719 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:31:39,719 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-10 02:31:39,719 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-10 02:31:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:31:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:31:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:31:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:31:39,721 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:31:39,721 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-10 02:31:39,721 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-10 02:31:39,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:31:39,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:31:39,722 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:31:39,722 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:31:39,722 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:31:39,722 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:31:39,722 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:31:39,722 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:31:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:31:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:31:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:31:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:31:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:31:39,724 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:31:39,724 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:31:39,724 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:31:39,724 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:31:39,724 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:31:39,724 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:31:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:31:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:31:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:31:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:31:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:31:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:31:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:31:39,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:31:39,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:31:39,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:31:39,726 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:31:39,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:31:39,726 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:31:39,727 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:31:39,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:31:39,727 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:31:39,727 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:31:39,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:31:39,727 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:31:39,727 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:31:39,728 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:31:39,728 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:31:39,728 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:31:39,728 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:31:39,728 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:31:39,728 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:31:39,728 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:31:39,729 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:31:39,729 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:31:39,729 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:31:39,729 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:31:39,729 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:31:39,729 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:31:39,730 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:31:39,730 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:31:39,730 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:31:39,730 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:31:39,730 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:31:39,730 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:31:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:31:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:31:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:31:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:31:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:31:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:31:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:31:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:31:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:31:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:31:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:31:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:31:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:31:39,732 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:31:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:31:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-10 02:31:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-10 02:31:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:31:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:31:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:31:39,733 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:31:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:31:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:31:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:31:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-09-10 02:31:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-10 02:31:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:31:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:31:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-10 02:31:39,735 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-10 02:31:39,735 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:31:39,735 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:31:39,735 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:31:39,735 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:31:39,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:31:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:31:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:31:41,899 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:31:41,899 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:31:41,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:41 BoogieIcfgContainer [2019-09-10 02:31:41,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:31:41,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:31:41,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:31:41,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:31:41,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:31:38" (1/3) ... [2019-09-10 02:31:41,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f09e842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:41, skipping insertion in model container [2019-09-10 02:31:41,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:31:39" (2/3) ... [2019-09-10 02:31:41,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f09e842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:31:41, skipping insertion in model container [2019-09-10 02:31:41,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:31:41" (3/3) ... [2019-09-10 02:31:41,910 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product23.cil.c [2019-09-10 02:31:41,918 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:31:41,927 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:31:41,942 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:31:41,969 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:31:41,969 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:31:41,969 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:31:41,970 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:31:41,970 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:31:41,970 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:31:41,970 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:31:41,970 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:31:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states. [2019-09-10 02:31:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:31:42,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:42,036 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:42,038 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:42,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:42,044 INFO L82 PathProgramCache]: Analyzing trace with hash -425142213, now seen corresponding path program 1 times [2019-09-10 02:31:42,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:42,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:42,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:42,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:42,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:42,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:42,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:42,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:42,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:42,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:42,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:42,619 INFO L87 Difference]: Start difference. First operand 801 states. Second operand 4 states. [2019-09-10 02:31:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:42,794 INFO L93 Difference]: Finished difference Result 652 states and 1028 transitions. [2019-09-10 02:31:42,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:42,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-10 02:31:42,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:42,829 INFO L225 Difference]: With dead ends: 652 [2019-09-10 02:31:42,830 INFO L226 Difference]: Without dead ends: 641 [2019-09-10 02:31:42,831 INFO L628 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-09-10 02:31:42,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-10 02:31:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-09-10 02:31:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-10 02:31:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1016 transitions. [2019-09-10 02:31:42,981 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1016 transitions. Word has length 133 [2019-09-10 02:31:42,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:42,982 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 1016 transitions. [2019-09-10 02:31:42,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1016 transitions. [2019-09-10 02:31:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:31:42,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:42,993 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:42,994 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:42,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:42,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1746655412, now seen corresponding path program 1 times [2019-09-10 02:31:42,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:42,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:42,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:42,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:42,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:43,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:43,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:43,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:43,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:43,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:43,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:43,279 INFO L87 Difference]: Start difference. First operand 641 states and 1016 transitions. Second operand 4 states. [2019-09-10 02:31:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:43,373 INFO L93 Difference]: Finished difference Result 643 states and 1017 transitions. [2019-09-10 02:31:43,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:43,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-10 02:31:43,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:43,385 INFO L225 Difference]: With dead ends: 643 [2019-09-10 02:31:43,385 INFO L226 Difference]: Without dead ends: 641 [2019-09-10 02:31:43,386 INFO L628 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-09-10 02:31:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-10 02:31:43,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-09-10 02:31:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-10 02:31:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1015 transitions. [2019-09-10 02:31:43,462 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1015 transitions. Word has length 136 [2019-09-10 02:31:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:43,473 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 1015 transitions. [2019-09-10 02:31:43,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:43,473 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1015 transitions. [2019-09-10 02:31:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 02:31:43,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:43,488 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:43,488 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:43,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash -323937366, now seen corresponding path program 1 times [2019-09-10 02:31:43,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:43,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:43,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:43,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:43,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:43,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:43,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:43,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:43,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:43,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:43,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:43,685 INFO L87 Difference]: Start difference. First operand 641 states and 1015 transitions. Second operand 4 states. [2019-09-10 02:31:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:43,759 INFO L93 Difference]: Finished difference Result 643 states and 1016 transitions. [2019-09-10 02:31:43,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:43,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-10 02:31:43,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:43,766 INFO L225 Difference]: With dead ends: 643 [2019-09-10 02:31:43,767 INFO L226 Difference]: Without dead ends: 641 [2019-09-10 02:31:43,767 INFO L628 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-09-10 02:31:43,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-10 02:31:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-09-10 02:31:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-10 02:31:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1014 transitions. [2019-09-10 02:31:43,802 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1014 transitions. Word has length 137 [2019-09-10 02:31:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:43,803 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 1014 transitions. [2019-09-10 02:31:43,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1014 transitions. [2019-09-10 02:31:43,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 02:31:43,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:43,809 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:43,809 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:43,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1604183312, now seen corresponding path program 1 times [2019-09-10 02:31:43,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:43,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:43,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:43,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:43,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:44,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:44,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:44,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:44,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:44,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:44,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:44,097 INFO L87 Difference]: Start difference. First operand 641 states and 1014 transitions. Second operand 4 states. [2019-09-10 02:31:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:44,151 INFO L93 Difference]: Finished difference Result 643 states and 1015 transitions. [2019-09-10 02:31:44,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:44,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-10 02:31:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:44,158 INFO L225 Difference]: With dead ends: 643 [2019-09-10 02:31:44,158 INFO L226 Difference]: Without dead ends: 641 [2019-09-10 02:31:44,158 INFO L628 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-09-10 02:31:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-10 02:31:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-09-10 02:31:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-10 02:31:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1013 transitions. [2019-09-10 02:31:44,191 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1013 transitions. Word has length 138 [2019-09-10 02:31:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:44,193 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 1013 transitions. [2019-09-10 02:31:44,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1013 transitions. [2019-09-10 02:31:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 02:31:44,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:44,202 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:44,202 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:44,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:44,203 INFO L82 PathProgramCache]: Analyzing trace with hash 141486054, now seen corresponding path program 1 times [2019-09-10 02:31:44,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:44,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:44,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:44,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:44,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:44,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:44,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:44,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:44,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:44,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:44,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:44,345 INFO L87 Difference]: Start difference. First operand 641 states and 1013 transitions. Second operand 4 states. [2019-09-10 02:31:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:44,392 INFO L93 Difference]: Finished difference Result 643 states and 1014 transitions. [2019-09-10 02:31:44,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:44,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-10 02:31:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:44,398 INFO L225 Difference]: With dead ends: 643 [2019-09-10 02:31:44,399 INFO L226 Difference]: Without dead ends: 641 [2019-09-10 02:31:44,399 INFO L628 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-09-10 02:31:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-10 02:31:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-09-10 02:31:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-10 02:31:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1012 transitions. [2019-09-10 02:31:44,421 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1012 transitions. Word has length 139 [2019-09-10 02:31:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:44,422 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 1012 transitions. [2019-09-10 02:31:44,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1012 transitions. [2019-09-10 02:31:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 02:31:44,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:44,427 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:44,427 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:44,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:44,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1201249580, now seen corresponding path program 1 times [2019-09-10 02:31:44,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:44,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:44,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:44,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:44,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:44,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:44,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:31:44,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:44,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:31:44,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:31:44,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:31:44,625 INFO L87 Difference]: Start difference. First operand 641 states and 1012 transitions. Second operand 10 states. [2019-09-10 02:31:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:44,796 INFO L93 Difference]: Finished difference Result 650 states and 1023 transitions. [2019-09-10 02:31:44,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:31:44,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-10 02:31:44,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:44,806 INFO L225 Difference]: With dead ends: 650 [2019-09-10 02:31:44,806 INFO L226 Difference]: Without dead ends: 650 [2019-09-10 02:31:44,807 INFO L628 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-09-10 02:31:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-10 02:31:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2019-09-10 02:31:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-10 02:31:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1021 transitions. [2019-09-10 02:31:44,838 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1021 transitions. Word has length 140 [2019-09-10 02:31:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:44,840 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1021 transitions. [2019-09-10 02:31:44,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:31:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1021 transitions. [2019-09-10 02:31:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 02:31:44,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:44,847 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:44,847 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:44,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:44,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1895896587, now seen corresponding path program 1 times [2019-09-10 02:31:44,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:44,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:44,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:44,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:44,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:44,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:44,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:31:44,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:44,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:31:44,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:31:44,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:31:44,972 INFO L87 Difference]: Start difference. First operand 648 states and 1021 transitions. Second operand 4 states. [2019-09-10 02:31:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:45,052 INFO L93 Difference]: Finished difference Result 646 states and 1016 transitions. [2019-09-10 02:31:45,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:31:45,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-10 02:31:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:45,059 INFO L225 Difference]: With dead ends: 646 [2019-09-10 02:31:45,059 INFO L226 Difference]: Without dead ends: 635 [2019-09-10 02:31:45,059 INFO L628 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-09-10 02:31:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-10 02:31:45,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-09-10 02:31:45,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-09-10 02:31:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 998 transitions. [2019-09-10 02:31:45,083 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 998 transitions. Word has length 140 [2019-09-10 02:31:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:45,083 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 998 transitions. [2019-09-10 02:31:45,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:31:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 998 transitions. [2019-09-10 02:31:45,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 02:31:45,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:45,088 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:45,088 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:45,089 INFO L82 PathProgramCache]: Analyzing trace with hash 150537756, now seen corresponding path program 1 times [2019-09-10 02:31:45,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:45,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:45,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:45,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:45,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:45,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:45,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:45,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:45,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:45,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:45,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:45,223 INFO L87 Difference]: Start difference. First operand 635 states and 998 transitions. Second operand 6 states. [2019-09-10 02:31:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:45,430 INFO L93 Difference]: Finished difference Result 638 states and 1001 transitions. [2019-09-10 02:31:45,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:45,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-10 02:31:45,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:45,435 INFO L225 Difference]: With dead ends: 638 [2019-09-10 02:31:45,435 INFO L226 Difference]: Without dead ends: 635 [2019-09-10 02:31:45,436 INFO L628 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-09-10 02:31:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-10 02:31:45,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-09-10 02:31:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-09-10 02:31:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 994 transitions. [2019-09-10 02:31:45,456 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 994 transitions. Word has length 141 [2019-09-10 02:31:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:45,456 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 994 transitions. [2019-09-10 02:31:45,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:45,456 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 994 transitions. [2019-09-10 02:31:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 02:31:45,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:45,461 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:45,461 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:45,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1298093967, now seen corresponding path program 1 times [2019-09-10 02:31:45,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:45,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:45,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:45,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:45,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:45,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:45,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:45,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:45,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:45,585 INFO L87 Difference]: Start difference. First operand 635 states and 994 transitions. Second operand 6 states. [2019-09-10 02:31:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:45,770 INFO L93 Difference]: Finished difference Result 638 states and 997 transitions. [2019-09-10 02:31:45,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:45,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-10 02:31:45,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:45,775 INFO L225 Difference]: With dead ends: 638 [2019-09-10 02:31:45,776 INFO L226 Difference]: Without dead ends: 635 [2019-09-10 02:31:45,776 INFO L628 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-09-10 02:31:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-10 02:31:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-09-10 02:31:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-09-10 02:31:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 990 transitions. [2019-09-10 02:31:45,794 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 990 transitions. Word has length 142 [2019-09-10 02:31:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:45,795 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 990 transitions. [2019-09-10 02:31:45,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 990 transitions. [2019-09-10 02:31:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:31:45,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:45,799 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:45,800 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:45,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:45,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2074658687, now seen corresponding path program 1 times [2019-09-10 02:31:45,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:45,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:45,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:45,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:45,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:45,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:45,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:45,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:45,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:45,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:45,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:45,982 INFO L87 Difference]: Start difference. First operand 635 states and 990 transitions. Second operand 6 states. [2019-09-10 02:31:46,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:46,153 INFO L93 Difference]: Finished difference Result 638 states and 993 transitions. [2019-09-10 02:31:46,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:46,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-10 02:31:46,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:46,159 INFO L225 Difference]: With dead ends: 638 [2019-09-10 02:31:46,159 INFO L226 Difference]: Without dead ends: 635 [2019-09-10 02:31:46,160 INFO L628 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-09-10 02:31:46,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-10 02:31:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-09-10 02:31:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-09-10 02:31:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 986 transitions. [2019-09-10 02:31:46,179 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 986 transitions. Word has length 143 [2019-09-10 02:31:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:46,179 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 986 transitions. [2019-09-10 02:31:46,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 986 transitions. [2019-09-10 02:31:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 02:31:46,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:46,185 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:46,185 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:46,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1020185343, now seen corresponding path program 1 times [2019-09-10 02:31:46,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:46,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:46,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:46,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:46,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:46,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:46,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:31:46,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:46,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:31:46,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:31:46,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:31:46,368 INFO L87 Difference]: Start difference. First operand 635 states and 986 transitions. Second operand 7 states. [2019-09-10 02:31:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:46,474 INFO L93 Difference]: Finished difference Result 638 states and 989 transitions. [2019-09-10 02:31:46,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:31:46,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-10 02:31:46,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:46,480 INFO L225 Difference]: With dead ends: 638 [2019-09-10 02:31:46,480 INFO L226 Difference]: Without dead ends: 614 [2019-09-10 02:31:46,482 INFO L628 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-09-10 02:31:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-10 02:31:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-10 02:31:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-10 02:31:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 952 transitions. [2019-09-10 02:31:46,518 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 952 transitions. Word has length 143 [2019-09-10 02:31:46,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:46,520 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 952 transitions. [2019-09-10 02:31:46,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:31:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 952 transitions. [2019-09-10 02:31:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 02:31:46,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:46,528 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:46,528 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:46,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:46,529 INFO L82 PathProgramCache]: Analyzing trace with hash 451901908, now seen corresponding path program 1 times [2019-09-10 02:31:46,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:46,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:46,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:46,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:46,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:46,742 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:46,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:46,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:46,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:46,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:46,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:46,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:46,747 INFO L87 Difference]: Start difference. First operand 614 states and 952 transitions. Second operand 6 states. [2019-09-10 02:31:46,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:46,872 INFO L93 Difference]: Finished difference Result 617 states and 955 transitions. [2019-09-10 02:31:46,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:46,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-10 02:31:46,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:46,880 INFO L225 Difference]: With dead ends: 617 [2019-09-10 02:31:46,880 INFO L226 Difference]: Without dead ends: 614 [2019-09-10 02:31:46,881 INFO L628 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-09-10 02:31:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-10 02:31:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-10 02:31:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-10 02:31:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 951 transitions. [2019-09-10 02:31:46,913 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 951 transitions. Word has length 144 [2019-09-10 02:31:46,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:46,914 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 951 transitions. [2019-09-10 02:31:46,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 951 transitions. [2019-09-10 02:31:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 02:31:46,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:46,920 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:46,920 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:46,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:46,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1173579494, now seen corresponding path program 1 times [2019-09-10 02:31:46,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:46,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:46,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:46,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:46,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:47,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:47,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:31:47,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:47,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:31:47,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:31:47,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:31:47,067 INFO L87 Difference]: Start difference. First operand 614 states and 951 transitions. Second operand 6 states. [2019-09-10 02:31:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:47,163 INFO L93 Difference]: Finished difference Result 617 states and 954 transitions. [2019-09-10 02:31:47,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:31:47,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-10 02:31:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:47,169 INFO L225 Difference]: With dead ends: 617 [2019-09-10 02:31:47,169 INFO L226 Difference]: Without dead ends: 614 [2019-09-10 02:31:47,170 INFO L628 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-09-10 02:31:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-10 02:31:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-10 02:31:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-10 02:31:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 950 transitions. [2019-09-10 02:31:47,197 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 950 transitions. Word has length 145 [2019-09-10 02:31:47,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:47,199 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 950 transitions. [2019-09-10 02:31:47,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:31:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 950 transitions. [2019-09-10 02:31:47,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 02:31:47,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:47,204 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:47,204 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:47,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:47,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1778458649, now seen corresponding path program 1 times [2019-09-10 02:31:47,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:47,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:47,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:47,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:47,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:31:47,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:31:47,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:31:47,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:47,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:31:47,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:31:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:31:47,446 INFO L87 Difference]: Start difference. First operand 614 states and 950 transitions. Second operand 12 states. [2019-09-10 02:31:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:47,622 INFO L93 Difference]: Finished difference Result 618 states and 953 transitions. [2019-09-10 02:31:47,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:31:47,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-09-10 02:31:47,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:47,627 INFO L225 Difference]: With dead ends: 618 [2019-09-10 02:31:47,627 INFO L226 Difference]: Without dead ends: 614 [2019-09-10 02:31:47,628 INFO L628 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-09-10 02:31:47,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-10 02:31:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-10 02:31:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-10 02:31:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 949 transitions. [2019-09-10 02:31:47,646 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 949 transitions. Word has length 146 [2019-09-10 02:31:47,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:47,646 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 949 transitions. [2019-09-10 02:31:47,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:31:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 949 transitions. [2019-09-10 02:31:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 02:31:47,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:31:47,651 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:31:47,651 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:31:47,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:47,651 INFO L82 PathProgramCache]: Analyzing trace with hash -15461549, now seen corresponding path program 1 times [2019-09-10 02:31:47,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:31:47,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:47,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:31:47,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:31:47,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:31:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:31:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 02:31:47,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:31:47,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:31:47,848 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-09-10 02:31:47,850 INFO L207 CegarAbsIntRunner]: [67], [68], [152], [156], [159], [350], [352], [354], [405], [406], [408], [409], [428], [430], [433], [435], [439], [495], [565], [567], [586], [606], [626], [646], [666], [668], [697], [698], [699], [701], [798], [801], [806], [809], [828], [829], [831], [840], [842], [855], [868], [871], [907], [912], [945], [946], [1012], [1014], [1017], [1019], [1025], [1029], [1030], [1066], [1069], [1074], [1079], [1084], [1089], [1094], [1097], [1213], [1224], [1229], [1232], [1251], [1482], [1486], [1490], [1494], [1498], [1502], [1505], [1507], [1523], [1536], [1539], [1545], [1549], [1647], [1648], [1914], [2336], [2339], [2357], [2532], [2533], [2534], [2535], [2536], [2537], [2538], [2539], [2540], [2550], [2551], [2552], [2553], [2578], [2579], [2588], [2589], [2590], [2591], [2598], [2599], [2600], [2601], [2624], [2625], [2636], [2637], [2666], [2667], [2668], [2669], [2680], [2681], [2682], [2683], [2690], [2710], [2711], [2712], [2713], [2718], [2719], [2726], [2727], [2728], [2729], [2730], [2808], [2809], [2810] [2019-09-10 02:31:47,910 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:31:47,910 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:31:48,019 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:31:48,021 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 180 root evaluator evaluations with a maximum evaluation depth of 0. Performed 180 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 264 variables. [2019-09-10 02:31:48,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:31:48,025 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:31:48,084 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:31:48,084 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:31:48,088 INFO L420 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2019-09-10 02:31:48,089 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:31:48,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:31:48,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-09-10 02:31:48,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:31:48,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:31:48,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:31:48,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:31:48,091 INFO L87 Difference]: Start difference. First operand 614 states and 949 transitions. Second operand 2 states. [2019-09-10 02:31:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:31:48,091 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:31:48,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:31:48,092 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 147 [2019-09-10 02:31:48,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:31:48,092 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:31:48,092 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:31:48,093 INFO L628 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-09-10 02:31:48,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:31:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:31:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:31:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:31:48,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2019-09-10 02:31:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:31:48,094 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:31:48,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:31:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:31:48,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:31:48,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:31:48 BoogieIcfgContainer [2019-09-10 02:31:48,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:31:48,104 INFO L168 Benchmark]: Toolchain (without parser) took 9646.31 ms. Allocated memory was 137.9 MB in the beginning and 437.3 MB in the end (delta: 299.4 MB). Free memory was 82.2 MB in the beginning and 233.4 MB in the end (delta: -151.1 MB). Peak memory consumption was 148.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:48,106 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 104.0 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:31:48,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 991.13 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 82.0 MB in the beginning and 136.0 MB in the end (delta: -54.0 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:48,112 INFO L168 Benchmark]: Boogie Preprocessor took 186.13 ms. Allocated memory is still 200.3 MB. Free memory was 136.0 MB in the beginning and 126.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:48,113 INFO L168 Benchmark]: RCFGBuilder took 2264.43 ms. Allocated memory was 200.3 MB in the beginning and 273.7 MB in the end (delta: 73.4 MB). Free memory was 126.1 MB in the beginning and 155.3 MB in the end (delta: -29.2 MB). Peak memory consumption was 89.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:48,114 INFO L168 Benchmark]: TraceAbstraction took 6198.27 ms. Allocated memory was 273.7 MB in the beginning and 437.3 MB in the end (delta: 163.6 MB). Free memory was 155.3 MB in the beginning and 233.4 MB in the end (delta: -78.1 MB). Peak memory consumption was 85.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:31:48,123 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.21 ms. Allocated memory is still 137.9 MB. Free memory was 104.0 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 991.13 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 82.0 MB in the beginning and 136.0 MB in the end (delta: -54.0 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 186.13 ms. Allocated memory is still 200.3 MB. Free memory was 136.0 MB in the beginning and 126.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2264.43 ms. Allocated memory was 200.3 MB in the beginning and 273.7 MB in the end (delta: 73.4 MB). Free memory was 126.1 MB in the beginning and 155.3 MB in the end (delta: -29.2 MB). Peak memory consumption was 89.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6198.27 ms. Allocated memory was 273.7 MB in the beginning and 437.3 MB in the end (delta: 163.6 MB). Free memory was 155.3 MB in the beginning and 233.4 MB in the end (delta: -78.1 MB). Peak memory consumption was 85.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1660]: 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 80 procedures, 940 locations, 1 error locations. SAFE Result, 6.1s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13643 SDtfs, 441 SDslu, 52753 SDs, 0 SdLazy, 1264 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=801occurred 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.6643835616438356 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2114 NumberOfCodeBlocks, 2114 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2099 ConstructedInterpolants, 0 QuantifiedInterpolants, 368161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 265/270 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...