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_spec9_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:47:00,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:47:00,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:47:00,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:47:00,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:47:00,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:47:00,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:47:00,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:47:00,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:47:00,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:47:00,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:47:00,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:47:00,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:47:00,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:47:00,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:47:00,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:47:00,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:47:00,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:47:00,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:47:00,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:47:00,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:47:00,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:47:00,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:47:00,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:47:00,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:47:00,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:47:00,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:47:00,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:47:00,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:47:00,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:47:00,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:47:00,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:47:00,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:47:00,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:47:00,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:47:00,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:47:00,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:47:00,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:47:00,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:47:00,625 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:47:00,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:47:00,627 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:47:00,642 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:47:00,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:47:00,643 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:47:00,643 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:47:00,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:47:00,644 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:47:00,644 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:47:00,644 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:47:00,645 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:47:00,645 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:47:00,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:47:00,646 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:47:00,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:47:00,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:47:00,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:47:00,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:47:00,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:47:00,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:47:00,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:47:00,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:47:00,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:47:00,648 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:47:00,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:47:00,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:47:00,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:47:00,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:47:00,649 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:47:00,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:47:00,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:47:00,650 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:47:00,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:47:00,694 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:47:00,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:47:00,699 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:47:00,700 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:47:00,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product32.cil.c [2019-10-03 02:47:00,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e780c253f/87c28595988246ebac25bd9208246e3f/FLAG3f156f464 [2019-10-03 02:47:01,385 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:47:01,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product32.cil.c [2019-10-03 02:47:01,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e780c253f/87c28595988246ebac25bd9208246e3f/FLAG3f156f464 [2019-10-03 02:47:01,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e780c253f/87c28595988246ebac25bd9208246e3f [2019-10-03 02:47:01,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:47:01,653 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:47:01,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:47:01,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:47:01,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:47:01,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:47:01" (1/1) ... [2019-10-03 02:47:01,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d329d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:01, skipping insertion in model container [2019-10-03 02:47:01,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:47:01" (1/1) ... [2019-10-03 02:47:01,670 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:47:01,758 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:47:02,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:47:02,566 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:47:02,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:47:02,845 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:47:02,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:02 WrapperNode [2019-10-03 02:47:02,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:47:02,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:47:02,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:47:02,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:47:02,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:02" (1/1) ... [2019-10-03 02:47:02,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:02" (1/1) ... [2019-10-03 02:47:02,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:02" (1/1) ... [2019-10-03 02:47:02,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:02" (1/1) ... [2019-10-03 02:47:02,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:02" (1/1) ... [2019-10-03 02:47:03,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:02" (1/1) ... [2019-10-03 02:47:03,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:02" (1/1) ... [2019-10-03 02:47:03,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:47:03,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:47:03,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:47:03,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:47:03,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:02" (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:47:03,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:47:03,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:47:03,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:47:03,163 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:47:03,163 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:47:03,164 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:47:03,164 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:47:03,164 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:47:03,164 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:47:03,164 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:47:03,165 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:47:03,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:47:03,166 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:47:03,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-03 02:47:03,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-03 02:47:03,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-03 02:47:03,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-03 02:47:03,168 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:47:03,169 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:47:03,169 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:47:03,169 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:47:03,169 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:47:03,170 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:47:03,170 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-03 02:47:03,170 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:47:03,171 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:47:03,171 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:47:03,172 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:47:03,172 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:47:03,172 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:47:03,172 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:47:03,172 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:47:03,172 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:47:03,173 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:47:03,173 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:47:03,173 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-03 02:47:03,174 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:47:03,174 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:47:03,174 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:47:03,174 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:47:03,175 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-03 02:47:03,175 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:47:03,175 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:47:03,175 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:47:03,175 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-03 02:47:03,175 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:47:03,176 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-03 02:47:03,176 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:47:03,176 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:47:03,176 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:47:03,176 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:47:03,176 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:47:03,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:47:03,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:47:03,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:47:03,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:47:03,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:47:03,178 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:47:03,178 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:47:03,178 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:47:03,178 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:47:03,179 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:47:03,179 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:47:03,179 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:47:03,179 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:47:03,180 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:47:03,180 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:47:03,180 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:47:03,180 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:47:03,180 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:47:03,181 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:47:03,181 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:47:03,181 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:47:03,182 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:47:03,182 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:47:03,182 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:47:03,182 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:47:03,182 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:47:03,182 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:47:03,183 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:47:03,183 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:47:03,183 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:47:03,183 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:47:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:47:03,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:47:03,185 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:47:03,185 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:47:03,186 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:47:03,186 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:47:03,186 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:47:03,186 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:47:03,186 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:47:03,186 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:47:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:47:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:47:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:47:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:47:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:47:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:47:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:47:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-03 02:47:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-03 02:47:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-03 02:47:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-03 02:47:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:47:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:47:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:47:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:47:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:47:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:47:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:47:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:47:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:47:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:47:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:47:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:47:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:47:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:47:03,191 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:47:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:47:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-03 02:47:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:47:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:47:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:47:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:47:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:47:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:47:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-03 02:47:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:47:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:47:03,198 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:47:03,198 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-03 02:47:03,199 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:47:03,199 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:47:03,199 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:47:03,199 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-03 02:47:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-03 02:47:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:47:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:47:03,204 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:47:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:47:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:47:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:47:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:47:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:47:03,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:47:03,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:47:03,212 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:47:03,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:47:03,213 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:47:03,213 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:47:03,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:47:03,213 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:47:03,214 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:47:03,214 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:47:03,214 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:47:03,214 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:47:03,214 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:47:03,214 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:47:03,214 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:47:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:47:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:47:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:47:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:47:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:47:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:47:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:47:03,215 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:47:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:47:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:47:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:47:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:47:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:47:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:47:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:47:03,216 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:47:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:47:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:47:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:47:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:47:03,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:47:05,514 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:47:05,514 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:47:05,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:47:05 BoogieIcfgContainer [2019-10-03 02:47:05,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:47:05,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:47:05,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:47:05,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:47:05,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:47:01" (1/3) ... [2019-10-03 02:47:05,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430ffa92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:47:05, skipping insertion in model container [2019-10-03 02:47:05,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:47:02" (2/3) ... [2019-10-03 02:47:05,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430ffa92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:47:05, skipping insertion in model container [2019-10-03 02:47:05,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:47:05" (3/3) ... [2019-10-03 02:47:05,529 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product32.cil.c [2019-10-03 02:47:05,542 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:47:05,556 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:47:05,576 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:47:05,610 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:47:05,610 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:47:05,610 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:47:05,611 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:47:05,611 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:47:05,611 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:47:05,611 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:47:05,611 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:47:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2019-10-03 02:47:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-03 02:47:05,681 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:05,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:05,685 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:05,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:05,692 INFO L82 PathProgramCache]: Analyzing trace with hash 165755889, now seen corresponding path program 1 times [2019-10-03 02:47:05,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:05,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:05,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:05,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:05,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:06,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:06,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:47:06,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:06,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:47:06,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:47:06,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:47:06,338 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 4 states. [2019-10-03 02:47:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:06,574 INFO L93 Difference]: Finished difference Result 668 states and 1049 transitions. [2019-10-03 02:47:06,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:47:06,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-03 02:47:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:06,602 INFO L225 Difference]: With dead ends: 668 [2019-10-03 02:47:06,602 INFO L226 Difference]: Without dead ends: 657 [2019-10-03 02:47:06,604 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:47:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-03 02:47:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-03 02:47:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-03 02:47:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1037 transitions. [2019-10-03 02:47:06,710 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1037 transitions. Word has length 87 [2019-10-03 02:47:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:06,711 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1037 transitions. [2019-10-03 02:47:06,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:47:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1037 transitions. [2019-10-03 02:47:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 02:47:06,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:06,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:06,718 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:06,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1802747224, now seen corresponding path program 1 times [2019-10-03 02:47:06,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:06,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:06,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:06,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:06,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:06,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:06,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:47:06,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:06,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:47:06,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:47:06,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:47:06,896 INFO L87 Difference]: Start difference. First operand 657 states and 1037 transitions. Second operand 4 states. [2019-10-03 02:47:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:06,983 INFO L93 Difference]: Finished difference Result 659 states and 1038 transitions. [2019-10-03 02:47:06,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:47:06,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-03 02:47:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:07,001 INFO L225 Difference]: With dead ends: 659 [2019-10-03 02:47:07,001 INFO L226 Difference]: Without dead ends: 657 [2019-10-03 02:47:07,002 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:47:07,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-03 02:47:07,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-03 02:47:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-03 02:47:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1036 transitions. [2019-10-03 02:47:07,063 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1036 transitions. Word has length 90 [2019-10-03 02:47:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:07,064 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1036 transitions. [2019-10-03 02:47:07,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:47:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1036 transitions. [2019-10-03 02:47:07,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 02:47:07,070 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:07,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:07,071 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:07,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:07,071 INFO L82 PathProgramCache]: Analyzing trace with hash 464088220, now seen corresponding path program 1 times [2019-10-03 02:47:07,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:07,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:07,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:07,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:07,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:07,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:07,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:47:07,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:07,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:47:07,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:47:07,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:47:07,255 INFO L87 Difference]: Start difference. First operand 657 states and 1036 transitions. Second operand 4 states. [2019-10-03 02:47:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:07,327 INFO L93 Difference]: Finished difference Result 659 states and 1037 transitions. [2019-10-03 02:47:07,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:47:07,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-03 02:47:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:07,337 INFO L225 Difference]: With dead ends: 659 [2019-10-03 02:47:07,337 INFO L226 Difference]: Without dead ends: 657 [2019-10-03 02:47:07,337 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:47:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-03 02:47:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-03 02:47:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-03 02:47:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1035 transitions. [2019-10-03 02:47:07,383 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1035 transitions. Word has length 91 [2019-10-03 02:47:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:07,384 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1035 transitions. [2019-10-03 02:47:07,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:47:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1035 transitions. [2019-10-03 02:47:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:47:07,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:07,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:07,387 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:07,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1512177068, now seen corresponding path program 1 times [2019-10-03 02:47:07,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:07,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:07,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:07,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:07,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:07,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:07,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:47:07,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:07,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:47:07,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:47:07,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:47:07,565 INFO L87 Difference]: Start difference. First operand 657 states and 1035 transitions. Second operand 4 states. [2019-10-03 02:47:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:07,655 INFO L93 Difference]: Finished difference Result 659 states and 1036 transitions. [2019-10-03 02:47:07,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:47:07,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-03 02:47:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:07,661 INFO L225 Difference]: With dead ends: 659 [2019-10-03 02:47:07,661 INFO L226 Difference]: Without dead ends: 657 [2019-10-03 02:47:07,661 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:47:07,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-03 02:47:07,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-03 02:47:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-03 02:47:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1034 transitions. [2019-10-03 02:47:07,684 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1034 transitions. Word has length 92 [2019-10-03 02:47:07,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:07,685 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1034 transitions. [2019-10-03 02:47:07,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:47:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1034 transitions. [2019-10-03 02:47:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 02:47:07,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:07,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:07,691 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:07,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:07,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1779400680, now seen corresponding path program 1 times [2019-10-03 02:47:07,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:07,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:07,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:07,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:07,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:07,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:07,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:47:07,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:07,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:47:07,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:47:07,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:47:07,861 INFO L87 Difference]: Start difference. First operand 657 states and 1034 transitions. Second operand 4 states. [2019-10-03 02:47:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:07,912 INFO L93 Difference]: Finished difference Result 659 states and 1035 transitions. [2019-10-03 02:47:07,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:47:07,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-03 02:47:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:07,919 INFO L225 Difference]: With dead ends: 659 [2019-10-03 02:47:07,919 INFO L226 Difference]: Without dead ends: 657 [2019-10-03 02:47:07,919 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:47:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-03 02:47:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-03 02:47:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-03 02:47:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1033 transitions. [2019-10-03 02:47:07,947 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1033 transitions. Word has length 93 [2019-10-03 02:47:07,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:07,947 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1033 transitions. [2019-10-03 02:47:07,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:47:07,948 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1033 transitions. [2019-10-03 02:47:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 02:47:07,949 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:07,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:07,950 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:07,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:07,950 INFO L82 PathProgramCache]: Analyzing trace with hash -605939888, now seen corresponding path program 1 times [2019-10-03 02:47:07,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:07,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:07,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:07,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:07,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:08,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:08,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:47:08,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:08,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:47:08,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:47:08,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:47:08,164 INFO L87 Difference]: Start difference. First operand 657 states and 1033 transitions. Second operand 10 states. [2019-10-03 02:47:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:08,331 INFO L93 Difference]: Finished difference Result 666 states and 1044 transitions. [2019-10-03 02:47:08,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:47:08,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-03 02:47:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:08,339 INFO L225 Difference]: With dead ends: 666 [2019-10-03 02:47:08,339 INFO L226 Difference]: Without dead ends: 666 [2019-10-03 02:47:08,340 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:47:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-10-03 02:47:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2019-10-03 02:47:08,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-10-03 02:47:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1042 transitions. [2019-10-03 02:47:08,389 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1042 transitions. Word has length 94 [2019-10-03 02:47:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:08,389 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 1042 transitions. [2019-10-03 02:47:08,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:47:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1042 transitions. [2019-10-03 02:47:08,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 02:47:08,392 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:08,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:08,392 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:08,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:08,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1758408303, now seen corresponding path program 1 times [2019-10-03 02:47:08,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:08,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:08,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:08,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:08,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:08,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:08,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:47:08,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:08,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:47:08,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:47:08,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:47:08,497 INFO L87 Difference]: Start difference. First operand 664 states and 1042 transitions. Second operand 4 states. [2019-10-03 02:47:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:08,542 INFO L93 Difference]: Finished difference Result 662 states and 1037 transitions. [2019-10-03 02:47:08,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:47:08,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-03 02:47:08,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:08,548 INFO L225 Difference]: With dead ends: 662 [2019-10-03 02:47:08,548 INFO L226 Difference]: Without dead ends: 651 [2019-10-03 02:47:08,549 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:47:08,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-03 02:47:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-03 02:47:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-03 02:47:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1019 transitions. [2019-10-03 02:47:08,574 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1019 transitions. Word has length 94 [2019-10-03 02:47:08,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:08,574 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1019 transitions. [2019-10-03 02:47:08,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:47:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1019 transitions. [2019-10-03 02:47:08,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 02:47:08,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:08,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:08,577 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:08,577 INFO L82 PathProgramCache]: Analyzing trace with hash -795855418, now seen corresponding path program 1 times [2019-10-03 02:47:08,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:08,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:08,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:08,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:08,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:08,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:47:08,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:08,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:47:08,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:47:08,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:47:08,783 INFO L87 Difference]: Start difference. First operand 651 states and 1019 transitions. Second operand 6 states. [2019-10-03 02:47:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:09,020 INFO L93 Difference]: Finished difference Result 654 states and 1022 transitions. [2019-10-03 02:47:09,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:47:09,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-03 02:47:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:09,028 INFO L225 Difference]: With dead ends: 654 [2019-10-03 02:47:09,028 INFO L226 Difference]: Without dead ends: 651 [2019-10-03 02:47:09,029 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:47:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-03 02:47:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-03 02:47:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-03 02:47:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1015 transitions. [2019-10-03 02:47:09,053 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1015 transitions. Word has length 95 [2019-10-03 02:47:09,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:09,055 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1015 transitions. [2019-10-03 02:47:09,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:47:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1015 transitions. [2019-10-03 02:47:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 02:47:09,057 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:09,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:09,057 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:09,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:09,058 INFO L82 PathProgramCache]: Analyzing trace with hash 26339251, now seen corresponding path program 1 times [2019-10-03 02:47:09,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:09,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:09,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:09,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:09,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:09,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:09,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:47:09,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:09,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:47:09,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:47:09,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:47:09,201 INFO L87 Difference]: Start difference. First operand 651 states and 1015 transitions. Second operand 6 states. [2019-10-03 02:47:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:09,395 INFO L93 Difference]: Finished difference Result 654 states and 1018 transitions. [2019-10-03 02:47:09,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:47:09,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-03 02:47:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:09,401 INFO L225 Difference]: With dead ends: 654 [2019-10-03 02:47:09,401 INFO L226 Difference]: Without dead ends: 651 [2019-10-03 02:47:09,402 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:47:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-03 02:47:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-03 02:47:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-03 02:47:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1011 transitions. [2019-10-03 02:47:09,422 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1011 transitions. Word has length 96 [2019-10-03 02:47:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:09,423 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1011 transitions. [2019-10-03 02:47:09,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:47:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1011 transitions. [2019-10-03 02:47:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:47:09,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:09,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:09,426 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:09,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:09,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1115555883, now seen corresponding path program 1 times [2019-10-03 02:47:09,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:09,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:09,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:09,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:09,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:09,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:09,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:47:09,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:09,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:47:09,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:47:09,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:47:09,555 INFO L87 Difference]: Start difference. First operand 651 states and 1011 transitions. Second operand 6 states. [2019-10-03 02:47:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:09,761 INFO L93 Difference]: Finished difference Result 654 states and 1014 transitions. [2019-10-03 02:47:09,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:47:09,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-03 02:47:09,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:09,767 INFO L225 Difference]: With dead ends: 654 [2019-10-03 02:47:09,767 INFO L226 Difference]: Without dead ends: 651 [2019-10-03 02:47:09,768 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:47:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-03 02:47:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-03 02:47:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-03 02:47:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1007 transitions. [2019-10-03 02:47:09,790 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1007 transitions. Word has length 97 [2019-10-03 02:47:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:09,790 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 1007 transitions. [2019-10-03 02:47:09,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:47:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1007 transitions. [2019-10-03 02:47:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 02:47:09,792 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:09,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:09,792 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:09,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:09,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1213864789, now seen corresponding path program 1 times [2019-10-03 02:47:09,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:09,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:09,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:09,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:09,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:10,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:10,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:47:10,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:10,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:47:10,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:47:10,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:47:10,017 INFO L87 Difference]: Start difference. First operand 651 states and 1007 transitions. Second operand 7 states. [2019-10-03 02:47:10,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:10,113 INFO L93 Difference]: Finished difference Result 654 states and 1010 transitions. [2019-10-03 02:47:10,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:47:10,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-10-03 02:47:10,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:10,120 INFO L225 Difference]: With dead ends: 654 [2019-10-03 02:47:10,121 INFO L226 Difference]: Without dead ends: 630 [2019-10-03 02:47:10,121 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:47:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-03 02:47:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-03 02:47:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-03 02:47:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 973 transitions. [2019-10-03 02:47:10,144 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 973 transitions. Word has length 97 [2019-10-03 02:47:10,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:10,145 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 973 transitions. [2019-10-03 02:47:10,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:47:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 973 transitions. [2019-10-03 02:47:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 02:47:10,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:10,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:10,148 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:10,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:10,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1892518776, now seen corresponding path program 1 times [2019-10-03 02:47:10,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:10,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:10,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:10,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:10,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:10,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:10,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:47:10,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:10,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:47:10,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:47:10,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:47:10,284 INFO L87 Difference]: Start difference. First operand 630 states and 973 transitions. Second operand 6 states. [2019-10-03 02:47:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:10,387 INFO L93 Difference]: Finished difference Result 633 states and 976 transitions. [2019-10-03 02:47:10,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:47:10,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-10-03 02:47:10,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:10,392 INFO L225 Difference]: With dead ends: 633 [2019-10-03 02:47:10,392 INFO L226 Difference]: Without dead ends: 630 [2019-10-03 02:47:10,393 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:47:10,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-03 02:47:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-03 02:47:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-03 02:47:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 972 transitions. [2019-10-03 02:47:10,419 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 972 transitions. Word has length 98 [2019-10-03 02:47:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:10,420 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 972 transitions. [2019-10-03 02:47:10,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:47:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 972 transitions. [2019-10-03 02:47:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-03 02:47:10,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:10,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:10,422 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:10,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:10,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1579550352, now seen corresponding path program 1 times [2019-10-03 02:47:10,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:10,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:10,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:10,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:10,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:10,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:10,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:47:10,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:10,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:47:10,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:47:10,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:47:10,562 INFO L87 Difference]: Start difference. First operand 630 states and 972 transitions. Second operand 6 states. [2019-10-03 02:47:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:10,662 INFO L93 Difference]: Finished difference Result 633 states and 975 transitions. [2019-10-03 02:47:10,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:47:10,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-03 02:47:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:10,671 INFO L225 Difference]: With dead ends: 633 [2019-10-03 02:47:10,671 INFO L226 Difference]: Without dead ends: 630 [2019-10-03 02:47:10,672 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:47:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-03 02:47:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-03 02:47:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-03 02:47:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 971 transitions. [2019-10-03 02:47:10,707 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 971 transitions. Word has length 99 [2019-10-03 02:47:10,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:10,710 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 971 transitions. [2019-10-03 02:47:10,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:47:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 971 transitions. [2019-10-03 02:47:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-03 02:47:10,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:10,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:10,712 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:10,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:10,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1838449469, now seen corresponding path program 1 times [2019-10-03 02:47:10,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:10,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:10,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:10,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:10,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:10,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:10,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:47:10,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:10,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:47:10,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:47:10,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:47:10,914 INFO L87 Difference]: Start difference. First operand 630 states and 971 transitions. Second operand 12 states. [2019-10-03 02:47:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:11,102 INFO L93 Difference]: Finished difference Result 634 states and 974 transitions. [2019-10-03 02:47:11,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:47:11,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-10-03 02:47:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:11,108 INFO L225 Difference]: With dead ends: 634 [2019-10-03 02:47:11,108 INFO L226 Difference]: Without dead ends: 630 [2019-10-03 02:47:11,109 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:47:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-03 02:47:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-03 02:47:11,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-03 02:47:11,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 970 transitions. [2019-10-03 02:47:11,130 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 970 transitions. Word has length 100 [2019-10-03 02:47:11,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:11,130 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 970 transitions. [2019-10-03 02:47:11,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:47:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 970 transitions. [2019-10-03 02:47:11,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 02:47:11,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:11,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:11,133 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:11,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:11,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1351924293, now seen corresponding path program 1 times [2019-10-03 02:47:11,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:11,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:11,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:11,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:11,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:47:11,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:11,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:47:11,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:11,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:47:11,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:47:11,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:47:11,356 INFO L87 Difference]: Start difference. First operand 630 states and 970 transitions. Second operand 6 states. [2019-10-03 02:47:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:15,111 INFO L93 Difference]: Finished difference Result 1299 states and 2052 transitions. [2019-10-03 02:47:15,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:47:15,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-10-03 02:47:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:15,123 INFO L225 Difference]: With dead ends: 1299 [2019-10-03 02:47:15,123 INFO L226 Difference]: Without dead ends: 1299 [2019-10-03 02:47:15,123 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:47:15,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2019-10-03 02:47:15,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1172. [2019-10-03 02:47:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-10-03 02:47:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1850 transitions. [2019-10-03 02:47:15,168 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1850 transitions. Word has length 101 [2019-10-03 02:47:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:15,169 INFO L475 AbstractCegarLoop]: Abstraction has 1172 states and 1850 transitions. [2019-10-03 02:47:15,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:47:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1850 transitions. [2019-10-03 02:47:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-03 02:47:15,176 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:15,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:15,176 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1530865345, now seen corresponding path program 1 times [2019-10-03 02:47:15,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:15,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:15,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:15,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:15,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:15,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:47:15,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:47:15,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:47:15,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:15,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:47:15,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:47:15,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:47:15,497 INFO L87 Difference]: Start difference. First operand 1172 states and 1850 transitions. Second operand 12 states. [2019-10-03 02:47:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:26,932 INFO L93 Difference]: Finished difference Result 2742 states and 4276 transitions. [2019-10-03 02:47:26,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 02:47:26,934 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 159 [2019-10-03 02:47:26,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:26,950 INFO L225 Difference]: With dead ends: 2742 [2019-10-03 02:47:26,951 INFO L226 Difference]: Without dead ends: 2742 [2019-10-03 02:47:26,951 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-03 02:47:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2019-10-03 02:47:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2684. [2019-10-03 02:47:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2019-10-03 02:47:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 4196 transitions. [2019-10-03 02:47:27,039 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 4196 transitions. Word has length 159 [2019-10-03 02:47:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:27,039 INFO L475 AbstractCegarLoop]: Abstraction has 2684 states and 4196 transitions. [2019-10-03 02:47:27,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:47:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 4196 transitions. [2019-10-03 02:47:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-03 02:47:27,045 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:47:27,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:47:27,045 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:47:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:27,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1845349951, now seen corresponding path program 1 times [2019-10-03 02:47:27,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:47:27,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:27,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:47:27,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:47:27,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:47:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:47:27,264 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:47:27,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:47:27,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:47:27,266 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2019-10-03 02:47:27,269 INFO L207 CegarAbsIntRunner]: [218], [220], [222], [237], [256], [258], [261], [263], [267], [709], [711], [714], [719], [727], [760], [761], [843], [844], [1138], [1139], [1212], [1216], [1219], [1254], [1256], [1257], [1265], [1272], [1274], [1283], [1285], [1298], [1311], [1316], [1317], [1318], [1323], [1324], [1326], [1328], [1331], [1402], [1405], [1435], [1436], [1544], [1546], [1549], [1551], [1557], [1561], [1562], [1598], [1601], [1606], [1611], [1616], [1621], [1626], [1629], [1745], [1754], [1759], [1762], [1781], [1970], [1974], [1978], [1982], [1986], [1990], [1993], [1995], [1996], [2009], [2012], [2018], [2022], [2023], [2026], [2048], [2249], [2253], [2256], [2274], [2366], [2368], [2465], [2468], [2473], [2476], [2494], [2513], [2514], [2515], [2516], [2545], [2546], [2547], [2548], [2595], [2596], [2597], [2598], [2601], [2602], [2757], [2758], [2759], [2760], [2761], [2762], [2763], [2764], [2765], [2771], [2772], [2777], [2778], [2779], [2780], [2781], [2782], [2791], [2792], [2793], [2794], [2797], [2813], [2814], [2815], [2816], [2821], [2822], [2829], [2830], [2831], [2832], [2833], [2843], [2844], [2845], [2859], [2860], [2889], [2890], [2891], [2892] [2019-10-03 02:47:27,347 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:47:27,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:47:27,445 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:47:27,447 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 196 root evaluator evaluations with a maximum evaluation depth of 0. Performed 196 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 270 variables. [2019-10-03 02:47:27,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:47:27,452 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:47:27,545 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:47:27,546 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:47:27,551 INFO L420 sIntCurrentIteration]: We unified 159 AI predicates to 159 [2019-10-03 02:47:27,551 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:47:27,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:47:27,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-10-03 02:47:27,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:47:27,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:47:27,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:47:27,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:47:27,555 INFO L87 Difference]: Start difference. First operand 2684 states and 4196 transitions. Second operand 2 states. [2019-10-03 02:47:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:47:27,556 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:47:27,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:47:27,556 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 160 [2019-10-03 02:47:27,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:47:27,556 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:47:27,556 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:47:27,557 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 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:47:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:47:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:47:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:47:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:47:27,558 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2019-10-03 02:47:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:47:27,558 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:47:27,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:47:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:47:27,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:47:27,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:47:27 BoogieIcfgContainer [2019-10-03 02:47:27,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:47:27,570 INFO L168 Benchmark]: Toolchain (without parser) took 25915.21 ms. Allocated memory was 138.9 MB in the beginning and 649.6 MB in the end (delta: 510.7 MB). Free memory was 83.6 MB in the beginning and 211.5 MB in the end (delta: -127.9 MB). Peak memory consumption was 382.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:47:27,572 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 105.0 MB in the beginning and 104.7 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:47:27,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1193.10 ms. Allocated memory was 138.9 MB in the beginning and 199.2 MB in the end (delta: 60.3 MB). Free memory was 83.4 MB in the beginning and 133.4 MB in the end (delta: -50.0 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:47:27,578 INFO L168 Benchmark]: Boogie Preprocessor took 233.78 ms. Allocated memory is still 199.2 MB. Free memory was 133.4 MB in the beginning and 123.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:47:27,579 INFO L168 Benchmark]: RCFGBuilder took 2435.08 ms. Allocated memory was 199.2 MB in the beginning and 268.4 MB in the end (delta: 69.2 MB). Free memory was 123.2 MB in the beginning and 137.9 MB in the end (delta: -14.7 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:47:27,580 INFO L168 Benchmark]: TraceAbstraction took 22045.84 ms. Allocated memory was 268.4 MB in the beginning and 649.6 MB in the end (delta: 381.2 MB). Free memory was 137.9 MB in the beginning and 211.5 MB in the end (delta: -73.6 MB). Peak memory consumption was 307.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:47:27,593 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 138.9 MB. Free memory was 105.0 MB in the beginning and 104.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1193.10 ms. Allocated memory was 138.9 MB in the beginning and 199.2 MB in the end (delta: 60.3 MB). Free memory was 83.4 MB in the beginning and 133.4 MB in the end (delta: -50.0 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 233.78 ms. Allocated memory is still 199.2 MB. Free memory was 133.4 MB in the beginning and 123.2 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2435.08 ms. Allocated memory was 199.2 MB in the beginning and 268.4 MB in the end (delta: 69.2 MB). Free memory was 123.2 MB in the beginning and 137.9 MB in the end (delta: -14.7 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22045.84 ms. Allocated memory was 268.4 MB in the beginning and 649.6 MB in the end (delta: 381.2 MB). Free memory was 137.9 MB in the beginning and 211.5 MB in the end (delta: -73.6 MB). Peak memory consumption was 307.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 711]: 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 83 procedures, 954 locations, 1 error locations. SAFE Result, 21.9s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 17.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16597 SDtfs, 4713 SDslu, 55946 SDs, 0 SdLazy, 17499 SolverSat, 1434 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2684occurred in iteration=16, 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.628930817610063 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 187 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1743 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1726 ConstructedInterpolants, 0 QuantifiedInterpolants, 279657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 31/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...