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_spec14_product27.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:39:45,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:39:45,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:39:45,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:39:45,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:39:45,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:39:45,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:39:45,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:39:45,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:39:45,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:39:45,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:39:45,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:39:45,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:39:45,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:39:45,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:39:45,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:39:45,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:39:45,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:39:45,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:39:45,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:39:45,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:39:45,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:39:45,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:39:45,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:39:45,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:39:45,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:39:45,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:39:45,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:39:45,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:39:45,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:39:45,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:39:45,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:39:45,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:39:45,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:39:45,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:39:45,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:39:45,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:39:45,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:39:45,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:39:45,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:39:45,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:39:45,538 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:39:45,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:39:45,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:39:45,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:39:45,554 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:39:45,555 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:39:45,555 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:39:45,555 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:39:45,555 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:39:45,556 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:39:45,556 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:39:45,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:39:45,557 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:39:45,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:39:45,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:39:45,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:39:45,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:39:45,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:39:45,558 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:39:45,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:39:45,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:39:45,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:39:45,559 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:39:45,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:39:45,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:39:45,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:39:45,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:39:45,560 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:39:45,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:39:45,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:39:45,560 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:39:45,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:39:45,613 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:39:45,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:39:45,622 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:39:45,623 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:39:45,625 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product27.cil.c [2019-10-03 02:39:45,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627b7d74a/b97c93d29cdc42fdad6979cadc921483/FLAGfe7866446 [2019-10-03 02:39:46,314 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:39:46,316 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product27.cil.c [2019-10-03 02:39:46,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627b7d74a/b97c93d29cdc42fdad6979cadc921483/FLAGfe7866446 [2019-10-03 02:39:46,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627b7d74a/b97c93d29cdc42fdad6979cadc921483 [2019-10-03 02:39:46,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:39:46,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:39:46,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:39:46,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:39:46,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:39:46,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:39:46" (1/1) ... [2019-10-03 02:39:46,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4771d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:46, skipping insertion in model container [2019-10-03 02:39:46,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:39:46" (1/1) ... [2019-10-03 02:39:46,688 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:39:46,762 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:39:47,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:39:47,536 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:39:47,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:39:47,780 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:39:47,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:47 WrapperNode [2019-10-03 02:39:47,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:39:47,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:39:47,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:39:47,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:39:47,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:47" (1/1) ... [2019-10-03 02:39:47,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:47" (1/1) ... [2019-10-03 02:39:47,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:47" (1/1) ... [2019-10-03 02:39:47,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:47" (1/1) ... [2019-10-03 02:39:47,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:47" (1/1) ... [2019-10-03 02:39:48,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:47" (1/1) ... [2019-10-03 02:39:48,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:47" (1/1) ... [2019-10-03 02:39:48,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:39:48,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:39:48,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:39:48,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:39:48,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:47" (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:39:48,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:39:48,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:39:48,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:39:48,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:39:48,185 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:39:48,185 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:39:48,185 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:39:48,186 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:39:48,186 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:39:48,186 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:39:48,187 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-03 02:39:48,188 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:39:48,188 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:39:48,189 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:39:48,189 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:39:48,190 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:39:48,191 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:39:48,192 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:39:48,193 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:39:48,193 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:39:48,193 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:39:48,193 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:39:48,194 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:39:48,194 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:39:48,195 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:39:48,195 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:39:48,195 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:39:48,196 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:39:48,196 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:39:48,197 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:39:48,197 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:39:48,197 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:39:48,197 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:39:48,198 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:39:48,198 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:39:48,198 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:39:48,198 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:39:48,198 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:39:48,199 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:39:48,199 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:39:48,199 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:39:48,199 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:39:48,200 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:39:48,200 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:39:48,201 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:39:48,201 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:39:48,201 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:39:48,202 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:39:48,202 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:39:48,202 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:39:48,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:39:48,203 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:39:48,203 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:39:48,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:39:48,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:39:48,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:39:48,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:39:48,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:39:48,204 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:39:48,205 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:39:48,205 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:39:48,205 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:39:48,205 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:39:48,205 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:39:48,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-03 02:39:48,206 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:39:48,207 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:39:48,207 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:39:48,207 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:39:48,207 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:39:48,208 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:39:48,208 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:39:48,208 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:39:48,209 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:39:48,209 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:39:48,210 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:39:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:39:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:39:48,210 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:39:48,211 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:39:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:39:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:39:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:39:48,212 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:39:48,213 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:39:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:39:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:39:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:39:48,215 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:39:48,215 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:39:48,215 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:39:48,215 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:39:48,215 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:39:48,215 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:39:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:39:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:39:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:39:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:39:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:39:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:39:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:39:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:39:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:39:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:39:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-03 02:39:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:39:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:39:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:39:48,219 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:39:48,219 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:39:48,219 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-03 02:39:48,220 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:39:48,220 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:39:48,220 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-03 02:39:48,220 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:39:48,220 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:39:48,221 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:39:48,221 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-03 02:39:48,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:39:48,221 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:39:48,221 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:39:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:39:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:39:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:39:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:39:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:39:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:39:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:39:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:39:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:39:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:39:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:39:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:39:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:39:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:39:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:39:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:39:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:39:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:39:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:39:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:39:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:39:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:39:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:39:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:39:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:39:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:39:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:39:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:39:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:39:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:39:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:39:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:39:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:39:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:39:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:39:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:39:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:39:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:39:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:39:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:39:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:39:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:39:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:39:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:39:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:39:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:39:50,685 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:39:50,685 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:39:50,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:50 BoogieIcfgContainer [2019-10-03 02:39:50,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:39:50,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:39:50,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:39:50,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:39:50,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:39:46" (1/3) ... [2019-10-03 02:39:50,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46867315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:50, skipping insertion in model container [2019-10-03 02:39:50,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:47" (2/3) ... [2019-10-03 02:39:50,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46867315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:50, skipping insertion in model container [2019-10-03 02:39:50,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:50" (3/3) ... [2019-10-03 02:39:50,697 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product27.cil.c [2019-10-03 02:39:50,712 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:39:50,723 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:39:50,744 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:39:50,783 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:39:50,784 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:39:50,784 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:39:50,784 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:39:50,784 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:39:50,785 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:39:50,785 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:39:50,785 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:39:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states. [2019-10-03 02:39:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 02:39:50,858 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:50,859 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:50,862 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:50,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:50,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1973380872, now seen corresponding path program 1 times [2019-10-03 02:39:50,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:50,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:50,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:50,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:50,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:51,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:51,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:51,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:51,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:51,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:51,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:51,664 INFO L87 Difference]: Start difference. First operand 751 states. Second operand 4 states. [2019-10-03 02:39:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:51,841 INFO L93 Difference]: Finished difference Result 614 states and 965 transitions. [2019-10-03 02:39:51,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:39:51,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-03 02:39:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:51,867 INFO L225 Difference]: With dead ends: 614 [2019-10-03 02:39:51,867 INFO L226 Difference]: Without dead ends: 603 [2019-10-03 02:39:51,869 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:39:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-03 02:39:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-03 02:39:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-03 02:39:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 951 transitions. [2019-10-03 02:39:52,028 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 951 transitions. Word has length 135 [2019-10-03 02:39:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:52,028 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 951 transitions. [2019-10-03 02:39:52,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:52,029 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 951 transitions. [2019-10-03 02:39:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-03 02:39:52,040 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:52,040 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:52,041 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:52,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:52,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1520755359, now seen corresponding path program 1 times [2019-10-03 02:39:52,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:52,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:52,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:52,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:52,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:52,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:52,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:52,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:52,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:52,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:52,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:52,248 INFO L87 Difference]: Start difference. First operand 603 states and 951 transitions. Second operand 4 states. [2019-10-03 02:39:52,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:52,327 INFO L93 Difference]: Finished difference Result 605 states and 952 transitions. [2019-10-03 02:39:52,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:52,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-03 02:39:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:52,334 INFO L225 Difference]: With dead ends: 605 [2019-10-03 02:39:52,334 INFO L226 Difference]: Without dead ends: 603 [2019-10-03 02:39:52,335 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:39:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-03 02:39:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-03 02:39:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-03 02:39:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 950 transitions. [2019-10-03 02:39:52,366 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 950 transitions. Word has length 136 [2019-10-03 02:39:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:52,366 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 950 transitions. [2019-10-03 02:39:52,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 950 transitions. [2019-10-03 02:39:52,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-03 02:39:52,371 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:52,372 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:52,372 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:52,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:52,372 INFO L82 PathProgramCache]: Analyzing trace with hash -25629804, now seen corresponding path program 1 times [2019-10-03 02:39:52,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:52,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:52,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:52,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:52,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:52,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:52,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:52,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:52,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:52,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:52,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:52,502 INFO L87 Difference]: Start difference. First operand 603 states and 950 transitions. Second operand 4 states. [2019-10-03 02:39:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:52,563 INFO L93 Difference]: Finished difference Result 605 states and 951 transitions. [2019-10-03 02:39:52,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:52,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-03 02:39:52,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:52,568 INFO L225 Difference]: With dead ends: 605 [2019-10-03 02:39:52,568 INFO L226 Difference]: Without dead ends: 603 [2019-10-03 02:39:52,569 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:39:52,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-03 02:39:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-03 02:39:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-03 02:39:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 949 transitions. [2019-10-03 02:39:52,593 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 949 transitions. Word has length 137 [2019-10-03 02:39:52,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:52,594 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 949 transitions. [2019-10-03 02:39:52,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 949 transitions. [2019-10-03 02:39:52,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 02:39:52,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:52,598 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:52,599 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:52,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:52,599 INFO L82 PathProgramCache]: Analyzing trace with hash -572741315, now seen corresponding path program 1 times [2019-10-03 02:39:52,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:52,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:52,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:52,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:52,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:52,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:52,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:52,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:52,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:52,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:52,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:52,842 INFO L87 Difference]: Start difference. First operand 603 states and 949 transitions. Second operand 4 states. [2019-10-03 02:39:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:52,894 INFO L93 Difference]: Finished difference Result 605 states and 950 transitions. [2019-10-03 02:39:52,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:52,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-03 02:39:52,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:52,900 INFO L225 Difference]: With dead ends: 605 [2019-10-03 02:39:52,900 INFO L226 Difference]: Without dead ends: 603 [2019-10-03 02:39:52,900 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:39:52,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-03 02:39:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-03 02:39:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-03 02:39:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 948 transitions. [2019-10-03 02:39:52,923 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 948 transitions. Word has length 138 [2019-10-03 02:39:52,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:52,924 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 948 transitions. [2019-10-03 02:39:52,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 948 transitions. [2019-10-03 02:39:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 02:39:52,928 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:52,928 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:52,929 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:52,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:52,929 INFO L82 PathProgramCache]: Analyzing trace with hash -4692432, now seen corresponding path program 1 times [2019-10-03 02:39:52,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:52,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:52,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:52,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:52,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:53,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:53,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:53,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:53,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:53,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:53,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:53,075 INFO L87 Difference]: Start difference. First operand 603 states and 948 transitions. Second operand 4 states. [2019-10-03 02:39:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:53,128 INFO L93 Difference]: Finished difference Result 605 states and 949 transitions. [2019-10-03 02:39:53,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:53,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-03 02:39:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:53,139 INFO L225 Difference]: With dead ends: 605 [2019-10-03 02:39:53,139 INFO L226 Difference]: Without dead ends: 603 [2019-10-03 02:39:53,139 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:39:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-03 02:39:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-03 02:39:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-03 02:39:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 947 transitions. [2019-10-03 02:39:53,162 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 947 transitions. Word has length 139 [2019-10-03 02:39:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:53,164 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 947 transitions. [2019-10-03 02:39:53,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 947 transitions. [2019-10-03 02:39:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:39:53,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:53,168 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:53,169 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:53,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:53,169 INFO L82 PathProgramCache]: Analyzing trace with hash 773590297, now seen corresponding path program 1 times [2019-10-03 02:39:53,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:53,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:53,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:53,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:53,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:53,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:53,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:39:53,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:53,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:39:53,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:39:53,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:39:53,403 INFO L87 Difference]: Start difference. First operand 603 states and 947 transitions. Second operand 10 states. [2019-10-03 02:39:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:53,582 INFO L93 Difference]: Finished difference Result 612 states and 959 transitions. [2019-10-03 02:39:53,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:39:53,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-03 02:39:53,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:53,593 INFO L225 Difference]: With dead ends: 612 [2019-10-03 02:39:53,593 INFO L226 Difference]: Without dead ends: 612 [2019-10-03 02:39:53,594 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:39:53,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-03 02:39:53,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-10-03 02:39:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-03 02:39:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 957 transitions. [2019-10-03 02:39:53,636 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 957 transitions. Word has length 140 [2019-10-03 02:39:53,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:53,638 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 957 transitions. [2019-10-03 02:39:53,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:39:53,638 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 957 transitions. [2019-10-03 02:39:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:39:53,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:53,646 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:53,646 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:53,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:53,646 INFO L82 PathProgramCache]: Analyzing trace with hash -212992392, now seen corresponding path program 1 times [2019-10-03 02:39:53,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:53,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:53,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:53,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:53,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:53,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:53,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:53,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:53,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:53,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:53,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:53,822 INFO L87 Difference]: Start difference. First operand 610 states and 957 transitions. Second operand 4 states. [2019-10-03 02:39:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:53,910 INFO L93 Difference]: Finished difference Result 608 states and 952 transitions. [2019-10-03 02:39:53,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:39:53,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-03 02:39:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:53,928 INFO L225 Difference]: With dead ends: 608 [2019-10-03 02:39:53,928 INFO L226 Difference]: Without dead ends: 606 [2019-10-03 02:39:53,929 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:39:53,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-03 02:39:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-10-03 02:39:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-03 02:39:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 950 transitions. [2019-10-03 02:39:53,961 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 950 transitions. Word has length 140 [2019-10-03 02:39:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:53,961 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 950 transitions. [2019-10-03 02:39:53,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 950 transitions. [2019-10-03 02:39:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 02:39:53,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:53,968 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:53,968 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:53,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:53,969 INFO L82 PathProgramCache]: Analyzing trace with hash -429509062, now seen corresponding path program 1 times [2019-10-03 02:39:53,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:53,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:53,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:53,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:53,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:54,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:54,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:54,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:54,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:54,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:54,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:54,186 INFO L87 Difference]: Start difference. First operand 606 states and 950 transitions. Second operand 6 states. [2019-10-03 02:39:54,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:54,501 INFO L93 Difference]: Finished difference Result 623 states and 971 transitions. [2019-10-03 02:39:54,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:39:54,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-03 02:39:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:54,507 INFO L225 Difference]: With dead ends: 623 [2019-10-03 02:39:54,508 INFO L226 Difference]: Without dead ends: 614 [2019-10-03 02:39:54,508 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:39:54,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-03 02:39:54,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2019-10-03 02:39:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-03 02:39:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 951 transitions. [2019-10-03 02:39:54,533 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 951 transitions. Word has length 141 [2019-10-03 02:39:54,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:54,533 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 951 transitions. [2019-10-03 02:39:54,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:54,534 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 951 transitions. [2019-10-03 02:39:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 02:39:54,543 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:54,543 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:54,543 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:54,544 INFO L82 PathProgramCache]: Analyzing trace with hash 16704540, now seen corresponding path program 1 times [2019-10-03 02:39:54,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:54,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:54,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:54,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:54,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:54,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:54,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:54,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:54,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:54,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:54,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:54,699 INFO L87 Difference]: Start difference. First operand 611 states and 951 transitions. Second operand 6 states. [2019-10-03 02:39:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:54,992 INFO L93 Difference]: Finished difference Result 614 states and 954 transitions. [2019-10-03 02:39:55,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:55,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-03 02:39:55,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:55,042 INFO L225 Difference]: With dead ends: 614 [2019-10-03 02:39:55,043 INFO L226 Difference]: Without dead ends: 611 [2019-10-03 02:39:55,044 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:39:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-03 02:39:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-03 02:39:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-03 02:39:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 947 transitions. [2019-10-03 02:39:55,068 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 947 transitions. Word has length 142 [2019-10-03 02:39:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:55,069 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 947 transitions. [2019-10-03 02:39:55,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 947 transitions. [2019-10-03 02:39:55,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:39:55,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:55,078 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:55,078 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:55,079 INFO L82 PathProgramCache]: Analyzing trace with hash -155948033, now seen corresponding path program 1 times [2019-10-03 02:39:55,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:55,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:55,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:55,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:55,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:55,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:55,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:55,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:55,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:55,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:55,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:55,233 INFO L87 Difference]: Start difference. First operand 611 states and 947 transitions. Second operand 6 states. [2019-10-03 02:39:55,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:55,449 INFO L93 Difference]: Finished difference Result 614 states and 950 transitions. [2019-10-03 02:39:55,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:55,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-03 02:39:55,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:55,455 INFO L225 Difference]: With dead ends: 614 [2019-10-03 02:39:55,455 INFO L226 Difference]: Without dead ends: 611 [2019-10-03 02:39:55,455 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:39:55,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-03 02:39:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-03 02:39:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-03 02:39:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 943 transitions. [2019-10-03 02:39:55,479 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 943 transitions. Word has length 143 [2019-10-03 02:39:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:55,480 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 943 transitions. [2019-10-03 02:39:55,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 943 transitions. [2019-10-03 02:39:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:39:55,484 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:55,484 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:55,484 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:55,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:55,485 INFO L82 PathProgramCache]: Analyzing trace with hash 121383039, now seen corresponding path program 1 times [2019-10-03 02:39:55,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:55,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:55,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:55,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:55,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:55,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:55,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:39:55,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:55,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:39:55,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:39:55,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:39:55,624 INFO L87 Difference]: Start difference. First operand 611 states and 943 transitions. Second operand 7 states. [2019-10-03 02:39:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:55,717 INFO L93 Difference]: Finished difference Result 617 states and 950 transitions. [2019-10-03 02:39:55,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:39:55,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-03 02:39:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:55,723 INFO L225 Difference]: With dead ends: 617 [2019-10-03 02:39:55,723 INFO L226 Difference]: Without dead ends: 593 [2019-10-03 02:39:55,724 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:39:55,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-03 02:39:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 590. [2019-10-03 02:39:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-03 02:39:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 906 transitions. [2019-10-03 02:39:55,748 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 906 transitions. Word has length 143 [2019-10-03 02:39:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:55,749 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 906 transitions. [2019-10-03 02:39:55,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:39:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 906 transitions. [2019-10-03 02:39:55,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-03 02:39:55,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:55,753 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:55,754 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:55,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:55,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1961384449, now seen corresponding path program 1 times [2019-10-03 02:39:55,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:55,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:55,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:55,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:55,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:55,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:55,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:55,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:55,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:55,882 INFO L87 Difference]: Start difference. First operand 590 states and 906 transitions. Second operand 6 states. [2019-10-03 02:39:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:56,016 INFO L93 Difference]: Finished difference Result 593 states and 909 transitions. [2019-10-03 02:39:56,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:56,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-03 02:39:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:56,021 INFO L225 Difference]: With dead ends: 593 [2019-10-03 02:39:56,021 INFO L226 Difference]: Without dead ends: 590 [2019-10-03 02:39:56,022 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:39:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-03 02:39:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-03 02:39:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-03 02:39:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 905 transitions. [2019-10-03 02:39:56,040 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 905 transitions. Word has length 144 [2019-10-03 02:39:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:56,040 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 905 transitions. [2019-10-03 02:39:56,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 905 transitions. [2019-10-03 02:39:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 02:39:56,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:56,044 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:56,045 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:56,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:56,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2053809604, now seen corresponding path program 1 times [2019-10-03 02:39:56,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:56,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:56,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:56,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:56,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:56,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:56,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:56,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:56,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:56,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:56,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:56,194 INFO L87 Difference]: Start difference. First operand 590 states and 905 transitions. Second operand 6 states. [2019-10-03 02:39:56,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:56,310 INFO L93 Difference]: Finished difference Result 593 states and 908 transitions. [2019-10-03 02:39:56,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:56,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-03 02:39:56,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:56,315 INFO L225 Difference]: With dead ends: 593 [2019-10-03 02:39:56,315 INFO L226 Difference]: Without dead ends: 590 [2019-10-03 02:39:56,316 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:39:56,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-03 02:39:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-03 02:39:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-03 02:39:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 904 transitions. [2019-10-03 02:39:56,334 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 904 transitions. Word has length 145 [2019-10-03 02:39:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:56,334 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 904 transitions. [2019-10-03 02:39:56,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 904 transitions. [2019-10-03 02:39:56,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-03 02:39:56,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:56,338 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:56,339 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:56,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:56,339 INFO L82 PathProgramCache]: Analyzing trace with hash -496350234, now seen corresponding path program 1 times [2019-10-03 02:39:56,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:56,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:56,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:56,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:56,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:39:56,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:56,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:39:56,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:56,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:39:56,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:39:56,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:39:56,515 INFO L87 Difference]: Start difference. First operand 590 states and 904 transitions. Second operand 12 states. [2019-10-03 02:39:56,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:56,791 INFO L93 Difference]: Finished difference Result 599 states and 914 transitions. [2019-10-03 02:39:56,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:39:56,792 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-03 02:39:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:56,796 INFO L225 Difference]: With dead ends: 599 [2019-10-03 02:39:56,796 INFO L226 Difference]: Without dead ends: 597 [2019-10-03 02:39:56,797 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:39:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-03 02:39:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2019-10-03 02:39:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-03 02:39:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 910 transitions. [2019-10-03 02:39:56,816 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 910 transitions. Word has length 146 [2019-10-03 02:39:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:56,816 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 910 transitions. [2019-10-03 02:39:56,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:39:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 910 transitions. [2019-10-03 02:39:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 02:39:56,820 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:56,820 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:56,821 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:56,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:56,821 INFO L82 PathProgramCache]: Analyzing trace with hash 94623585, now seen corresponding path program 1 times [2019-10-03 02:39:56,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:56,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:56,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:56,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:56,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 02:39:57,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:57,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:39:57,008 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-10-03 02:39:57,010 INFO L207 CegarAbsIntRunner]: [62], [63], [320], [324], [327], [343], [345], [347], [384], [385], [387], [388], [389], [391], [394], [396], [400], [858], [860], [957], [960], [965], [968], [1032], [1033], [1034], [1039], [1072], [1073], [1153], [1155], [1158], [1160], [1166], [1170], [1173], [1209], [1212], [1217], [1222], [1227], [1232], [1237], [1240], [1356], [1359], [1360], [1409], [1414], [1417], [1436], [1621], [1625], [1629], [1633], [1637], [1641], [1644], [1646], [1647], [1660], [1665], [1669], [1673], [1689], [1691], [1694], [1696], [1698], [1703], [1705], [1708], [1814], [1815], [2174], [2178], [2181], [2199], [2372], [2373], [2374], [2375], [2376], [2377], [2378], [2379], [2380], [2390], [2391], [2392], [2393], [2414], [2415], [2416], [2417], [2418], [2419], [2426], [2427], [2428], [2478], [2479], [2508], [2509], [2510], [2511], [2522], [2546], [2547], [2548], [2549], [2554], [2555], [2556], [2562], [2588], [2589], [2590], [2591], [2592], [2593], [2594], [2595], [2596], [2626], [2627], [2628] [2019-10-03 02:39:57,071 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:39:57,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:39:57,185 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:39:57,187 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 147 root evaluator evaluations with a maximum evaluation depth of 0. Performed 147 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 254 variables. [2019-10-03 02:39:57,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:57,191 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:39:57,259 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:39:57,259 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:39:57,263 INFO L420 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2019-10-03 02:39:57,263 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:39:57,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:39:57,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 10 [2019-10-03 02:39:57,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:57,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:39:57,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:39:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:39:57,266 INFO L87 Difference]: Start difference. First operand 595 states and 910 transitions. Second operand 2 states. [2019-10-03 02:39:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:57,266 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:39:57,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:39:57,267 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 147 [2019-10-03 02:39:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:57,267 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:39:57,267 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:39:57,267 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:39:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:39:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:39:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:39:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:39:57,268 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2019-10-03 02:39:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:57,268 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:39:57,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:39:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:39:57,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:39:57,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:39:57 BoogieIcfgContainer [2019-10-03 02:39:57,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:39:57,276 INFO L168 Benchmark]: Toolchain (without parser) took 10605.69 ms. Allocated memory was 138.4 MB in the beginning and 430.4 MB in the end (delta: 292.0 MB). Free memory was 81.6 MB in the beginning and 115.6 MB in the end (delta: -33.9 MB). Peak memory consumption was 258.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:57,277 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.4 MB. Free memory was 103.2 MB in the beginning and 103.0 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:39:57,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1111.09 ms. Allocated memory was 138.4 MB in the beginning and 199.2 MB in the end (delta: 60.8 MB). Free memory was 81.4 MB in the beginning and 137.9 MB in the end (delta: -56.5 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:57,279 INFO L168 Benchmark]: Boogie Preprocessor took 285.06 ms. Allocated memory is still 199.2 MB. Free memory was 137.9 MB in the beginning and 129.2 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:57,280 INFO L168 Benchmark]: RCFGBuilder took 2619.41 ms. Allocated memory was 199.2 MB in the beginning and 271.6 MB in the end (delta: 72.4 MB). Free memory was 129.2 MB in the beginning and 162.5 MB in the end (delta: -33.3 MB). Peak memory consumption was 93.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:57,281 INFO L168 Benchmark]: TraceAbstraction took 6584.98 ms. Allocated memory was 271.6 MB in the beginning and 430.4 MB in the end (delta: 158.9 MB). Free memory was 162.5 MB in the beginning and 115.6 MB in the end (delta: 47.0 MB). Peak memory consumption was 205.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:57,284 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.26 ms. Allocated memory is still 138.4 MB. Free memory was 103.2 MB in the beginning and 103.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1111.09 ms. Allocated memory was 138.4 MB in the beginning and 199.2 MB in the end (delta: 60.8 MB). Free memory was 81.4 MB in the beginning and 137.9 MB in the end (delta: -56.5 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 285.06 ms. Allocated memory is still 199.2 MB. Free memory was 137.9 MB in the beginning and 129.2 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2619.41 ms. Allocated memory was 199.2 MB in the beginning and 271.6 MB in the end (delta: 72.4 MB). Free memory was 129.2 MB in the beginning and 162.5 MB in the end (delta: -33.3 MB). Peak memory consumption was 93.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6584.98 ms. Allocated memory was 271.6 MB in the beginning and 430.4 MB in the end (delta: 158.9 MB). Free memory was 162.5 MB in the beginning and 115.6 MB in the end (delta: 47.0 MB). Peak memory consumption was 205.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: 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 76 procedures, 885 locations, 1 error locations. SAFE Result, 6.5s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12718 SDtfs, 538 SDslu, 49057 SDs, 0 SdLazy, 1678 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=751occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.6643835616438356 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2116 NumberOfCodeBlocks, 2116 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2101 ConstructedInterpolants, 0 QuantifiedInterpolants, 360237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 530/540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...