java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:32:50,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:32:50,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:32:50,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:32:50,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:32:50,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:32:50,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:32:50,783 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:32:50,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:32:50,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:32:50,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:32:50,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:32:50,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:32:50,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:32:50,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:32:50,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:32:50,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:32:50,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:32:50,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:32:50,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:32:50,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:32:50,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:32:50,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:32:50,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:32:50,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:32:50,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:32:50,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:32:50,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:32:50,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:32:50,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:32:50,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:32:50,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:32:50,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:32:50,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:32:50,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:32:50,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:32:50,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:32:50,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:32:50,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:32:50,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:32:50,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:32:50,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:32:50,827 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:32:50,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:32:50,827 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:32:50,827 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:32:50,828 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:32:50,828 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:32:50,829 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:32:50,829 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:32:50,829 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:32:50,829 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:32:50,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:32:50,830 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:32:50,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:32:50,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:32:50,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:32:50,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:32:50,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:32:50,831 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:32:50,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:32:50,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:32:50,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:32:50,832 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:32:50,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:32:50,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:32:50,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:32:50,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:32:50,833 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:32:50,833 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:32:50,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:32:50,834 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:32:50,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:32:50,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:32:50,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:32:50,879 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:32:50,879 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:32:50,880 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product32.cil.c [2019-09-10 02:32:50,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00143cada/6533b55b1e934528b6a3b257fb2628c5/FLAGdd5fa6dcf [2019-09-10 02:32:51,628 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:32:51,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product32.cil.c [2019-09-10 02:32:51,662 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00143cada/6533b55b1e934528b6a3b257fb2628c5/FLAGdd5fa6dcf [2019-09-10 02:32:51,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00143cada/6533b55b1e934528b6a3b257fb2628c5 [2019-09-10 02:32:51,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:32:51,794 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:32:51,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:32:51,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:32:51,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:32:51,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:32:51" (1/1) ... [2019-09-10 02:32:51,805 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f91d846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:51, skipping insertion in model container [2019-09-10 02:32:51,805 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:32:51" (1/1) ... [2019-09-10 02:32:51,813 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:32:51,897 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:32:52,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:32:52,647 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:32:52,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:32:52,889 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:32:52,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:52 WrapperNode [2019-09-10 02:32:52,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:32:52,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:32:52,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:32:52,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:32:52,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:52" (1/1) ... [2019-09-10 02:32:52,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:52" (1/1) ... [2019-09-10 02:32:52,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:52" (1/1) ... [2019-09-10 02:32:52,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:52" (1/1) ... [2019-09-10 02:32:53,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:52" (1/1) ... [2019-09-10 02:32:53,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:52" (1/1) ... [2019-09-10 02:32:53,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:52" (1/1) ... [2019-09-10 02:32:53,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:32:53,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:32:53,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:32:53,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:32:53,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:32:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:32:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:32:53,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:32:53,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:32:53,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:32:53,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:32:53,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:32:53,256 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:32:53,256 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:32:53,257 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:32:53,257 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:32:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:32:53,258 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:32:53,259 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:32:53,259 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:32:53,260 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:32:53,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:32:53,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:32:53,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:32:53,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:32:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:32:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:32:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:32:53,263 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:32:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:32:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:32:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:32:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:32:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:32:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:32:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:32:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:32:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:32:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:32:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:32:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:32:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:32:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:32:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:32:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:32:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:32:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:32:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:32:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:32:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:32:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:32:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:32:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:32:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:32:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:32:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:32:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:32:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:32:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:32:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:32:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-10 02:32:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:32:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:32:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:32:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:32:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:32:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:32:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:32:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:32:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:32:53,273 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:32:53,273 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-10 02:32:53,273 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-10 02:32:53,273 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:32:53,274 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:32:53,274 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:32:53,274 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-10 02:32:53,274 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-10 02:32:53,275 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:32:53,275 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:32:53,275 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:32:53,275 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-09-10 02:32:53,276 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:32:53,276 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-09-10 02:32:53,276 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:32:53,277 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:32:53,277 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-10 02:32:53,277 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-10 02:32:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:32:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:32:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:32:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:32:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:32:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:32:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:32:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:32:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:32:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:32:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:32:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:32:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:32:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:32:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:32:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:32:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:32:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:32:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:32:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:32:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:32:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:32:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:32:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:32:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:32:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:32:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:32:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:32:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:32:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:32:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:32:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:32:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:32:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:32:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:32:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:32:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:32:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:32:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:32:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:32:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:32:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:32:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:32:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:32:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:32:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:32:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:32:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:32:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:32:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:32:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:32:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:32:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:32:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:32:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:32:53,297 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:32:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:32:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:32:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:32:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:32:53,311 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:32:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:32:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:32:53,312 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:32:53,313 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:32:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:32:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:32:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:32:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:32:53,314 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:32:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:32:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:32:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:32:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-10 02:32:53,315 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-10 02:32:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:32:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:32:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-10 02:32:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:32:53,316 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:32:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:32:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:32:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:32:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-10 02:32:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-10 02:32:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:32:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:32:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-10 02:32:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-10 02:32:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:32:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:32:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:32:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-09-10 02:32:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-09-10 02:32:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:32:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:32:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:32:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:32:55,980 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:32:55,981 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:32:55,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:32:55 BoogieIcfgContainer [2019-09-10 02:32:55,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:32:55,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:32:55,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:32:55,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:32:55,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:32:51" (1/3) ... [2019-09-10 02:32:55,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f340def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:32:55, skipping insertion in model container [2019-09-10 02:32:55,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:52" (2/3) ... [2019-09-10 02:32:55,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f340def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:32:55, skipping insertion in model container [2019-09-10 02:32:55,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:32:55" (3/3) ... [2019-09-10 02:32:55,992 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product32.cil.c [2019-09-10 02:32:56,003 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:32:56,016 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:32:56,034 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:32:56,082 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:32:56,082 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:32:56,082 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:32:56,082 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:32:56,082 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:32:56,083 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:32:56,083 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:32:56,083 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:32:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states. [2019-09-10 02:32:56,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 02:32:56,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:56,165 INFO L399 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] [2019-09-10 02:32:56,168 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:56,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:56,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2061998394, now seen corresponding path program 1 times [2019-09-10 02:32:56,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:56,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:56,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:56,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:56,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:56,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:56,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:56,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:56,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:56,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:56,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:56,844 INFO L87 Difference]: Start difference. First operand 833 states. Second operand 4 states. [2019-09-10 02:32:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:57,029 INFO L93 Difference]: Finished difference Result 677 states and 1064 transitions. [2019-09-10 02:32:57,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:57,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-10 02:32:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:57,071 INFO L225 Difference]: With dead ends: 677 [2019-09-10 02:32:57,072 INFO L226 Difference]: Without dead ends: 666 [2019-09-10 02:32:57,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:57,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-10 02:32:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-09-10 02:32:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-10 02:32:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1052 transitions. [2019-09-10 02:32:57,191 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1052 transitions. Word has length 85 [2019-09-10 02:32:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:57,192 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1052 transitions. [2019-09-10 02:32:57,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1052 transitions. [2019-09-10 02:32:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 02:32:57,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:57,198 INFO L399 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] [2019-09-10 02:32:57,198 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:57,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:57,199 INFO L82 PathProgramCache]: Analyzing trace with hash 190887692, now seen corresponding path program 1 times [2019-09-10 02:32:57,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:57,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:57,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:57,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:57,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:57,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:57,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:57,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:57,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:57,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:57,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:57,463 INFO L87 Difference]: Start difference. First operand 666 states and 1052 transitions. Second operand 4 states. [2019-09-10 02:32:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:57,560 INFO L93 Difference]: Finished difference Result 668 states and 1053 transitions. [2019-09-10 02:32:57,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:57,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-10 02:32:57,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:57,575 INFO L225 Difference]: With dead ends: 668 [2019-09-10 02:32:57,576 INFO L226 Difference]: Without dead ends: 666 [2019-09-10 02:32:57,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-10 02:32:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-09-10 02:32:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-10 02:32:57,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1051 transitions. [2019-09-10 02:32:57,640 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1051 transitions. Word has length 88 [2019-09-10 02:32:57,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:57,641 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1051 transitions. [2019-09-10 02:32:57,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:57,641 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1051 transitions. [2019-09-10 02:32:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 02:32:57,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:57,647 INFO L399 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] [2019-09-10 02:32:57,647 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:57,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:57,647 INFO L82 PathProgramCache]: Analyzing trace with hash 594585961, now seen corresponding path program 1 times [2019-09-10 02:32:57,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:57,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:57,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:57,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:57,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:57,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:57,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:57,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:57,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:57,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:57,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:57,854 INFO L87 Difference]: Start difference. First operand 666 states and 1051 transitions. Second operand 4 states. [2019-09-10 02:32:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:57,926 INFO L93 Difference]: Finished difference Result 668 states and 1052 transitions. [2019-09-10 02:32:57,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:57,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-10 02:32:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:57,935 INFO L225 Difference]: With dead ends: 668 [2019-09-10 02:32:57,936 INFO L226 Difference]: Without dead ends: 666 [2019-09-10 02:32:57,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-10 02:32:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-09-10 02:32:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-10 02:32:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1050 transitions. [2019-09-10 02:32:58,021 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1050 transitions. Word has length 89 [2019-09-10 02:32:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:58,021 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1050 transitions. [2019-09-10 02:32:58,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:58,022 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1050 transitions. [2019-09-10 02:32:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 02:32:58,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:58,024 INFO L399 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-09-10 02:32:58,024 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:58,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:58,024 INFO L82 PathProgramCache]: Analyzing trace with hash 305679912, now seen corresponding path program 1 times [2019-09-10 02:32:58,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:58,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:58,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:58,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:58,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:58,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:58,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:58,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:58,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:58,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:58,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:58,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:58,181 INFO L87 Difference]: Start difference. First operand 666 states and 1050 transitions. Second operand 4 states. [2019-09-10 02:32:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:58,251 INFO L93 Difference]: Finished difference Result 668 states and 1051 transitions. [2019-09-10 02:32:58,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:58,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-10 02:32:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:58,257 INFO L225 Difference]: With dead ends: 668 [2019-09-10 02:32:58,258 INFO L226 Difference]: Without dead ends: 666 [2019-09-10 02:32:58,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-10 02:32:58,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-09-10 02:32:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-10 02:32:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1049 transitions. [2019-09-10 02:32:58,282 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1049 transitions. Word has length 90 [2019-09-10 02:32:58,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:58,283 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1049 transitions. [2019-09-10 02:32:58,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1049 transitions. [2019-09-10 02:32:58,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 02:32:58,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:58,285 INFO L399 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-09-10 02:32:58,285 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:58,286 INFO L82 PathProgramCache]: Analyzing trace with hash 20876485, now seen corresponding path program 1 times [2019-09-10 02:32:58,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:58,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:58,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:58,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:58,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:58,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:58,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:58,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:58,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:58,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:58,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:58,389 INFO L87 Difference]: Start difference. First operand 666 states and 1049 transitions. Second operand 4 states. [2019-09-10 02:32:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:58,436 INFO L93 Difference]: Finished difference Result 668 states and 1050 transitions. [2019-09-10 02:32:58,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:58,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-10 02:32:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:58,443 INFO L225 Difference]: With dead ends: 668 [2019-09-10 02:32:58,443 INFO L226 Difference]: Without dead ends: 666 [2019-09-10 02:32:58,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-09-10 02:32:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2019-09-10 02:32:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-10 02:32:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1048 transitions. [2019-09-10 02:32:58,467 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1048 transitions. Word has length 91 [2019-09-10 02:32:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:58,467 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 1048 transitions. [2019-09-10 02:32:58,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1048 transitions. [2019-09-10 02:32:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:32:58,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:58,469 INFO L399 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-09-10 02:32:58,470 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:58,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:58,470 INFO L82 PathProgramCache]: Analyzing trace with hash -136745660, now seen corresponding path program 1 times [2019-09-10 02:32:58,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:58,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:58,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:58,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:58,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:58,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:58,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:32:58,662 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:58,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:32:58,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:32:58,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:32:58,663 INFO L87 Difference]: Start difference. First operand 666 states and 1048 transitions. Second operand 10 states. [2019-09-10 02:32:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:58,855 INFO L93 Difference]: Finished difference Result 675 states and 1059 transitions. [2019-09-10 02:32:58,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:32:58,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-10 02:32:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:58,863 INFO L225 Difference]: With dead ends: 675 [2019-09-10 02:32:58,864 INFO L226 Difference]: Without dead ends: 675 [2019-09-10 02:32:58,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:32:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-09-10 02:32:58,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 673. [2019-09-10 02:32:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-09-10 02:32:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1057 transitions. [2019-09-10 02:32:58,901 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1057 transitions. Word has length 92 [2019-09-10 02:32:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:58,902 INFO L475 AbstractCegarLoop]: Abstraction has 673 states and 1057 transitions. [2019-09-10 02:32:58,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:32:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1057 transitions. [2019-09-10 02:32:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 02:32:58,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:58,906 INFO L399 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-09-10 02:32:58,907 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:58,907 INFO L82 PathProgramCache]: Analyzing trace with hash -116408285, now seen corresponding path program 1 times [2019-09-10 02:32:58,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:58,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:58,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:58,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:58,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:59,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:59,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:59,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:59,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:59,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:59,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:59,102 INFO L87 Difference]: Start difference. First operand 673 states and 1057 transitions. Second operand 4 states. [2019-09-10 02:32:59,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:59,167 INFO L93 Difference]: Finished difference Result 671 states and 1052 transitions. [2019-09-10 02:32:59,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:59,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-10 02:32:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:59,180 INFO L225 Difference]: With dead ends: 671 [2019-09-10 02:32:59,180 INFO L226 Difference]: Without dead ends: 660 [2019-09-10 02:32:59,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-09-10 02:32:59,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-09-10 02:32:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-10 02:32:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1034 transitions. [2019-09-10 02:32:59,208 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1034 transitions. Word has length 92 [2019-09-10 02:32:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:59,209 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 1034 transitions. [2019-09-10 02:32:59,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1034 transitions. [2019-09-10 02:32:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 02:32:59,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:59,214 INFO L399 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-09-10 02:32:59,215 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:59,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:59,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1615644955, now seen corresponding path program 1 times [2019-09-10 02:32:59,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:59,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:59,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:59,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:59,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:59,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:59,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:59,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:59,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:59,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:59,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:59,369 INFO L87 Difference]: Start difference. First operand 660 states and 1034 transitions. Second operand 6 states. [2019-09-10 02:32:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:59,613 INFO L93 Difference]: Finished difference Result 663 states and 1037 transitions. [2019-09-10 02:32:59,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:59,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-10 02:32:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:59,624 INFO L225 Difference]: With dead ends: 663 [2019-09-10 02:32:59,624 INFO L226 Difference]: Without dead ends: 660 [2019-09-10 02:32:59,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:32:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-09-10 02:32:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-09-10 02:32:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-10 02:32:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1030 transitions. [2019-09-10 02:32:59,650 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1030 transitions. Word has length 93 [2019-09-10 02:32:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:59,652 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 1030 transitions. [2019-09-10 02:32:59,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1030 transitions. [2019-09-10 02:32:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 02:32:59,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:59,656 INFO L399 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-09-10 02:32:59,656 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash -129454137, now seen corresponding path program 1 times [2019-09-10 02:32:59,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:59,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:59,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:59,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:59,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:59,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:32:59,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:59,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:59,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:59,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:59,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:59,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:59,768 INFO L87 Difference]: Start difference. First operand 660 states and 1030 transitions. Second operand 6 states. [2019-09-10 02:33:00,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:00,075 INFO L93 Difference]: Finished difference Result 663 states and 1033 transitions. [2019-09-10 02:33:00,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:33:00,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-09-10 02:33:00,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:00,081 INFO L225 Difference]: With dead ends: 663 [2019-09-10 02:33:00,082 INFO L226 Difference]: Without dead ends: 660 [2019-09-10 02:33:00,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:33:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-09-10 02:33:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-09-10 02:33:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-10 02:33:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1026 transitions. [2019-09-10 02:33:00,104 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1026 transitions. Word has length 94 [2019-09-10 02:33:00,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:00,104 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 1026 transitions. [2019-09-10 02:33:00,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:33:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1026 transitions. [2019-09-10 02:33:00,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:33:00,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:00,107 INFO L399 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-09-10 02:33:00,107 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:00,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:00,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1340975830, now seen corresponding path program 1 times [2019-09-10 02:33:00,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:00,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:00,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:00,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:00,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:33:00,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:00,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:33:00,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:00,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:33:00,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:33:00,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:33:00,294 INFO L87 Difference]: Start difference. First operand 660 states and 1026 transitions. Second operand 6 states. [2019-09-10 02:33:00,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:00,487 INFO L93 Difference]: Finished difference Result 663 states and 1029 transitions. [2019-09-10 02:33:00,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:33:00,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-10 02:33:00,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:00,493 INFO L225 Difference]: With dead ends: 663 [2019-09-10 02:33:00,493 INFO L226 Difference]: Without dead ends: 660 [2019-09-10 02:33:00,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:33:00,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-09-10 02:33:00,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-09-10 02:33:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-10 02:33:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1022 transitions. [2019-09-10 02:33:00,516 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1022 transitions. Word has length 95 [2019-09-10 02:33:00,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:00,516 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 1022 transitions. [2019-09-10 02:33:00,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:33:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1022 transitions. [2019-09-10 02:33:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 02:33:00,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:00,518 INFO L399 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-09-10 02:33:00,519 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash -293121622, now seen corresponding path program 1 times [2019-09-10 02:33:00,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:00,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:00,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:00,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:00,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:33:00,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:00,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:33:00,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:00,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:33:00,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:33:00,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:33:00,653 INFO L87 Difference]: Start difference. First operand 660 states and 1022 transitions. Second operand 7 states. [2019-09-10 02:33:00,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:00,738 INFO L93 Difference]: Finished difference Result 663 states and 1025 transitions. [2019-09-10 02:33:00,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:33:00,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-10 02:33:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:00,744 INFO L225 Difference]: With dead ends: 663 [2019-09-10 02:33:00,744 INFO L226 Difference]: Without dead ends: 639 [2019-09-10 02:33:00,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:33:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-10 02:33:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-10 02:33:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 02:33:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 988 transitions. [2019-09-10 02:33:00,774 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 988 transitions. Word has length 95 [2019-09-10 02:33:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:00,775 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 988 transitions. [2019-09-10 02:33:00,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:33:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 988 transitions. [2019-09-10 02:33:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 02:33:00,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:00,776 INFO L399 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-09-10 02:33:00,777 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:00,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash -282239444, now seen corresponding path program 1 times [2019-09-10 02:33:00,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:00,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:00,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:00,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:00,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:33:00,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:00,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:33:00,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:00,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:33:00,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:33:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:33:00,926 INFO L87 Difference]: Start difference. First operand 639 states and 988 transitions. Second operand 6 states. [2019-09-10 02:33:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:01,053 INFO L93 Difference]: Finished difference Result 642 states and 991 transitions. [2019-09-10 02:33:01,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:33:01,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-10 02:33:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:01,059 INFO L225 Difference]: With dead ends: 642 [2019-09-10 02:33:01,059 INFO L226 Difference]: Without dead ends: 639 [2019-09-10 02:33:01,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:33:01,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-10 02:33:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-10 02:33:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 02:33:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 987 transitions. [2019-09-10 02:33:01,085 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 987 transitions. Word has length 96 [2019-09-10 02:33:01,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:01,087 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 987 transitions. [2019-09-10 02:33:01,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:33:01,087 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 987 transitions. [2019-09-10 02:33:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 02:33:01,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:01,089 INFO L399 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-09-10 02:33:01,089 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1859946641, now seen corresponding path program 1 times [2019-09-10 02:33:01,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:01,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:01,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:01,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:01,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:33:01,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:01,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:33:01,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:01,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:33:01,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:33:01,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:33:01,233 INFO L87 Difference]: Start difference. First operand 639 states and 987 transitions. Second operand 6 states. [2019-09-10 02:33:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:01,427 INFO L93 Difference]: Finished difference Result 642 states and 990 transitions. [2019-09-10 02:33:01,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:33:01,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-10 02:33:01,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:01,432 INFO L225 Difference]: With dead ends: 642 [2019-09-10 02:33:01,433 INFO L226 Difference]: Without dead ends: 639 [2019-09-10 02:33:01,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:33:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-10 02:33:01,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-10 02:33:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 02:33:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 986 transitions. [2019-09-10 02:33:01,453 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 986 transitions. Word has length 97 [2019-09-10 02:33:01,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:01,454 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 986 transitions. [2019-09-10 02:33:01,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:33:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 986 transitions. [2019-09-10 02:33:01,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 02:33:01,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:01,456 INFO L399 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-09-10 02:33:01,456 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:01,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:01,456 INFO L82 PathProgramCache]: Analyzing trace with hash 731941009, now seen corresponding path program 1 times [2019-09-10 02:33:01,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:01,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:01,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:01,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:01,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 02:33:01,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:01,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:33:01,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:01,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:33:01,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:33:01,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:33:01,635 INFO L87 Difference]: Start difference. First operand 639 states and 986 transitions. Second operand 12 states. [2019-09-10 02:33:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:01,827 INFO L93 Difference]: Finished difference Result 643 states and 989 transitions. [2019-09-10 02:33:01,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:33:01,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-10 02:33:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:01,833 INFO L225 Difference]: With dead ends: 643 [2019-09-10 02:33:01,833 INFO L226 Difference]: Without dead ends: 639 [2019-09-10 02:33:01,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:33:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-10 02:33:01,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-10 02:33:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-10 02:33:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 985 transitions. [2019-09-10 02:33:01,853 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 985 transitions. Word has length 98 [2019-09-10 02:33:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:01,854 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 985 transitions. [2019-09-10 02:33:01,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:33:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 985 transitions. [2019-09-10 02:33:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 02:33:01,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:01,856 INFO L399 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-09-10 02:33:01,856 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:01,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:01,856 INFO L82 PathProgramCache]: Analyzing trace with hash -2083976240, now seen corresponding path program 1 times [2019-09-10 02:33:01,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:01,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:01,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:01,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:01,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:02,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-09-10 02:33:02,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:02,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:33:02,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:02,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:33:02,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:33:02,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:33:02,016 INFO L87 Difference]: Start difference. First operand 639 states and 985 transitions. Second operand 6 states. [2019-09-10 02:33:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:06,530 INFO L93 Difference]: Finished difference Result 1308 states and 2069 transitions. [2019-09-10 02:33:06,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:33:06,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-10 02:33:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:06,541 INFO L225 Difference]: With dead ends: 1308 [2019-09-10 02:33:06,541 INFO L226 Difference]: Without dead ends: 1308 [2019-09-10 02:33:06,542 INFO L628 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-09-10 02:33:06,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-09-10 02:33:06,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1181. [2019-09-10 02:33:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-09-10 02:33:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1867 transitions. [2019-09-10 02:33:06,586 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1867 transitions. Word has length 99 [2019-09-10 02:33:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:06,586 INFO L475 AbstractCegarLoop]: Abstraction has 1181 states and 1867 transitions. [2019-09-10 02:33:06,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:33:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1867 transitions. [2019-09-10 02:33:06,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 02:33:06,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:06,592 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:33:06,593 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:06,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:06,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1126166242, now seen corresponding path program 1 times [2019-09-10 02:33:06,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:06,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:06,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:06,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:06,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 02:33:06,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:06,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:33:06,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:06,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:33:06,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:33:06,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:33:06,826 INFO L87 Difference]: Start difference. First operand 1181 states and 1867 transitions. Second operand 12 states. [2019-09-10 02:33:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:19,704 INFO L93 Difference]: Finished difference Result 2751 states and 4300 transitions. [2019-09-10 02:33:19,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:33:19,705 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2019-09-10 02:33:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:19,721 INFO L225 Difference]: With dead ends: 2751 [2019-09-10 02:33:19,722 INFO L226 Difference]: Without dead ends: 2751 [2019-09-10 02:33:19,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:33:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2019-09-10 02:33:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 2693. [2019-09-10 02:33:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2693 states. [2019-09-10 02:33:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 4220 transitions. [2019-09-10 02:33:19,812 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 4220 transitions. Word has length 157 [2019-09-10 02:33:19,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:19,813 INFO L475 AbstractCegarLoop]: Abstraction has 2693 states and 4220 transitions. [2019-09-10 02:33:19,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:33:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 4220 transitions. [2019-09-10 02:33:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 02:33:19,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:19,818 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:33:19,819 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:19,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:19,819 INFO L82 PathProgramCache]: Analyzing trace with hash -525779042, now seen corresponding path program 1 times [2019-09-10 02:33:19,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:19,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:19,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:19,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:19,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 02:33:20,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:33:20,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:33:20,035 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-09-10 02:33:20,037 INFO L207 CegarAbsIntRunner]: [218], [220], [222], [237], [256], [258], [261], [263], [267], [709], [711], [730], [750], [770], [790], [810], [812], [841], [842], [843], [845], [848], [853], [861], [864], [926], [927], [1009], [1010], [1304], [1305], [1378], [1382], [1385], [1420], [1422], [1423], [1431], [1438], [1440], [1449], [1451], [1464], [1477], [1482], [1483], [1484], [1489], [1569], [1571], [1574], [1576], [1582], [1586], [1587], [1623], [1626], [1631], [1636], [1641], [1646], [1651], [1654], [1770], [1779], [1784], [1787], [1806], [1995], [1999], [2003], [2007], [2011], [2015], [2018], [2020], [2021], [2034], [2037], [2043], [2047], [2274], [2278], [2281], [2299], [2391], [2393], [2490], [2493], [2498], [2501], [2519], [2538], [2539], [2540], [2541], [2570], [2571], [2572], [2573], [2620], [2621], [2632], [2633], [2634], [2635], [2638], [2639], [2640], [2804], [2805], [2806], [2807], [2808], [2809], [2810], [2811], [2812], [2818], [2819], [2824], [2825], [2826], [2827], [2828], [2829], [2844], [2845], [2846], [2847], [2852], [2853], [2860], [2861], [2862], [2863], [2864], [2874], [2875], [2876], [2890], [2891], [2920], [2921], [2922], [2923] [2019-09-10 02:33:20,120 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:33:20,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:33:20,256 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:33:20,258 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 184 root evaluator evaluations with a maximum evaluation depth of 0. Performed 184 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 270 variables. [2019-09-10 02:33:20,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:20,263 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:33:20,351 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:33:20,352 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:33:20,356 INFO L420 sIntCurrentIteration]: We unified 157 AI predicates to 157 [2019-09-10 02:33:20,356 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:33:20,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:33:20,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-09-10 02:33:20,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:20,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:33:20,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:33:20,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:33:20,359 INFO L87 Difference]: Start difference. First operand 2693 states and 4220 transitions. Second operand 2 states. [2019-09-10 02:33:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:20,359 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:33:20,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:33:20,360 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-09-10 02:33:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:20,360 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:33:20,360 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:33:20,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:33:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:33:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:33:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:33:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:33:20,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2019-09-10 02:33:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:20,362 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:33:20,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:33:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:33:20,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:33:20,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:33:20 BoogieIcfgContainer [2019-09-10 02:33:20,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:33:20,370 INFO L168 Benchmark]: Toolchain (without parser) took 28574.93 ms. Allocated memory was 135.8 MB in the beginning and 581.4 MB in the end (delta: 445.6 MB). Free memory was 88.0 MB in the beginning and 247.6 MB in the end (delta: -159.5 MB). Peak memory consumption was 286.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:33:20,371 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 135.8 MB. Free memory was 109.7 MB in the beginning and 109.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:33:20,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1093.01 ms. Allocated memory was 135.8 MB in the beginning and 203.4 MB in the end (delta: 67.6 MB). Free memory was 87.8 MB in the beginning and 137.3 MB in the end (delta: -49.5 MB). Peak memory consumption was 36.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:33:20,373 INFO L168 Benchmark]: Boogie Preprocessor took 248.79 ms. Allocated memory is still 203.4 MB. Free memory was 137.3 MB in the beginning and 127.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:33:20,374 INFO L168 Benchmark]: RCFGBuilder took 2843.78 ms. Allocated memory was 203.4 MB in the beginning and 259.5 MB in the end (delta: 56.1 MB). Free memory was 127.0 MB in the beginning and 123.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 86.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:33:20,375 INFO L168 Benchmark]: TraceAbstraction took 24383.34 ms. Allocated memory was 259.5 MB in the beginning and 581.4 MB in the end (delta: 321.9 MB). Free memory was 123.6 MB in the beginning and 247.6 MB in the end (delta: -124.0 MB). Peak memory consumption was 197.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:33:20,379 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 135.8 MB. Free memory was 109.7 MB in the beginning and 109.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1093.01 ms. Allocated memory was 135.8 MB in the beginning and 203.4 MB in the end (delta: 67.6 MB). Free memory was 87.8 MB in the beginning and 137.3 MB in the end (delta: -49.5 MB). Peak memory consumption was 36.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 248.79 ms. Allocated memory is still 203.4 MB. Free memory was 137.3 MB in the beginning and 127.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2843.78 ms. Allocated memory was 203.4 MB in the beginning and 259.5 MB in the end (delta: 56.1 MB). Free memory was 127.0 MB in the beginning and 123.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 86.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24383.34 ms. Allocated memory was 259.5 MB in the beginning and 581.4 MB in the end (delta: 321.9 MB). Free memory was 123.6 MB in the beginning and 247.6 MB in the end (delta: -124.0 MB). Peak memory consumption was 197.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1886]: 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, 963 locations, 1 error locations. SAFE Result, 24.2s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 19.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16842 SDtfs, 5210 SDslu, 56732 SDs, 0 SdLazy, 17109 SolverSat, 1726 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2693occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.605095541401274 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.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1709 NumberOfCodeBlocks, 1709 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1692 ConstructedInterpolants, 0 QuantifiedInterpolants, 271159 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...