java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:46:24,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:46:24,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:46:24,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:46:24,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:46:24,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:46:24,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:46:24,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:46:24,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:46:24,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:46:24,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:46:24,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:46:24,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:46:24,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:46:24,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:46:24,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:46:24,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:46:24,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:46:24,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:46:24,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:46:24,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:46:24,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:46:24,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:46:24,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:46:24,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:46:24,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:46:24,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:46:24,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:46:24,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:46:24,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:46:24,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:46:24,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:46:24,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:46:24,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:46:24,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:46:24,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:46:24,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:46:24,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:46:24,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:46:24,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:46:24,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:46:24,742 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:46:24,757 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:46:24,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:46:24,758 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:46:24,758 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:46:24,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:46:24,759 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:46:24,760 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:46:24,760 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:46:24,760 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:46:24,760 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:46:24,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:46:24,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:46:24,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:46:24,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:46:24,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:46:24,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:46:24,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:46:24,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:46:24,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:46:24,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:46:24,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:46:24,763 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:46:24,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:46:24,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:46:24,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:46:24,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:46:24,764 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:46:24,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:46:24,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:46:24,765 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:46:24,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:46:24,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:46:24,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:46:24,815 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:46:24,815 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:46:24,816 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product27.cil.c [2019-10-03 02:46:24,884 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d0d48e6/653f138380f74b769d78a9dde5b5c317/FLAG74170529c [2019-10-03 02:46:25,543 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:46:25,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product27.cil.c [2019-10-03 02:46:25,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d0d48e6/653f138380f74b769d78a9dde5b5c317/FLAG74170529c [2019-10-03 02:46:25,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d0d48e6/653f138380f74b769d78a9dde5b5c317 [2019-10-03 02:46:25,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:46:25,757 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:46:25,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:46:25,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:46:25,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:46:25,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:46:25" (1/1) ... [2019-10-03 02:46:25,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671e4bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:25, skipping insertion in model container [2019-10-03 02:46:25,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:46:25" (1/1) ... [2019-10-03 02:46:25,775 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:46:25,848 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:46:26,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:46:26,699 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:46:26,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:46:26,911 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:46:26,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:26 WrapperNode [2019-10-03 02:46:26,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:46:26,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:46:26,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:46:26,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:46:26,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:26" (1/1) ... [2019-10-03 02:46:26,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:26" (1/1) ... [2019-10-03 02:46:26,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:26" (1/1) ... [2019-10-03 02:46:26,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:26" (1/1) ... [2019-10-03 02:46:27,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:26" (1/1) ... [2019-10-03 02:46:27,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:26" (1/1) ... [2019-10-03 02:46:27,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:26" (1/1) ... [2019-10-03 02:46:27,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:46:27,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:46:27,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:46:27,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:46:27,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:46:27,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:46:27,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:46:27,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:46:27,220 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:46:27,220 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:46:27,220 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:46:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:46:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:46:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:46:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:46:27,222 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:46:27,222 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:46:27,223 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:46:27,224 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:46:27,224 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:46:27,225 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:46:27,225 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:46:27,225 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:46:27,226 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:46:27,226 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:46:27,226 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:46:27,226 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:46:27,227 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:46:27,227 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:46:27,227 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:46:27,228 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:46:27,228 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:46:27,228 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:46:27,228 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:46:27,229 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:46:27,229 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:46:27,229 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:46:27,229 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:46:27,229 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:46:27,230 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-03 02:46:27,230 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:46:27,230 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:46:27,230 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:46:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:46:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:46:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:46:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:46:27,232 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:46:27,232 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:46:27,232 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:46:27,232 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:46:27,232 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:46:27,233 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:46:27,233 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:46:27,233 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:46:27,233 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:46:27,233 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:46:27,234 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:46:27,234 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:46:27,234 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:46:27,234 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:46:27,234 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:46:27,235 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:46:27,235 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:46:27,235 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:46:27,235 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:46:27,235 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:46:27,235 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:46:27,236 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:46:27,237 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:46:27,237 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:46:27,237 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:46:27,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:46:27,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-03 02:46:27,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-03 02:46:27,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-03 02:46:27,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-03 02:46:27,239 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:46:27,240 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:46:27,240 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:46:27,240 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:46:27,241 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:46:27,241 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:46:27,241 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:46:27,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:46:27,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:46:27,243 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:46:27,243 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:46:27,243 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:46:27,244 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:46:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:46:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:46:27,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:46:27,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:46:27,246 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:46:27,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:46:27,246 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:46:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:46:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:46:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:46:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:46:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:46:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:46:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:46:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:46:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:46:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:46:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:46:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:46:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:46:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:46:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:46:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:46:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:46:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:46:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:46:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:46:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:46:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:46:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:46:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:46:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:46:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:46:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:46:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:46:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:46:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:46:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:46:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:46:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-03 02:46:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-03 02:46:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:46:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:46:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:46:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:46:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:46:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:46:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:46:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:46:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:46:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:46:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:46:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:46:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:46:27,264 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:46:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:46:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:46:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:46:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:46:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:46:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:46:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:46:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:46:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:46:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:46:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:46:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-03 02:46:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:46:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-03 02:46:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:46:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:46:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:46:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:46:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:46:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:46:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:46:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:46:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:46:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:46:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:46:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-03 02:46:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:46:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:46:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:46:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:46:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:46:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:46:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:46:29,911 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:46:29,911 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:46:29,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:46:29 BoogieIcfgContainer [2019-10-03 02:46:29,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:46:29,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:46:29,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:46:29,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:46:29,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:46:25" (1/3) ... [2019-10-03 02:46:29,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ddf186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:46:29, skipping insertion in model container [2019-10-03 02:46:29,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:46:26" (2/3) ... [2019-10-03 02:46:29,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ddf186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:46:29, skipping insertion in model container [2019-10-03 02:46:29,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:46:29" (3/3) ... [2019-10-03 02:46:29,922 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product27.cil.c [2019-10-03 02:46:29,934 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:46:29,944 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:46:29,964 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:46:29,995 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:46:29,995 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:46:29,995 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:46:29,996 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:46:29,996 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:46:29,996 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:46:29,996 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:46:29,996 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:46:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states. [2019-10-03 02:46:30,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 02:46:30,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:30,085 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:30,088 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:30,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:30,094 INFO L82 PathProgramCache]: Analyzing trace with hash 18579608, now seen corresponding path program 1 times [2019-10-03 02:46:30,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:30,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:30,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:30,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:30,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:30,809 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:46:30,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:30,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:30,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:30,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:30,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:30,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:30,841 INFO L87 Difference]: Start difference. First operand 777 states. Second operand 4 states. [2019-10-03 02:46:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:30,984 INFO L93 Difference]: Finished difference Result 628 states and 993 transitions. [2019-10-03 02:46:30,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:30,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-03 02:46:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:31,025 INFO L225 Difference]: With dead ends: 628 [2019-10-03 02:46:31,025 INFO L226 Difference]: Without dead ends: 617 [2019-10-03 02:46:31,027 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-03 02:46:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-03 02:46:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-03 02:46:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 981 transitions. [2019-10-03 02:46:31,139 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 981 transitions. Word has length 135 [2019-10-03 02:46:31,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:31,139 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 981 transitions. [2019-10-03 02:46:31,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 981 transitions. [2019-10-03 02:46:31,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 02:46:31,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:31,151 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:31,151 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:31,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:31,152 INFO L82 PathProgramCache]: Analyzing trace with hash -270965621, now seen corresponding path program 1 times [2019-10-03 02:46:31,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:31,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:31,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:31,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:31,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:46:31,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:31,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:31,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:31,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:31,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:31,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:31,423 INFO L87 Difference]: Start difference. First operand 617 states and 981 transitions. Second operand 4 states. [2019-10-03 02:46:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:31,495 INFO L93 Difference]: Finished difference Result 619 states and 982 transitions. [2019-10-03 02:46:31,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:31,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-03 02:46:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:31,503 INFO L225 Difference]: With dead ends: 619 [2019-10-03 02:46:31,503 INFO L226 Difference]: Without dead ends: 617 [2019-10-03 02:46:31,504 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:31,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-03 02:46:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-03 02:46:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-03 02:46:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 980 transitions. [2019-10-03 02:46:31,545 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 980 transitions. Word has length 138 [2019-10-03 02:46:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:31,546 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 980 transitions. [2019-10-03 02:46:31,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:31,546 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 980 transitions. [2019-10-03 02:46:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 02:46:31,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:31,554 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:31,555 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:31,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:31,555 INFO L82 PathProgramCache]: Analyzing trace with hash 932085763, now seen corresponding path program 1 times [2019-10-03 02:46:31,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:31,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:31,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:31,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:31,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:46:31,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:31,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:31,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:31,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:31,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:31,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:31,769 INFO L87 Difference]: Start difference. First operand 617 states and 980 transitions. Second operand 4 states. [2019-10-03 02:46:31,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:31,833 INFO L93 Difference]: Finished difference Result 619 states and 981 transitions. [2019-10-03 02:46:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:31,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-03 02:46:31,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:31,845 INFO L225 Difference]: With dead ends: 619 [2019-10-03 02:46:31,845 INFO L226 Difference]: Without dead ends: 617 [2019-10-03 02:46:31,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-03 02:46:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-03 02:46:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-03 02:46:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 979 transitions. [2019-10-03 02:46:31,880 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 979 transitions. Word has length 139 [2019-10-03 02:46:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:31,880 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 979 transitions. [2019-10-03 02:46:31,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 979 transitions. [2019-10-03 02:46:31,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:46:31,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:31,886 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:31,887 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:31,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:31,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1674590201, now seen corresponding path program 1 times [2019-10-03 02:46:31,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:31,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:31,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:31,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:31,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:46:32,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:32,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:32,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:32,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:32,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:32,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:32,056 INFO L87 Difference]: Start difference. First operand 617 states and 979 transitions. Second operand 4 states. [2019-10-03 02:46:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:32,127 INFO L93 Difference]: Finished difference Result 619 states and 980 transitions. [2019-10-03 02:46:32,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:32,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-03 02:46:32,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:32,136 INFO L225 Difference]: With dead ends: 619 [2019-10-03 02:46:32,136 INFO L226 Difference]: Without dead ends: 617 [2019-10-03 02:46:32,136 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-03 02:46:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-03 02:46:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-03 02:46:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 978 transitions. [2019-10-03 02:46:32,171 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 978 transitions. Word has length 140 [2019-10-03 02:46:32,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:32,174 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 978 transitions. [2019-10-03 02:46:32,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 978 transitions. [2019-10-03 02:46:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 02:46:32,182 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:32,182 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:32,184 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:32,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:32,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2123729665, now seen corresponding path program 1 times [2019-10-03 02:46:32,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:32,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:32,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:32,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:32,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:46:32,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:32,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:32,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:32,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:32,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:32,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:32,388 INFO L87 Difference]: Start difference. First operand 617 states and 978 transitions. Second operand 4 states. [2019-10-03 02:46:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:32,504 INFO L93 Difference]: Finished difference Result 619 states and 979 transitions. [2019-10-03 02:46:32,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:32,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-10-03 02:46:32,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:32,510 INFO L225 Difference]: With dead ends: 619 [2019-10-03 02:46:32,511 INFO L226 Difference]: Without dead ends: 617 [2019-10-03 02:46:32,511 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-03 02:46:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-03 02:46:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-03 02:46:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 977 transitions. [2019-10-03 02:46:32,545 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 977 transitions. Word has length 141 [2019-10-03 02:46:32,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:32,545 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 977 transitions. [2019-10-03 02:46:32,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 977 transitions. [2019-10-03 02:46:32,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 02:46:32,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:32,550 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:32,550 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:32,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:32,551 INFO L82 PathProgramCache]: Analyzing trace with hash -113747069, now seen corresponding path program 1 times [2019-10-03 02:46:32,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:32,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:32,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:32,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:32,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:46:32,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:32,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:46:32,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:32,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:46:32,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:46:32,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:46:32,823 INFO L87 Difference]: Start difference. First operand 617 states and 977 transitions. Second operand 10 states. [2019-10-03 02:46:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:33,005 INFO L93 Difference]: Finished difference Result 626 states and 988 transitions. [2019-10-03 02:46:33,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:46:33,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2019-10-03 02:46:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:33,011 INFO L225 Difference]: With dead ends: 626 [2019-10-03 02:46:33,011 INFO L226 Difference]: Without dead ends: 626 [2019-10-03 02:46:33,013 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:46:33,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-03 02:46:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2019-10-03 02:46:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-03 02:46:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 986 transitions. [2019-10-03 02:46:33,066 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 986 transitions. Word has length 142 [2019-10-03 02:46:33,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:33,068 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 986 transitions. [2019-10-03 02:46:33,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:46:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 986 transitions. [2019-10-03 02:46:33,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 02:46:33,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:33,076 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:33,076 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:33,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:33,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1722095778, now seen corresponding path program 1 times [2019-10-03 02:46:33,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:33,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:33,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:33,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:33,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:46:33,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:33,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:46:33,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:33,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:46:33,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:46:33,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:46:33,205 INFO L87 Difference]: Start difference. First operand 624 states and 986 transitions. Second operand 4 states. [2019-10-03 02:46:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:33,253 INFO L93 Difference]: Finished difference Result 622 states and 981 transitions. [2019-10-03 02:46:33,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:46:33,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-03 02:46:33,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:33,260 INFO L225 Difference]: With dead ends: 622 [2019-10-03 02:46:33,260 INFO L226 Difference]: Without dead ends: 611 [2019-10-03 02:46:33,261 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:46:33,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-03 02:46:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-03 02:46:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-03 02:46:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 963 transitions. [2019-10-03 02:46:33,287 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 963 transitions. Word has length 142 [2019-10-03 02:46:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:33,287 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 963 transitions. [2019-10-03 02:46:33,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:46:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 963 transitions. [2019-10-03 02:46:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:46:33,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:33,293 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:33,293 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:33,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1252309947, now seen corresponding path program 1 times [2019-10-03 02:46:33,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:33,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:33,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:33,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:33,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:46:33,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:33,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:33,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:33,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:33,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:33,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:33,528 INFO L87 Difference]: Start difference. First operand 611 states and 963 transitions. Second operand 6 states. [2019-10-03 02:46:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:33,753 INFO L93 Difference]: Finished difference Result 614 states and 966 transitions. [2019-10-03 02:46:33,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:33,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-03 02:46:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:33,759 INFO L225 Difference]: With dead ends: 614 [2019-10-03 02:46:33,759 INFO L226 Difference]: Without dead ends: 611 [2019-10-03 02:46:33,760 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-03 02:46:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-03 02:46:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-03 02:46:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 959 transitions. [2019-10-03 02:46:33,786 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 959 transitions. Word has length 143 [2019-10-03 02:46:33,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:33,787 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 959 transitions. [2019-10-03 02:46:33,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 959 transitions. [2019-10-03 02:46:33,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-03 02:46:33,792 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:33,792 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:33,792 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:33,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash -320376282, now seen corresponding path program 1 times [2019-10-03 02:46:33,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:33,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:33,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:33,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:33,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:46:34,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:34,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:34,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:34,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:34,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:34,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:34,013 INFO L87 Difference]: Start difference. First operand 611 states and 959 transitions. Second operand 6 states. [2019-10-03 02:46:34,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:34,240 INFO L93 Difference]: Finished difference Result 614 states and 962 transitions. [2019-10-03 02:46:34,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:34,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-03 02:46:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:34,246 INFO L225 Difference]: With dead ends: 614 [2019-10-03 02:46:34,246 INFO L226 Difference]: Without dead ends: 611 [2019-10-03 02:46:34,247 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-03 02:46:34,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-03 02:46:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-03 02:46:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 955 transitions. [2019-10-03 02:46:34,269 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 955 transitions. Word has length 144 [2019-10-03 02:46:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:34,270 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 955 transitions. [2019-10-03 02:46:34,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:34,270 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 955 transitions. [2019-10-03 02:46:34,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 02:46:34,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:34,276 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:34,276 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:34,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:34,277 INFO L82 PathProgramCache]: Analyzing trace with hash 748593120, now seen corresponding path program 1 times [2019-10-03 02:46:34,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:34,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:34,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:34,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:34,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:46:34,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:34,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:34,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:34,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:34,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:34,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:34,517 INFO L87 Difference]: Start difference. First operand 611 states and 955 transitions. Second operand 6 states. [2019-10-03 02:46:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:34,713 INFO L93 Difference]: Finished difference Result 614 states and 958 transitions. [2019-10-03 02:46:34,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:34,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-03 02:46:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:34,719 INFO L225 Difference]: With dead ends: 614 [2019-10-03 02:46:34,719 INFO L226 Difference]: Without dead ends: 611 [2019-10-03 02:46:34,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-03 02:46:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-03 02:46:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-03 02:46:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 951 transitions. [2019-10-03 02:46:34,743 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 951 transitions. Word has length 145 [2019-10-03 02:46:34,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:34,744 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 951 transitions. [2019-10-03 02:46:34,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 951 transitions. [2019-10-03 02:46:34,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 02:46:34,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:34,749 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:34,750 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:34,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:34,750 INFO L82 PathProgramCache]: Analyzing trace with hash 485194848, now seen corresponding path program 1 times [2019-10-03 02:46:34,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:34,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:34,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:46:34,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:34,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:46:34,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:34,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:46:34,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:46:34,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:46:34,918 INFO L87 Difference]: Start difference. First operand 611 states and 951 transitions. Second operand 7 states. [2019-10-03 02:46:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:35,018 INFO L93 Difference]: Finished difference Result 614 states and 954 transitions. [2019-10-03 02:46:35,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:46:35,019 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-03 02:46:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:35,024 INFO L225 Difference]: With dead ends: 614 [2019-10-03 02:46:35,024 INFO L226 Difference]: Without dead ends: 590 [2019-10-03 02:46:35,025 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:35,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-03 02:46:35,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-03 02:46:35,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-03 02:46:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 917 transitions. [2019-10-03 02:46:35,046 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 917 transitions. Word has length 145 [2019-10-03 02:46:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:35,047 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 917 transitions. [2019-10-03 02:46:35,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:46:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 917 transitions. [2019-10-03 02:46:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-03 02:46:35,051 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:35,051 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:35,052 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:35,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:35,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2104508459, now seen corresponding path program 1 times [2019-10-03 02:46:35,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:35,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:35,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:35,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:35,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:46:35,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:35,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:35,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:35,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:35,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:35,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:35,206 INFO L87 Difference]: Start difference. First operand 590 states and 917 transitions. Second operand 6 states. [2019-10-03 02:46:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:35,313 INFO L93 Difference]: Finished difference Result 593 states and 920 transitions. [2019-10-03 02:46:35,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:35,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-03 02:46:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:35,319 INFO L225 Difference]: With dead ends: 593 [2019-10-03 02:46:35,320 INFO L226 Difference]: Without dead ends: 590 [2019-10-03 02:46:35,320 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-03 02:46:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-03 02:46:35,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-03 02:46:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 916 transitions. [2019-10-03 02:46:35,349 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 916 transitions. Word has length 146 [2019-10-03 02:46:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:35,350 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 916 transitions. [2019-10-03 02:46:35,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 916 transitions. [2019-10-03 02:46:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 02:46:35,355 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:35,355 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:35,355 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:35,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:35,356 INFO L82 PathProgramCache]: Analyzing trace with hash -529154043, now seen corresponding path program 1 times [2019-10-03 02:46:35,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:35,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:35,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:35,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:35,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:46:35,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:35,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:46:35,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:35,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:46:35,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:46:35,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:46:35,620 INFO L87 Difference]: Start difference. First operand 590 states and 916 transitions. Second operand 6 states. [2019-10-03 02:46:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:35,720 INFO L93 Difference]: Finished difference Result 593 states and 919 transitions. [2019-10-03 02:46:35,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:46:35,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-10-03 02:46:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:35,726 INFO L225 Difference]: With dead ends: 593 [2019-10-03 02:46:35,726 INFO L226 Difference]: Without dead ends: 590 [2019-10-03 02:46:35,726 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:46:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-03 02:46:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-03 02:46:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-03 02:46:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 915 transitions. [2019-10-03 02:46:35,745 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 915 transitions. Word has length 147 [2019-10-03 02:46:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:35,746 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 915 transitions. [2019-10-03 02:46:35,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:46:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 915 transitions. [2019-10-03 02:46:35,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 02:46:35,750 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:35,750 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:35,751 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:35,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:35,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2009289264, now seen corresponding path program 1 times [2019-10-03 02:46:35,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:35,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:35,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:35,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:46:35,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:46:35,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:46:35,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:35,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:46:35,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:46:35,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:46:35,976 INFO L87 Difference]: Start difference. First operand 590 states and 915 transitions. Second operand 12 states. [2019-10-03 02:46:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:36,209 INFO L93 Difference]: Finished difference Result 594 states and 918 transitions. [2019-10-03 02:46:36,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:46:36,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2019-10-03 02:46:36,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:36,217 INFO L225 Difference]: With dead ends: 594 [2019-10-03 02:46:36,217 INFO L226 Difference]: Without dead ends: 590 [2019-10-03 02:46:36,220 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:46:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-03 02:46:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-03 02:46:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-03 02:46:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 914 transitions. [2019-10-03 02:46:36,247 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 914 transitions. Word has length 148 [2019-10-03 02:46:36,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:36,248 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 914 transitions. [2019-10-03 02:46:36,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:46:36,248 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 914 transitions. [2019-10-03 02:46:36,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-03 02:46:36,260 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:46:36,260 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:46:36,261 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:46:36,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:36,262 INFO L82 PathProgramCache]: Analyzing trace with hash -650692984, now seen corresponding path program 1 times [2019-10-03 02:46:36,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:46:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:36,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:46:36,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:46:36,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:46:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:46:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-03 02:46:36,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:46:36,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:46:36,428 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2019-10-03 02:46:36,431 INFO L207 CegarAbsIntRunner]: [60], [61], [140], [144], [147], [343], [345], [347], [384], [385], [387], [388], [389], [391], [394], [396], [400], [456], [856], [858], [955], [960], [963], [966], [985], [986], [988], [997], [999], [1012], [1025], [1032], [1037], [1070], [1072], [1074], [1077], [1148], [1151], [1181], [1182], [1245], [1246], [1292], [1294], [1297], [1299], [1305], [1309], [1310], [1346], [1349], [1354], [1359], [1364], [1369], [1374], [1377], [1493], [1550], [1555], [1558], [1577], [1762], [1766], [1770], [1774], [1778], [1782], [1785], [1787], [1803], [1816], [1819], [1825], [1829], [1830], [1833], [1855], [1927], [1928], [2288], [2292], [2295], [2313], [2482], [2483], [2484], [2485], [2486], [2487], [2488], [2489], [2490], [2504], [2505], [2506], [2507], [2528], [2529], [2530], [2531], [2532], [2533], [2540], [2541], [2542], [2543], [2588], [2589], [2618], [2619], [2620], [2621], [2632], [2633], [2634], [2635], [2650], [2651], [2652], [2653], [2656], [2672], [2673], [2674], [2675], [2680], [2681], [2708], [2709], [2710], [2711], [2712], [2748], [2749], [2750] [2019-10-03 02:46:36,494 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:46:36,495 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:46:36,601 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:46:36,602 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 137 root evaluator evaluations with a maximum evaluation depth of 0. Performed 137 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 264 variables. [2019-10-03 02:46:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:46:36,608 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:46:36,706 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:46:36,706 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:46:36,718 INFO L420 sIntCurrentIteration]: We unified 148 AI predicates to 148 [2019-10-03 02:46:36,719 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:46:36,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:46:36,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-03 02:46:36,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:46:36,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:46:36,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:46:36,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:46:36,721 INFO L87 Difference]: Start difference. First operand 590 states and 914 transitions. Second operand 2 states. [2019-10-03 02:46:36,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:46:36,722 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:46:36,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:46:36,722 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 149 [2019-10-03 02:46:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:46:36,722 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:46:36,723 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:46:36,725 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:46:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:46:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:46:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:46:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:46:36,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 149 [2019-10-03 02:46:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:46:36,726 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:46:36,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:46:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:46:36,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:46:36,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:46:36 BoogieIcfgContainer [2019-10-03 02:46:36,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:46:36,736 INFO L168 Benchmark]: Toolchain (without parser) took 10977.90 ms. Allocated memory was 136.8 MB in the beginning and 432.5 MB in the end (delta: 295.7 MB). Free memory was 90.2 MB in the beginning and 109.0 MB in the end (delta: -18.8 MB). Peak memory consumption was 276.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:36,738 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 136.8 MB. Free memory was 111.1 MB in the beginning and 110.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:46:36,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1154.89 ms. Allocated memory was 136.8 MB in the beginning and 203.4 MB in the end (delta: 66.6 MB). Free memory was 90.0 MB in the beginning and 141.3 MB in the end (delta: -51.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:36,745 INFO L168 Benchmark]: Boogie Preprocessor took 184.35 ms. Allocated memory is still 203.4 MB. Free memory was 141.3 MB in the beginning and 131.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:36,746 INFO L168 Benchmark]: RCFGBuilder took 2815.95 ms. Allocated memory was 203.4 MB in the beginning and 255.3 MB in the end (delta: 51.9 MB). Free memory was 131.8 MB in the beginning and 125.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 91.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:36,747 INFO L168 Benchmark]: TraceAbstraction took 6818.13 ms. Allocated memory was 255.3 MB in the beginning and 432.5 MB in the end (delta: 177.2 MB). Free memory was 125.0 MB in the beginning and 109.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 193.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:46:36,760 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.25 ms. Allocated memory is still 136.8 MB. Free memory was 111.1 MB in the beginning and 110.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1154.89 ms. Allocated memory was 136.8 MB in the beginning and 203.4 MB in the end (delta: 66.6 MB). Free memory was 90.0 MB in the beginning and 141.3 MB in the end (delta: -51.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 184.35 ms. Allocated memory is still 203.4 MB. Free memory was 141.3 MB in the beginning and 131.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2815.95 ms. Allocated memory was 203.4 MB in the beginning and 255.3 MB in the end (delta: 51.9 MB). Free memory was 131.8 MB in the beginning and 125.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 91.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6818.13 ms. Allocated memory was 255.3 MB in the beginning and 432.5 MB in the end (delta: 177.2 MB). Free memory was 125.0 MB in the beginning and 109.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 193.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3100]: 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 79 procedures, 915 locations, 1 error locations. SAFE Result, 6.7s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13153 SDtfs, 441 SDslu, 50828 SDs, 0 SdLazy, 1264 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=777occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.6891891891891893 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2144 NumberOfCodeBlocks, 2144 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2129 ConstructedInterpolants, 0 QuantifiedInterpolants, 365965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 264/270 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...