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_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:44:14,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:44:14,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:44:14,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:44:14,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:44:14,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:44:14,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:44:14,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:44:14,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:44:14,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:44:14,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:44:14,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:44:14,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:44:14,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:44:14,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:44:14,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:44:14,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:44:14,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:44:14,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:44:14,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:44:14,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:44:14,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:44:14,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:44:14,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:44:14,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:44:14,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:44:14,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:44:14,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:44:14,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:44:14,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:44:14,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:44:14,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:44:14,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:44:14,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:44:14,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:44:14,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:44:14,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:44:14,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:44:14,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:44:14,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:44:14,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:44:14,470 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:44:14,485 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:44:14,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:44:14,486 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:44:14,486 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:44:14,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:44:14,487 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:44:14,487 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:44:14,487 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:44:14,488 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:44:14,488 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:44:14,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:44:14,489 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:44:14,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:44:14,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:44:14,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:44:14,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:44:14,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:44:14,490 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:44:14,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:44:14,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:44:14,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:44:14,491 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:44:14,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:44:14,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:44:14,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:44:14,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:44:14,492 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:44:14,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:44:14,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:44:14,493 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:44:14,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:44:14,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:44:14,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:44:14,539 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:44:14,539 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:44:14,540 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product31.cil.c [2019-10-03 02:44:14,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/771dc45a2/e6c8b301c76c4f7f9e51d7ccd2e27fea/FLAGd8d943504 [2019-10-03 02:44:15,293 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:44:15,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product31.cil.c [2019-10-03 02:44:15,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/771dc45a2/e6c8b301c76c4f7f9e51d7ccd2e27fea/FLAGd8d943504 [2019-10-03 02:44:15,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/771dc45a2/e6c8b301c76c4f7f9e51d7ccd2e27fea [2019-10-03 02:44:15,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:44:15,451 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:44:15,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:44:15,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:44:15,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:44:15,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:44:15" (1/1) ... [2019-10-03 02:44:15,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a632ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:15, skipping insertion in model container [2019-10-03 02:44:15,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:44:15" (1/1) ... [2019-10-03 02:44:15,469 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:44:15,564 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:44:16,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:44:16,359 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:44:16,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:44:16,591 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:44:16,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:16 WrapperNode [2019-10-03 02:44:16,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:44:16,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:44:16,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:44:16,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:44:16,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:16" (1/1) ... [2019-10-03 02:44:16,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:16" (1/1) ... [2019-10-03 02:44:16,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:16" (1/1) ... [2019-10-03 02:44:16,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:16" (1/1) ... [2019-10-03 02:44:16,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:16" (1/1) ... [2019-10-03 02:44:16,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:16" (1/1) ... [2019-10-03 02:44:16,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:16" (1/1) ... [2019-10-03 02:44:16,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:44:16,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:44:16,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:44:16,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:44:16,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:44:16,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:44:16,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:44:16,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:44:16,922 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:44:16,922 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:44:16,922 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:44:16,922 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:44:16,923 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:44:16,924 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:44:16,924 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:44:16,924 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:44:16,925 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:44:16,925 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:44:16,926 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:44:16,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:44:16,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:44:16,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:44:16,928 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:44:16,928 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:44:16,928 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:44:16,928 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:44:16,928 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:44:16,929 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:44:16,929 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:44:16,929 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:44:16,930 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:44:16,930 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:44:16,930 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:44:16,930 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:44:16,931 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:44:16,931 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:44:16,931 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:44:16,931 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:44:16,931 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:44:16,931 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:44:16,931 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:44:16,932 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:44:16,932 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:44:16,932 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:44:16,932 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:44:16,932 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:44:16,932 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:44:16,932 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:44:16,933 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-03 02:44:16,933 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:44:16,933 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:44:16,933 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:44:16,934 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:44:16,934 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:44:16,934 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:44:16,934 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:44:16,934 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:44:16,934 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:44:16,934 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:44:16,934 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:44:16,935 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-03 02:44:16,935 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:44:16,935 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:44:16,935 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:44:16,935 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:44:16,935 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-03 02:44:16,935 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:44:16,936 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:44:16,936 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:44:16,936 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:44:16,937 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:44:16,937 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:44:16,937 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:44:16,937 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:44:16,937 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:44:16,937 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:44:16,938 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:44:16,938 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:44:16,939 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:44:16,939 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:44:16,939 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:44:16,939 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:44:16,939 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:44:16,939 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:44:16,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:44:16,940 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:44:16,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:44:16,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:44:16,941 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:44:16,941 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:44:16,942 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:44:16,942 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:44:16,943 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:44:16,943 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:44:16,943 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:44:16,943 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:44:16,944 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:44:16,944 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:44:16,944 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:44:16,944 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:44:16,944 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:44:16,944 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:44:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:44:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:44:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:44:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:44:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:44:16,946 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:44:16,946 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:44:16,946 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:44:16,946 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:44:16,946 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:44:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:44:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:44:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:44:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:44:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:44:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:44:16,948 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:44:16,948 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:44:16,948 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:44:16,948 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:44:16,949 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:44:16,950 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:44:16,950 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:44:16,950 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:44:16,950 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:44:16,951 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:44:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:44:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:44:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:44:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:44:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:44:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:44:16,953 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:44:16,953 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:44:16,953 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:44:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:44:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:44:16,955 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:44:16,955 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:44:16,955 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:44:16,955 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:44:16,956 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:44:16,959 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:44:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-03 02:44:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:44:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:44:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:44:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:44:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:44:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:44:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-03 02:44:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:44:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:44:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:44:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-03 02:44:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:44:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:44:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:44:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:44:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:44:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:44:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:44:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:44:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:44:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:44:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:44:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:44:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:44:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:44:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:44:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:44:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:44:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:44:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:44:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:44:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:44:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:44:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:44:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:44:16,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:44:19,800 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:44:19,801 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:44:19,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:44:19 BoogieIcfgContainer [2019-10-03 02:44:19,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:44:19,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:44:19,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:44:19,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:44:19,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:44:15" (1/3) ... [2019-10-03 02:44:19,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e43d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:44:19, skipping insertion in model container [2019-10-03 02:44:19,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:44:16" (2/3) ... [2019-10-03 02:44:19,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e43d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:44:19, skipping insertion in model container [2019-10-03 02:44:19,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:44:19" (3/3) ... [2019-10-03 02:44:19,812 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product31.cil.c [2019-10-03 02:44:19,823 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:44:19,839 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:44:19,859 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:44:19,899 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:44:19,899 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:44:19,899 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:44:19,900 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:44:19,900 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:44:19,900 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:44:19,900 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:44:19,900 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:44:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states. [2019-10-03 02:44:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-03 02:44:19,998 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:20,000 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:20,003 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:20,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash 841338012, now seen corresponding path program 1 times [2019-10-03 02:44:20,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:20,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:20,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:20,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:20,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:44:20,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:20,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:20,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:20,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:20,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:20,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:20,776 INFO L87 Difference]: Start difference. First operand 817 states. Second operand 4 states. [2019-10-03 02:44:20,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:20,961 INFO L93 Difference]: Finished difference Result 668 states and 1051 transitions. [2019-10-03 02:44:20,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:20,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-03 02:44:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:21,002 INFO L225 Difference]: With dead ends: 668 [2019-10-03 02:44:21,003 INFO L226 Difference]: Without dead ends: 657 [2019-10-03 02:44:21,006 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:44:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-03 02:44:21,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-03 02:44:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-03 02:44:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1039 transitions. [2019-10-03 02:44:21,110 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1039 transitions. Word has length 133 [2019-10-03 02:44:21,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:21,111 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1039 transitions. [2019-10-03 02:44:21,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1039 transitions. [2019-10-03 02:44:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-03 02:44:21,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:21,126 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:21,126 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:21,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:21,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1822294424, now seen corresponding path program 1 times [2019-10-03 02:44:21,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:21,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:21,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:21,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:21,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:21,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:44:21,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:21,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:21,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:21,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:21,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:21,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:21,391 INFO L87 Difference]: Start difference. First operand 657 states and 1039 transitions. Second operand 4 states. [2019-10-03 02:44:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:21,458 INFO L93 Difference]: Finished difference Result 659 states and 1040 transitions. [2019-10-03 02:44:21,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:21,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-03 02:44:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:21,465 INFO L225 Difference]: With dead ends: 659 [2019-10-03 02:44:21,465 INFO L226 Difference]: Without dead ends: 657 [2019-10-03 02:44:21,466 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:44:21,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-03 02:44:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-03 02:44:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-03 02:44:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1038 transitions. [2019-10-03 02:44:21,516 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1038 transitions. Word has length 136 [2019-10-03 02:44:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:21,518 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1038 transitions. [2019-10-03 02:44:21,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1038 transitions. [2019-10-03 02:44:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-03 02:44:21,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:21,528 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:21,528 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:21,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:21,529 INFO L82 PathProgramCache]: Analyzing trace with hash -122460853, now seen corresponding path program 1 times [2019-10-03 02:44:21,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:21,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:21,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:21,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:21,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:44:21,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:21,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:21,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:21,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:21,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:21,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:21,853 INFO L87 Difference]: Start difference. First operand 657 states and 1038 transitions. Second operand 4 states. [2019-10-03 02:44:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:21,925 INFO L93 Difference]: Finished difference Result 659 states and 1039 transitions. [2019-10-03 02:44:21,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:21,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-03 02:44:21,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:21,935 INFO L225 Difference]: With dead ends: 659 [2019-10-03 02:44:21,936 INFO L226 Difference]: Without dead ends: 657 [2019-10-03 02:44:21,936 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:44:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-03 02:44:21,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-03 02:44:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-03 02:44:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1037 transitions. [2019-10-03 02:44:21,973 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1037 transitions. Word has length 137 [2019-10-03 02:44:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:21,974 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1037 transitions. [2019-10-03 02:44:21,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1037 transitions. [2019-10-03 02:44:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 02:44:21,979 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:21,979 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:21,979 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:21,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:21,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1796711564, now seen corresponding path program 1 times [2019-10-03 02:44:21,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:21,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:21,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:21,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:21,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:44:22,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:22,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:22,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:22,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:22,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:22,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:22,143 INFO L87 Difference]: Start difference. First operand 657 states and 1037 transitions. Second operand 4 states. [2019-10-03 02:44:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:22,209 INFO L93 Difference]: Finished difference Result 659 states and 1038 transitions. [2019-10-03 02:44:22,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:22,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-03 02:44:22,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:22,216 INFO L225 Difference]: With dead ends: 659 [2019-10-03 02:44:22,216 INFO L226 Difference]: Without dead ends: 657 [2019-10-03 02:44:22,217 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:44:22,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-03 02:44:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-03 02:44:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-03 02:44:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1036 transitions. [2019-10-03 02:44:22,247 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1036 transitions. Word has length 138 [2019-10-03 02:44:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:22,248 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1036 transitions. [2019-10-03 02:44:22,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1036 transitions. [2019-10-03 02:44:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 02:44:22,255 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:22,255 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:22,255 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:22,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:22,256 INFO L82 PathProgramCache]: Analyzing trace with hash 619711975, now seen corresponding path program 1 times [2019-10-03 02:44:22,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:22,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:22,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:22,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:22,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:44:22,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:22,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:22,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:22,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:22,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:22,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:22,392 INFO L87 Difference]: Start difference. First operand 657 states and 1036 transitions. Second operand 4 states. [2019-10-03 02:44:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:22,456 INFO L93 Difference]: Finished difference Result 659 states and 1037 transitions. [2019-10-03 02:44:22,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:22,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-03 02:44:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:22,463 INFO L225 Difference]: With dead ends: 659 [2019-10-03 02:44:22,464 INFO L226 Difference]: Without dead ends: 657 [2019-10-03 02:44:22,464 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:44:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-03 02:44:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-03 02:44:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-03 02:44:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1035 transitions. [2019-10-03 02:44:22,494 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1035 transitions. Word has length 139 [2019-10-03 02:44:22,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:22,494 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1035 transitions. [2019-10-03 02:44:22,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1035 transitions. [2019-10-03 02:44:22,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:44:22,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:22,502 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:22,502 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:22,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:22,502 INFO L82 PathProgramCache]: Analyzing trace with hash 998018384, now seen corresponding path program 1 times [2019-10-03 02:44:22,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:22,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:22,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:22,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:22,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:44:22,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:22,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:44:22,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:22,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:44:22,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:44:22,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:44:22,817 INFO L87 Difference]: Start difference. First operand 657 states and 1035 transitions. Second operand 10 states. [2019-10-03 02:44:23,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:23,005 INFO L93 Difference]: Finished difference Result 666 states and 1046 transitions. [2019-10-03 02:44:23,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:44:23,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-03 02:44:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:23,011 INFO L225 Difference]: With dead ends: 666 [2019-10-03 02:44:23,012 INFO L226 Difference]: Without dead ends: 666 [2019-10-03 02:44:23,012 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:44:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-10-03 02:44:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2019-10-03 02:44:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-10-03 02:44:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1044 transitions. [2019-10-03 02:44:23,047 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1044 transitions. Word has length 140 [2019-10-03 02:44:23,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:23,047 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 1044 transitions. [2019-10-03 02:44:23,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:44:23,047 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1044 transitions. [2019-10-03 02:44:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:44:23,054 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:23,055 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:23,055 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:23,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1692665391, now seen corresponding path program 1 times [2019-10-03 02:44:23,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:23,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:23,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:23,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:44:23,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:23,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:44:23,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:23,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:44:23,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:44:23,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:44:23,182 INFO L87 Difference]: Start difference. First operand 664 states and 1044 transitions. Second operand 4 states. [2019-10-03 02:44:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:23,246 INFO L93 Difference]: Finished difference Result 662 states and 1039 transitions. [2019-10-03 02:44:23,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:44:23,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-03 02:44:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:23,253 INFO L225 Difference]: With dead ends: 662 [2019-10-03 02:44:23,253 INFO L226 Difference]: Without dead ends: 651 [2019-10-03 02:44:23,254 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:44:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-03 02:44:23,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-03 02:44:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-03 02:44:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1021 transitions. [2019-10-03 02:44:23,278 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1021 transitions. Word has length 140 [2019-10-03 02:44:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:23,279 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1021 transitions. [2019-10-03 02:44:23,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:44:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1021 transitions. [2019-10-03 02:44:23,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 02:44:23,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:23,285 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:23,285 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:23,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash 677141201, now seen corresponding path program 1 times [2019-10-03 02:44:23,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:23,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:23,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:23,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:23,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:44:23,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:23,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:23,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:23,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:23,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:23,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:23,459 INFO L87 Difference]: Start difference. First operand 651 states and 1021 transitions. Second operand 6 states. [2019-10-03 02:44:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:23,750 INFO L93 Difference]: Finished difference Result 654 states and 1024 transitions. [2019-10-03 02:44:23,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:23,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-03 02:44:23,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:23,755 INFO L225 Difference]: With dead ends: 654 [2019-10-03 02:44:23,755 INFO L226 Difference]: Without dead ends: 651 [2019-10-03 02:44:23,756 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:44:23,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-03 02:44:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-03 02:44:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-03 02:44:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1017 transitions. [2019-10-03 02:44:23,786 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1017 transitions. Word has length 141 [2019-10-03 02:44:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:23,788 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1017 transitions. [2019-10-03 02:44:23,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1017 transitions. [2019-10-03 02:44:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 02:44:23,793 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:23,793 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:23,794 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1320232493, now seen corresponding path program 1 times [2019-10-03 02:44:23,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:23,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:23,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:23,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:23,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:44:23,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:23,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:23,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:23,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:23,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:23,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:23,944 INFO L87 Difference]: Start difference. First operand 651 states and 1017 transitions. Second operand 6 states. [2019-10-03 02:44:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:24,179 INFO L93 Difference]: Finished difference Result 654 states and 1020 transitions. [2019-10-03 02:44:24,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:24,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-03 02:44:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:24,185 INFO L225 Difference]: With dead ends: 654 [2019-10-03 02:44:24,185 INFO L226 Difference]: Without dead ends: 651 [2019-10-03 02:44:24,186 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:44:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-03 02:44:24,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-03 02:44:24,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-03 02:44:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1013 transitions. [2019-10-03 02:44:24,206 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1013 transitions. Word has length 142 [2019-10-03 02:44:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:24,207 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1013 transitions. [2019-10-03 02:44:24,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1013 transitions. [2019-10-03 02:44:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:44:24,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:24,212 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:24,212 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:24,213 INFO L82 PathProgramCache]: Analyzing trace with hash 893402902, now seen corresponding path program 1 times [2019-10-03 02:44:24,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:24,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:24,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:24,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:24,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:24,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-10-03 02:44:24,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:24,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:24,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:24,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:24,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:24,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:24,344 INFO L87 Difference]: Start difference. First operand 651 states and 1013 transitions. Second operand 6 states. [2019-10-03 02:44:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:24,651 INFO L93 Difference]: Finished difference Result 654 states and 1016 transitions. [2019-10-03 02:44:24,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:24,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-03 02:44:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:24,657 INFO L225 Difference]: With dead ends: 654 [2019-10-03 02:44:24,657 INFO L226 Difference]: Without dead ends: 651 [2019-10-03 02:44:24,657 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:44:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-03 02:44:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-03 02:44:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-03 02:44:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1009 transitions. [2019-10-03 02:44:24,677 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1009 transitions. Word has length 143 [2019-10-03 02:44:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:24,678 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1009 transitions. [2019-10-03 02:44:24,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1009 transitions. [2019-10-03 02:44:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:44:24,683 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:24,684 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:24,684 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:24,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:24,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1947876246, now seen corresponding path program 1 times [2019-10-03 02:44:24,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:24,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:24,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:24,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:24,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:44:24,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:24,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:44:24,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:24,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:44:24,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:44:24,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:44:24,861 INFO L87 Difference]: Start difference. First operand 651 states and 1009 transitions. Second operand 7 states. [2019-10-03 02:44:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:24,980 INFO L93 Difference]: Finished difference Result 654 states and 1012 transitions. [2019-10-03 02:44:24,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:44:24,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-03 02:44:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:24,989 INFO L225 Difference]: With dead ends: 654 [2019-10-03 02:44:24,989 INFO L226 Difference]: Without dead ends: 630 [2019-10-03 02:44:24,991 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:44:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-03 02:44:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-03 02:44:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-03 02:44:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 975 transitions. [2019-10-03 02:44:25,027 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 975 transitions. Word has length 143 [2019-10-03 02:44:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:25,028 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 975 transitions. [2019-10-03 02:44:25,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:44:25,028 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 975 transitions. [2019-10-03 02:44:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-03 02:44:25,035 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:25,035 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:25,035 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:25,036 INFO L82 PathProgramCache]: Analyzing trace with hash 504333880, now seen corresponding path program 1 times [2019-10-03 02:44:25,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:25,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:25,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:25,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:25,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:44:25,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:25,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:25,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:25,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:25,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:25,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:25,189 INFO L87 Difference]: Start difference. First operand 630 states and 975 transitions. Second operand 6 states. [2019-10-03 02:44:25,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:25,301 INFO L93 Difference]: Finished difference Result 633 states and 978 transitions. [2019-10-03 02:44:25,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:25,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-03 02:44:25,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:25,307 INFO L225 Difference]: With dead ends: 633 [2019-10-03 02:44:25,307 INFO L226 Difference]: Without dead ends: 630 [2019-10-03 02:44:25,307 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:44:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-03 02:44:25,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-03 02:44:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-03 02:44:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 974 transitions. [2019-10-03 02:44:25,328 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 974 transitions. Word has length 144 [2019-10-03 02:44:25,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:25,330 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 974 transitions. [2019-10-03 02:44:25,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 974 transitions. [2019-10-03 02:44:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 02:44:25,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:25,335 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:25,336 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:25,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:25,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1035806555, now seen corresponding path program 1 times [2019-10-03 02:44:25,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:25,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:25,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:25,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:25,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:44:25,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:25,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:44:25,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:25,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:44:25,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:44:25,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:44:25,481 INFO L87 Difference]: Start difference. First operand 630 states and 974 transitions. Second operand 6 states. [2019-10-03 02:44:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:25,588 INFO L93 Difference]: Finished difference Result 633 states and 977 transitions. [2019-10-03 02:44:25,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:44:25,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-03 02:44:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:25,594 INFO L225 Difference]: With dead ends: 633 [2019-10-03 02:44:25,595 INFO L226 Difference]: Without dead ends: 630 [2019-10-03 02:44:25,595 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:44:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-03 02:44:25,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-03 02:44:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-03 02:44:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 973 transitions. [2019-10-03 02:44:25,616 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 973 transitions. Word has length 145 [2019-10-03 02:44:25,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:25,617 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 973 transitions. [2019-10-03 02:44:25,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:44:25,617 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 973 transitions. [2019-10-03 02:44:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-03 02:44:25,622 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:25,622 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:25,622 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:25,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:25,623 INFO L82 PathProgramCache]: Analyzing trace with hash 39300765, now seen corresponding path program 1 times [2019-10-03 02:44:25,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:25,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:25,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:25,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:25,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:44:25,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:25,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:44:25,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:25,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:44:25,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:44:25,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:44:25,854 INFO L87 Difference]: Start difference. First operand 630 states and 973 transitions. Second operand 12 states. [2019-10-03 02:44:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:26,041 INFO L93 Difference]: Finished difference Result 634 states and 976 transitions. [2019-10-03 02:44:26,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:44:26,042 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-03 02:44:26,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:26,047 INFO L225 Difference]: With dead ends: 634 [2019-10-03 02:44:26,047 INFO L226 Difference]: Without dead ends: 630 [2019-10-03 02:44:26,048 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:44:26,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-03 02:44:26,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-03 02:44:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-03 02:44:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 972 transitions. [2019-10-03 02:44:26,068 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 972 transitions. Word has length 146 [2019-10-03 02:44:26,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:26,068 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 972 transitions. [2019-10-03 02:44:26,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:44:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 972 transitions. [2019-10-03 02:44:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 02:44:26,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:26,073 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:26,074 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:26,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:26,074 INFO L82 PathProgramCache]: Analyzing trace with hash -733497836, now seen corresponding path program 1 times [2019-10-03 02:44:26,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:26,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:26,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:26,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:26,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-03 02:44:26,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:44:26,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:44:26,279 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-10-03 02:44:26,284 INFO L207 CegarAbsIntRunner]: [72], [73], [152], [156], [159], [355], [357], [359], [396], [397], [399], [400], [419], [421], [424], [426], [430], [486], [886], [888], [907], [927], [947], [967], [987], [989], [1018], [1019], [1020], [1022], [1119], [1122], [1127], [1130], [1149], [1150], [1152], [1161], [1163], [1176], [1189], [1192], [1228], [1233], [1266], [1267], [1347], [1349], [1352], [1354], [1360], [1364], [1365], [1401], [1404], [1409], [1414], [1419], [1424], [1429], [1432], [1548], [1559], [1564], [1567], [1586], [1817], [1821], [1825], [1829], [1833], [1837], [1840], [1842], [1843], [1856], [1859], [1865], [1869], [1982], [1983], [2343], [2347], [2350], [2368], [2543], [2544], [2545], [2546], [2547], [2548], [2549], [2550], [2551], [2565], [2566], [2567], [2568], [2589], [2590], [2599], [2600], [2601], [2602], [2609], [2610], [2611], [2612], [2657], [2658], [2669], [2670], [2699], [2700], [2701], [2702], [2713], [2714], [2715], [2716], [2723], [2747], [2748], [2749], [2750], [2755], [2756], [2783], [2784], [2785], [2786], [2787], [2823], [2824], [2825] [2019-10-03 02:44:26,336 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:44:26,336 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:44:26,449 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:44:26,451 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 193 root evaluator evaluations with a maximum evaluation depth of 0. Performed 193 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 264 variables. [2019-10-03 02:44:26,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:26,456 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:44:26,528 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:44:26,529 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:44:26,534 INFO L420 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2019-10-03 02:44:26,540 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:44:26,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:44:26,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-10-03 02:44:26,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:26,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:44:26,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:44:26,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:44:26,542 INFO L87 Difference]: Start difference. First operand 630 states and 972 transitions. Second operand 2 states. [2019-10-03 02:44:26,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:26,543 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:44:26,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:44:26,543 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 147 [2019-10-03 02:44:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:44:26,544 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:44:26,544 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:44:26,544 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:44:26,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:44:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:44:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:44:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:44:26,547 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2019-10-03 02:44:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:26,547 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:44:26,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:44:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:44:26,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:44:26,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:44:26 BoogieIcfgContainer [2019-10-03 02:44:26,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:44:26,557 INFO L168 Benchmark]: Toolchain (without parser) took 11104.97 ms. Allocated memory was 141.0 MB in the beginning and 456.1 MB in the end (delta: 315.1 MB). Free memory was 84.5 MB in the beginning and 248.4 MB in the end (delta: -163.9 MB). Peak memory consumption was 151.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:44:26,559 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 105.9 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:44:26,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1139.59 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 84.3 MB in the beginning and 140.0 MB in the end (delta: -55.7 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:44:26,567 INFO L168 Benchmark]: Boogie Preprocessor took 240.82 ms. Allocated memory is still 202.4 MB. Free memory was 140.0 MB in the beginning and 130.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:44:26,568 INFO L168 Benchmark]: RCFGBuilder took 2969.80 ms. Allocated memory was 202.4 MB in the beginning and 260.0 MB in the end (delta: 57.7 MB). Free memory was 130.4 MB in the beginning and 134.2 MB in the end (delta: -3.9 MB). Peak memory consumption was 91.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:44:26,570 INFO L168 Benchmark]: TraceAbstraction took 6750.08 ms. Allocated memory was 260.0 MB in the beginning and 456.1 MB in the end (delta: 196.1 MB). Free memory was 134.2 MB in the beginning and 248.4 MB in the end (delta: -114.2 MB). Peak memory consumption was 81.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:44:26,583 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.23 ms. Allocated memory is still 141.0 MB. Free memory was 105.9 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1139.59 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 84.3 MB in the beginning and 140.0 MB in the end (delta: -55.7 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 240.82 ms. Allocated memory is still 202.4 MB. Free memory was 140.0 MB in the beginning and 130.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2969.80 ms. Allocated memory was 202.4 MB in the beginning and 260.0 MB in the end (delta: 57.7 MB). Free memory was 130.4 MB in the beginning and 134.2 MB in the end (delta: -3.9 MB). Peak memory consumption was 91.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6750.08 ms. Allocated memory was 260.0 MB in the beginning and 456.1 MB in the end (delta: 196.1 MB). Free memory was 134.2 MB in the beginning and 248.4 MB in the end (delta: -114.2 MB). Peak memory consumption was 81.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3121]: 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 81 procedures, 947 locations, 1 error locations. SAFE Result, 6.6s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13966 SDtfs, 440 SDslu, 54020 SDs, 0 SdLazy, 1264 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=817occurred 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.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s 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...